C2, attainment.
ProvedForkPinning.capacity_attained_iffaether-catalogprobability
C2, attainment. The capacity log 2 is reached exactly at the balanced forks that the
observable determines.
theorem ForkPinning.capacity_attained_iff(X : Ω → κ) (Y : Ω → Bool) :
mutualInfo X Y = Real.log 2 ↔ Determines X Y ∧ prb Y true = 1 / 2 := by sorry
Formalization Note Transplanted verbatim from the Aether Catalog source Probability/ForkPinningCapacity.lean; the statement is byte-identical to the source declaration, elaborated with autoImplicit disabled in the platform environment.
Preamble
-- Thm stub generated from Probability/ForkPinningCapacity.lean
import Mathlib
import Definitions.Def_Probability_ForkPinningCore
import Definitions.Def_Probability_ForkPinningGalois
/-
# Capacity of a binary fork: one bit, attained exactly at the balanced coset forks
`ForkPinningCore` proves the two capacity bounds `I(X;Y) ≤ H Y` and `I(X;Y) ≤ log |κ|`. For a
*binary* fork these combine into the hard ceiling `I ≤ log 2`: no congruence observable, however
large its conductor, can extract more than one bit from a two-valued splitting statistic. This
file closes conjecture **C2** of `FUTURE_DIRECTIONS.md` by determining exactly when the ceiling
is attained.
Main results:
* `ForkPinning.entropy_bool_eq_log_two_iff` : `H Y = log 2` iff the fork is balanced (the strict
maximum-entropy statement for two-valued statistics).
* `ForkPinning.mutualInfo_bool_le_log_two` : the one-bit ceiling.
* `ForkPinning.capacity_attained_iff` : `I(X;Y) = log 2` **iff** `X` determines `Y` *and* `Y` is
balanced — capacity is attained exactly at the balanced forks that the observable pins.
* `ForkPinning.prb_hom_uniform` : a surjective character is uniformly distributed on a uniform
group (the counting input).
* `ForkPinning.prb_signBool_true` : the sign of a uniformly random permutation of `Fin n`,
`n ≥ 2`, is balanced.
* `ForkPinning.sign_attains_capacity` and `ForkPinning.sign_capacity_attained_iff` : for `Sₙ`
the supremum `log 2` is attained, and *only* by the two forks `sign` and `¬sign` — the exact
formal counterpart of the measurement "the only congruence structure in the whole `S₄`
splitting is the sign".
-/
open ForkPinning
open Finset Real
/-! ## The strict maximum-entropy statement for binary forks -/
variable {Ω : Type*} [Fintype Ω] [Nonempty Ω]
/-! ## The one-bit ceiling and its attainment -/
variable {Ω : Type*} [Fintype Ω] [Nonempty Ω]
variable {κ : Type*} [Fintype κ] [DecidableEq κ]Formal statement
theorem ForkPinning.capacity_attained_iff(X : Ω → κ) (Y : Ω → Bool) :
mutualInfo X Y = Real.log 2 ↔ Determines X Y ∧ prb Y true = 1 / 2 := by sorrySource