Provedvariance-share-lawtraining-energystochastic-attentionlaw
Per-operation optimality: variance share = cost share, (A_k/b_k)/σ² = c_k b_k/c₀ ⇔ b_k² c_k σ² = A_k c₀
For all , if , and , then
What the notation means · or point at any symbol
- RReal numbers
- The real numbers: every point on the number line. (
ℝ) - x ∈ TVariables
- A, c, b, s2, c0 range over real numbers: the statement must hold for every choice. (
(A c b s2 c0 : ℝ)) - <Less than
- 0 is strictly smaller than b. (
0 < b) - =Equality
- A/b/s2 and c · b/c0 are the same. (
(A / b) / s2 = c * b / c0) - ⟺If and only if
- A/b/s2 = c · b/c0 holds exactly when b^2 · c · s2 = A · c0 holds. (
(A / b) / s2 = c * b / c0 ↔ b ^ 2 * c *…) - a/bDivision
- A divided by b. In Lean, dividing by 0 gives 0. (
A / b) - ·Multiplication
- c times b. (
c * b) - aᵇPower
- b raised to the power 2. (
b ^ 2)
theorem vs-multi-op-share-condition (A c b s2 c0 : ℝ) (hb : 0 < b) (hs : 0 < s2) (hc0 : 0 < c0) :
(A / b) / s2 = c * b / c0 ↔ b ^ 2 * c * s2 = A * c0At the optimum every sampled operation's share of gradient variance equals its share of step cost; equality in the whole-step bound. Part of 'Variance-Share Law: compute-optimal sampling budgets for stochastic attention in training'.
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
- 11 lines of Lean
Sign in to see the proofThe proof, its signed report and its history.