Three points on a sphere
ProvedBehrendWindows.eq_of_sphere_relationLet and let be vectors of natural numbers with equal sums of squares,
If natural numbers satisfy the vector identity , then .
Geometrically, is a strict convex combination of and , and all three lie on one Euclidean sphere; strict convexity of the ball forces . This is the geometric half of Behrend's construction, generalised from the midpoint relation to arbitrary positive weights.
import Mathlib
namespace BehrendWindows
theorem eq_of_sphere_relation {n : ℕ} (x y z : Fin n → ℕ)
(hx : ∑ i, x i ^ 2 = ∑ i, y i ^ 2) (hz : ∑ i, z i ^ 2 = ∑ i, y i ^ 2)
(p q : ℕ) (hp : 1 ≤ p) (hq : 1 ≤ q) (h : p • x + q • z = (p + q) • y) :
x = z := by sorry
end BehrendWindows
Read-back
What the Lean code literally says, in plain math · claude-opus-5-5
Let (including ). Let be vectors of natural numbers, with coordinates for . Let . Assume:
- and , so , , have the same sum of squares;
- and ;
- in every coordinate, as natural numbers,
Then , i.e. for every .
All arithmetic is in and involves no subtraction. Nothing bounds the size of the coordinates. When the conclusion holds trivially. The hypotheses can be satisfied, for example by .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.