OAI/NumberTheory/PrimePackets/ConditionalShannon.lean
6 declarations, 0 contain sorry, 0 declared as axioms
Finite conditional entropy, including zero-mass cells
These algebraic chain rules are used to compare finite observations with the expanding leaf partitions in the metric entropy calculation.
- lemma
OAI.PrimeDegreePackets.finiteShannon_mulline 17 - lemma
OAI.PrimeDegreePackets.finiteShannon_mass_decompositionline 24 - theorem
OAI.PrimeDegreePackets.finiteShannon_joint_mass_leline 47Source documentation
Subadditivity for a nonnegative finite measure; its total mass need not be one.
theorem finiteShannon_joint_mass_le {α β : Type*} [Fintype α] [Fintype β] (p : α × β → ℝ) (hp : ∀ z, 0 ≤ p z) : finiteShannon p + Real.negMulLog (∑ z, p z) ≤ finiteShannon (fun a => ∑ b, p (a,b)) + finiteShannon (fun b => ∑ a, p (a,b)) := by …Mentions: OAI.PrimeDegreePackets.finiteShannon
- theorem
OAI.PrimeDegreePackets.finiteShannon_submodularline 80Source documentation
The finite entropy submodularity inequality
H(ABC)+H(A) ≤ H(AB)+H(AC).theorem finiteShannon_submodular {α β γ : Type*} [Fintype α] [Fintype β] [Fintype γ] (p : α × (β × γ) → ℝ) (hp : ∀ z, 0 ≤ p z) : finiteShannon p + finiteShannon (fun a => ∑ z : β × γ, p (a,z)) ≤ finiteShannon (fun z : α × β => ∑ c, p (z.1,(z.2,c))) + finiteShannon (fun z : α × γ => ∑ b, p (z.1,(b,z.2))) := by …Mentions: OAI.PrimeDegreePackets.finiteShannon
- lemma
OAI.PrimeDegreePackets.finiteShannon_fst_leline 90 - lemma
OAI.PrimeDegreePackets.finiteShannon_joint_decompositionline 97