Provedattentioninnovationexternal-review-3
Innovation control: one-trial coefficient error identity
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
- r, a, v range over J → ℝ: the statement must hold for every choice. (
(r a v : J → ℝ)) - x ∈ TVariables
- m, o, p, Vr, Vπ, β, star range over real numbers: the statement must hold for every choice. (
(m o p Vr Vπ β star : ℝ)) - ∑Summation
- Add up r(j) · (v(j) − m)^2 for every j. (
∑ j, r j * (v j - m) ^ 2) - =Equality
- ∑ j, r(j) · (v(j) − m)^2 and Vr are the same. (
∑ j, r j * (v j - m) ^ 2 = Vr) - RReal numbers
- The real numbers: every point on the number line. (
ℝ) - ·Multiplication
- r(j) times (v(j) − m)^2. (
r j * (v j - m) ^ 2) - aᵇPower
- v(j) − m raised to the power 2. (
(v j - m) ^ 2) - -Subtraction
- v(j) minus m. On ℕ, Lean's subtraction stops at 0: 2 − 5 = 0. (
v j - m) - +Addition
- ((a(j) − β) · (v(j) − m))^2 − 2 · a(j) · (o − m) · ((a(j) … plus a(j) · (o − m)^2. (
((a j - β) * (v j - m)) ^ 2 - 2 * a j *…)
theorem innov-predictable-coefficient-one-trial {J : Type} [Fintype J] (r a v : J → ℝ) (m o p Vr Vπ β star : ℝ) (hVr : ∑ j, r j * (v j - m) ^ 2 = Vr) (hvar : ∑ j, r j * a j * (v j - o) ^ 2 = p * Vπ) (hmean : ∑ j, r j * a j * (v j - o) = 0) (hstar : Vr * star = p * Vπ) :
(∑ j, r j * (((a j - β) * (v j - m)) ^ 2 - 2 * a j * (o - m) * ((a j - β) * (v j - m)) + a j * (o - m) ^ 2)) - (∑ j, r j * (((a j - star) * (v j - m)) ^ 2 - 2 * a j * (o - m) * ((a j - star) * (v j - m)) + a j * (o - m) ^ 2)) = Vr * (β - star) ^ 2Finite scalar algebra for the conditional second-moment penalty under the optimal coefficient relation. Full predictable stopped-run martingale formalization remains a paper proof.
How it was proved
- Proved
- 6 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
- 13 lines of Lean
Sign in to see the proofThe proof, its signed report and its history.