Documentation

Atlas.ProbabilisticMethodsInCombinatorics.code.Chapter10.ShearerCombinatorial

Shannon entropy of the uniform distribution on a nonempty finset $F$ equals $\log |F|$.

The Shannon entropy of a PMF is bounded by the logarithm of its support size, via Jensen's inequality applied to $-x \log x$.

Pushing forward the uniform distribution on $F$ by a map $f$ gives entropy at most $\log |f(F)|$.

theorem ShearerCombinatorial.shearer_set_family_inequality {n s : } (F : Finset (Fin nBool)) (A : Fin sFinset (Fin n)) (k : ) (hcover : ShearerEntropy.CoveringCondition A k) (hF : F.Nonempty) (hk : 0 < k) :
F.card ^ k j : Fin s, (Finset.image (fun (x : Fin nBool) (i : (A j)) => x i) F).card

Combinatorial Shearer for set families (Corollary 10.4.7): if $\{A_j\}_{j=1}^s$ covers each index at least $k$ times, then $|F|^k \le \prod_j |F|_{A_j}|$ where $|F|_{A_j}|$ is the number of projections of $F$ onto coordinates in $A_j$.

def LoomisWhitney.coordProject {n : } {α : Type u_1} (i : Fin n) (x : Fin nα) :
(Finset.univ.erase i)α

Projection of x : Fin n → α onto all coordinates except the $i$-th one.

Instances For
    theorem LoomisWhitney.loomis_whitney_inequality {n : } {α : Type u_1} [Fintype α] [DecidableEq α] (S : Finset (Fin nα)) (hne : S.Nonempty) :
    S.card ^ (n - 1) i : Fin n, (Finset.image (coordProject i) S).card

    The Loomis-Whitney inequality (Corollary 10.4.6): for any finite set $S \subseteq A^n$, $|S|^{n-1} \le \prod_{i=1}^n |\pi_i(S)|$ where $\pi_i$ is the projection that drops coordinate $i$.