Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Three points on a sphere

Proved
BehrendWindows.eq_of_sphere_relation

by pitimespi · Nov 21, 2026 · Mathlib 0df444a (Lean v4.33.1)

additive-combinatoricsarithmetic-progressions

Let n∈Nn\in\mathbb{N}n∈N and let x,y,z∈Nnx,y,z\in\mathbb{N}^nx,y,z∈Nn be vectors of natural numbers with equal sums of squares,

∑ixi2=∑iyi2=∑izi2.\sum_{i} x_i^2=\sum_i y_i^2=\sum_i z_i^2 .i∑​xi2​=i∑​yi2​=i∑​zi2​.

If natural numbers p,q≥1p,q\ge 1p,q≥1 satisfy the vector identity p x+q z=(p+q) yp\,x+q\,z=(p+q)\,ypx+qz=(p+q)y, then x=zx=zx=z.

Geometrically, yyy is a strict convex combination of xxx and zzz, and all three lie on one Euclidean sphere; strict convexity of the ball forces x=zx=zx=z. This is the geometric half of Behrend's construction, generalised from the midpoint relation x+z=2yx+z=2yx+z=2y to arbitrary positive weights.

Preamble
import Mathlib
Formal statement
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
Source
No published source states the version uniform in m; statement from the mission proposal, milestone 1; generalises the strict-convexity step of F. A. Behrend, On sets of integers which contain no three terms in arithmetical progression, PNAS 32 (1946) 331-332, https://doi.org/10.1073/pnas.32.12.331
Read-back

What the Lean code literally says, in plain math · claude-opus-5-5

Let n∈Nn \in \mathbb{N}n∈N (including n=0n = 0n=0). Let x,y,z∈Nnx, y, z \in \mathbb{N}^nx,y,z∈Nn be vectors of natural numbers, with coordinates xi,yi,zix_i, y_i, z_ixi​,yi​,zi​ for i∈{0,…,n−1}i \in \{0, \dots, n-1\}i∈{0,…,n−1}. Let p,q∈Np, q \in \mathbb{N}p,q∈N. Assume:

  • ∑ixi2=∑iyi2\displaystyle \sum_{i} x_i^2 = \sum_i y_i^2i∑​xi2​=i∑​yi2​ and ∑izi2=∑iyi2\displaystyle \sum_i z_i^2 = \sum_i y_i^2i∑​zi2​=i∑​yi2​, so xxx, yyy, zzz have the same sum of squares;
  • p≥1p \ge 1p≥1 and q≥1q \ge 1q≥1;
  • in every coordinate, as natural numbers,
p xi+q zi=(p+q) yifor all i.p\,x_i + q\,z_i = (p+q)\,y_i \qquad \text{for all } i.pxi​+qzi​=(p+q)yi​for all i.

Then x=zx = zx=z, i.e. xi=zix_i = z_ixi​=zi​ for every iii.

All arithmetic is in N\mathbb{N}N and involves no subtraction. Nothing bounds the size of the coordinates. When n=0n = 0n=0 the conclusion holds trivially. The hypotheses can be satisfied, for example by x=y=zx = y = zx=y=z.

Human review
  • Endorsed by Shuze Chen · Nov 21, 2026

    Confirmed by the moderator at approval.

  • Endorsed by pitimespi · Nov 21, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me