AFTD Auto-Formalizing Theoretical Domains

norm_sq_three_ap_unit

theoremverifiedformalization

For any 3-term arithmetic progression x₀, x₀ + v, x₀ + 2 • v in n-dimensional Euclidean space with unit spacing ||v|| = 1, the alternating sum ||x₀||^2 - 2 * ||x₀ + v||^2 + ||x₀ + 2 • v||^2 equals 2.

Statement

theorem norm_sq_three_ap_unit {n : ℕ} (x₀ v : EuclideanSpace ℝ (Fin n)) (hv : ‖v‖ = 1) :
    ‖x₀‖ ^ 2 - 2 * ‖x₀ + v‖ ^ 2 + ‖x₀ + (2 : ℝ) • v‖ ^ 2 = 2
Formalizes
arXiv:2611.12360, Lemma 2.1
Verified
13 Nov 2026
Axioms
Classical.choiceQuot.soundpropext
Used by 1

Read back from the Lean

For any natural number $n$ and any vectors $x₀, v \in \mathbb{R}^n$ (in the Euclidean space EuclideanSpace ℝ (Fin n)), if the Euclidean norm of $v$ is $1$ ($\|v\| = 1$), then $\|x₀\|^2 - 2\|x₀ + v\|^2 + \|x₀ + 2v\|^2 = 2$.

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

The proof, explained

The proof expands the squared norms of x₀ + v and x₀ + 2 • v using the binomial formula for real inner product spaces. Factoring out the scalar 2 and substituting the unit spacing condition ‖v‖ = 1 reduces the expression to a polynomial in ‖x₀‖² and ⟨x₀, v⟩. All non-constant terms cancel identically, leaving 2.

  1. The squared norms ‖x₀ + v‖² and ‖x₀ + 2 • v‖² are expanded using the inner product expansion formula.

    Applying the identity for the squared norm of a sum in a real inner product space (`norm_add_sq_real`) rewrites ‖x₀ + v‖² as ‖x₀‖² + 2 * ⟨x₀, v⟩ + ‖v‖², and similarly rewrites ‖x₀ + 2 • v‖² as ‖x₀‖² + 2 * ⟨x₀, 2 • v⟩ + ‖2 • v‖².

    lines 4–5

    uses norm_add_sq_real

      rw [norm_add_sq_real x₀ v]
      rw [norm_add_sq_real x₀ ((2 : ℝ) • v)]
  2. The scalar 2 is factored out of the inner product and norm, and the unit norm condition ‖v‖ = 1 is substituted.

    Rewriting with `inner_smul_right` factors the scalar 2 out of the inner product, replacing ⟨x₀, 2 • v⟩ with 2 * ⟨x₀, v⟩. Then `norm_smul` splits ‖2 • v‖ into ‖2‖ * ‖v‖. Finally, rewriting with the hypothesis `hv` replaces ‖v‖ with 1.

    lines 6–8

    uses inner_smul_right, norm_smul

      rw [inner_smul_right]
      rw [norm_smul]
      rw [hv]
  3. The numerical constants are evaluated and the algebraic terms cancel to yield 2.

    The tactic `norm_num` evaluates the constant subexpressions 1² = 1 and (‖(2 : ℝ)‖ * 1)² = 4. Then `ring` simplifies the resulting polynomial in ‖x₀‖² and ⟨x₀, v⟩: the ‖x₀‖² terms cancel via 1 - 2 + 1 = 0 and the inner product terms cancel via -4 + 4 = 0, leaving -2 + 4 = 2.

    lines 9–10

      norm_num
      ring
norm_add_sq_real
In a real inner product space, the squared norm of a sum satisfies ‖x + y‖² = ‖x‖² + 2 * ⟨x, y⟩ + ‖y‖².
inner_smul_right
The inner product is homogeneous in its second argument: ⟨x, r • y⟩ = r * ⟨x, y⟩.
norm_smul
The norm of a scalar multiple equals the norm of the scalar times the norm of the vector: ‖r • x‖ = ‖r‖ * ‖x‖.

Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.

Lean source view module on GitHub

/-- Second difference identity of squared norms for a 3-term arithmetic progression with unit spacing. -/theorem norm_sq_three_ap_unit {n : ℕ} (x₀ v : EuclideanSpace ℝ (Fin n)) (hv : ‖v‖ = 1) :    ‖x₀‖ ^ 2 - 2 * ‖x₀ + v‖ ^ 2 + ‖x₀ + (2 : ℝ) • v‖ ^ 2 = 2 := by  rw [norm_add_sq_real x₀ v]  rw [norm_add_sq_real x₀ ((2 : ℝ) • v)]  rw [inner_smul_right]  rw [norm_smul]  rw [hv]  norm_num  ring
See it in the graphDiscuss this resultChallenge it