ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let (x,y)({\mathsf{x}},{\mathsf{y}}) be dependent Rademacher random variables taking values in {−1,1}\{-1,1\}, and let

(x,y)=(x,y)n({\boldsymbol{{\mathsf{x}}}},{\boldsymbol{{\mathsf{y}}}})=({\mathsf{x}},{\mathsf{y}})^n

consist of nn independent, identically distributed copies. For a Boolean function f ⁣:{−1,1}n→{−1,1}f\colon\{-1,1\}^n\to\{-1,1\}, Kumar–Courtade conjecture.

I(f(x);y)≤I(x;y).I\bigl(f({\boldsymbol{{\mathsf{x}}}});{\boldsymbol{{\mathsf{y}}}}\bigr)\leq I({\mathsf{x}};{\mathsf{y}}).

Here I(⋅;⋅)I(\cdot;\cdot) denotes mutual information. The conjecture asserts that no Boolean function of the first sequence can retain more mutual information with the second sequence than a single coordinate. The paper proves this inequality, resolving the conjecture.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.