proofs
Provedbalanced-conversionconversion-theoremattention-compute-lawlower-bound

Transcript lemma: if the output proposal depends on the member only through a transcript t, then Σ_t Σ_b E_t(b)/r_t(b) ≥ (1/|T|)(Σ_b √Σ_t E_t(b))²

For all T,J∈Type⁡\htmlData{mx=1}{T, J \in \htmlData{mx=0}{\operatorname{Type}}}, E:T→J→R\htmlData{mx=5}{E : \htmlData{mx=0}{T} \mathrel{\htmlData{mx=4}{\to}} \htmlData{mx=1}{J} \mathrel{\htmlData{mx=3}{\to}} \htmlData{mx=2}{\mathbb{R}}} and r:T→J→R\htmlData{mx=5}{r : \htmlData{mx=0}{T} \mathrel{\htmlData{mx=4}{\to}} \htmlData{mx=1}{J} \mathrel{\htmlData{mx=3}{\to}} \htmlData{mx=2}{\mathbb{R}}}, if ∀t,b, 0≤E(t,b)\htmlData{mx=5}{\forall t, b,\ 0 \mathrel{\htmlData{mx=4}{\leq}} \htmlData{mx=3}{\htmlData{mx=0}{E}(\htmlData{mx=1}{t}, \htmlData{mx=2}{b})}}, ∀t,b, 0<r(t,b)\htmlData{mx=5}{\forall t, b,\ 0 \mathrel{\htmlData{mx=4}{<}} \htmlData{mx=3}{\htmlData{mx=0}{r}(\htmlData{mx=1}{t}, \htmlData{mx=2}{b})}} and ∀t, ∑br(t,b)=1\htmlData{mx=6}{\forall t,\ \htmlData{mx=4}{\sum_{b} \htmlData{mx=3}{\htmlData{mx=0}{r}(\htmlData{mx=1}{t}, \htmlData{mx=2}{b})}} \mathrel{\htmlData{mx=5}{=}} 1} (given Fintype⁡ T\htmlData{mx=2}{\htmlData{mx=0}{\operatorname{Fintype}}\,\htmlData{mx=1}{T}}, Fintype⁡ J\htmlData{mx=2}{\htmlData{mx=0}{\operatorname{Fintype}}\,\htmlData{mx=1}{J}} and Nonempty⁡ T\htmlData{mx=2}{\htmlData{mx=0}{\operatorname{Nonempty}}\,\htmlData{mx=1}{T}}), then

1card⁡(T)⋅(∑b∑tE(t,b))2≤∑t∑bE(t,b)r(t,b)\begin{aligned} & \htmlData{mx=14}{\htmlData{mx=5}{\frac{1}{\htmlData{mx=4}{\htmlData{mx=3}{\htmlData{mx=1}{\operatorname{card}}(\htmlData{mx=2}{T})}}}} \cdot \htmlData{mx=13}{\left(\htmlData{mx=12}{\sum_{b} \htmlData{mx=11}{\sqrt{\htmlData{mx=10}{\sum_{t} \htmlData{mx=9}{\htmlData{mx=6}{E}(\htmlData{mx=7}{t}, \htmlData{mx=8}{b})}}}}}\right)^{2}}} \\ & \quad \htmlData{mx=0}{\leq} \htmlData{mx=25}{\sum_{t} \htmlData{mx=24}{\sum_{b} \htmlData{mx=23}{\frac{\htmlData{mx=18}{\htmlData{mx=15}{E}(\htmlData{mx=16}{t}, \htmlData{mx=17}{b})}}{\htmlData{mx=22}{\htmlData{mx=19}{r}(\htmlData{mx=20}{t}, \htmlData{mx=21}{b})}}}}} \end{aligned}
What the notation means · or point at any symbol
Type
Type: a definition from the library, not special notation. Its name is its meaning; open it in Lean to see how it is defined. (Type)
x ∈ TVariables
T, J range over Type: the statement must hold for every choice. ((T J : Type))
Fintype
Fintype: a definition from the library, not special notation. Its name is its meaning; open it in Lean to see how it is defined. (Fintype)
f(x)Function application
Fintype applied to T. Lean writes f x; papers write f(x). (Fintype T)
Nonempty
Nonempty: a definition from the library, not special notation. Its name is its meaning; open it in Lean to see how it is defined. (Nonempty)
∀For all
The statement after the comma holds for every t, b. (∀ t b, 0 ≤ E t b)
·Multiplication
1/card(T) times (∑ b, √(∑ t, E(t, b)))^2. ((1 / (Fintype.card T : ℝ)) * (∑ b, Real…)
a/bDivision
1 divided by card(T). In Lean, dividing by 0 gives 0. (1 / (Fintype.card T : ℝ))
⟹Implies
If J, then ℝ. (Between types, A → B is the type of functions from A to B.) (J → ℝ)
∑Summation
Add up r(t, b) for every b. (∑ b, r t b)
=Equality
∑ b, r(t, b) and 1 are the same. (∑ b, r t b = 1)
(x : T)As real numbers
card(T) read as an element of real numbers. Mathematicians leave this implicit; Lean needs it to know which kind of number is meant. ((Fintype.card T : ℝ))
card
Fintype.card: a definition from the library, not special notation. Its name is its meaning; open it in Lean to see how it is defined. (Fintype.card)
≤At most
0 is less than or equal to E(t, b). (0 ≤ E t b)
<Less than
0 is strictly smaller than r(t, b). (0 < r t b)
RReal numbers
The real numbers: every point on the number line. (ℝ)
aᵇPower
∑ b, √(∑ t, E(t, b)) raised to the power 2. ((∑ b, Real.sqrt (∑ t, E t b)) ^ 2)
√Square root
The non-negative number whose square is ∑ t, E(t, b). (Real.sqrt (∑ t, E t b))

An abstract lower bound for deterministic algorithms with finitely many transcripts: per-transcript Cauchy–Schwarz, √-superadditivity across fibres, and the power mean over transcripts. Part of Balanced Conversion: the Conversion Theorem's two-way descent factor is exactly 1 + (p−q)²/(q(1−q)), so additive oracle error is second order at mass-balanced nodes; a mass-balanced descent converts any deterministic additive-ε oracle with loss n^{O(ε²)}, and the biased product family shows this is tight. Quantifies the last residual class of the Attention Compute Law.

How it was proved

Proved
4 October 2026
By
Ajax, with the agent “Baguette math & proofs (Claude Code, 2026-10-03)”
Checked by
Lean's kernel (Lean 4.33.1, with Mathlib); the proof is signed and replays offline
Axioms
Classical.choice, Quot.sound, propext
Proof
54 lines of Lean
Sign in to see the proofThe proof, its signed report and its history.

More proved statements