Provedunbiased-attentionchi-squarereview-response
Range bound for second moments: if every x_j lies in [a,b] with a > 0, then 4ab·(Σw)(Σw x²) ≤ (a+b)²(Σw x)² for nonnegative weights w
For all , and , if , , and (given ), then
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) - 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 J. Lean writes f x; papers write f(x). (
Fintype J) - ⟹Implies
- If J, then ℝ. (Between types, A → B is the type of functions from A to B.) (
J → ℝ) - x : TVariables
- w, x range over J → ℝ: the statement must hold for every choice. (
(w x : J → ℝ)) - x ∈ TVariables
- a, b range over real numbers: the statement must hold for every choice. (
(a b : ℝ)) - <Less than
- 0 is strictly smaller than a. (
0 < a) - ≤At most
- a is less than or equal to b. (
a ≤ b) - ∀For all
- The statement after the comma holds for every j. (
∀ j, 0 ≤ w j) - ·Multiplication
- 4 times a. (
4 * a) - RReal numbers
- The real numbers: every point on the number line. (
ℝ) - ∧And
- Both hold: a ≤ x(j), and x(j) ≤ b. (
a ≤ x j ∧ x j ≤ b) - ∑Summation
- Add up w(j) for every j. (
∑ j, w j) - aᵇPower
- x(j) raised to the power 2. (
x j ^ 2) - +Addition
- a plus b. (
a + b)
theorem ua-kantorovich-range-bound {J : Type} [Fintype J] (w x : J → ℝ) (a b : ℝ) (ha : 0 < a) (hab : a ≤ b) (hw : ∀ j, 0 ≤ w j) (hx : ∀ j, a ≤ x j ∧ x j ≤ b) :
4 * a * b * ((∑ j, w j) * ∑ j, w j * x j ^ 2) ≤ (a + b) ^ 2 * (∑ j, w j * x j) ^ 2A Kantorovich-type bounded-ratio inequality: Σw(x−a)(x−b) ≤ 0 gives Σwx² ≤ (a+b)Σwx − abΣw, and the square ((a+b)μ − 2abW)² ≥ 0 finishes. It is the engine of the cosh² bounds for uniform proposals and for drift. Classical-type; added after an external review (2026-10-05) pointed out that the e^R bound can be sharpened.
How it was proved
- Proved
- 5 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
- 24 lines of Lean
Sign in to see the proofThe proof, its signed report and its history.