AFTD Auto-Formalizing Theoretical Domains

one_strongly_euclidean_canonical_projection_unbounded

theoremverified

For any real L there is a metric on four points covered by two 1-strongly Euclidean pairs {0,1} and {2,3}, with d(0,1)=d(2,3)=1, such that the canonical projections of 2 and 3 onto the affine line through the first pair are more than L apart. The projection difference is computed from the squared distances to 0 and 1.

Statement

theorem one_strongly_euclidean_canonical_projection_unbounded : ∀ L : ℝ,
  ∃ m : MetricSpace (Fin 4), letI := m
    IsOneStronglyEuclidean ({0,1} : Set (Fin 4)) ∧
    IsOneStronglyEuclidean ({2,3} : Set (Fin 4)) ∧
    dist (0 : Fin 4) 1 = 1 ∧ dist (2 : Fin 4) 3 = 1 ∧
    L < |((dist (2 : Fin 4) 0)^2 - (dist (2 : Fin 4) 1)^2) / 2 -
         ((dist (3 : Fin 4) 0)^2 - (dist (3 : Fin 4) 1)^2) / 2|
Source
OP-1304, arXiv:2611.08546; obstruction to using the canonical one-point projections as uniformly Lipschitz maps.
Verified
12 Nov 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 1
  • IsOneStronglyEuclideanA subset U of a metric space X is 1-strongly Euclidean in X if for every point x in X, there exists a real Hilbert space H and an isometry…

The proof, explained

To show that the canonical projection difference can be arbitrarily large, we construct a 4-point metric space depending on a real parameter r ≥ 1 by grouping the points into two pairs, {0, 1} and {2, 3}. The within-pair distances are set to 1, while between-pair distances are set to r for points of the same parity and r + 1 for points of opposite parity. Because every 3-point subset embeds isometrically into the real line ℝ, both pairs {0, 1} and {2, 3} are 1-strongly Euclidean. Finally, choosing r = |L| + 2 ensures that the canonical projection difference equals 2r + 1 = 2|L| + 5, which strictly exceeds L.

  1. The proposed distance function on Fin 4 satisfies all metric space axioms. automation

    The distance from any point to itself is 0 by definition. Symmetry, the triangle inequality, and the identity of indiscernibles are verified by exhausting all finitely many points (up to 4³ = 64 triples) using fin_cases, with linear arithmetic and numerical evaluation closing every case.

    lines 5–14

      dist_self := by intro a; simp
      dist_comm := by
        intro a b
        fin_cases a <;> fin_cases b <;> norm_num
      dist_triangle := by
        intro a b c
        fin_cases a <;> fin_cases b <;> fin_cases c <;> norm_num <;> linarith
      eq_of_dist_eq_zero := by
        intro a b h
        fin_cases a <;> fin_cases b <;> norm_num at * <;> linarith
  2. For any point x ∈ Fin 4, there is a candidate embedding of {0, 1} ∪ {x} into the real line ℝ.

    To establish that {0, 1} is 1-strongly Euclidean, we choose the complete real inner product space ℝ as the target space. Given x, the embedding f maps 0 ↦ 0, 1 ↦ 1, 2 ↦ -r, and 3 ↦ r + 1.

    lines 19–23

        IsOneStronglyEuclidean ({0,1} : Set (Fin 4)) := by
      letI := op1304ProjectionMetric r hr
      intro x
      refine ⟨ℝ, inferInstance, inferInstance, inferInstance, ?_, ?_⟩
      · exact fun a => if a.val = 0 then 0 else if a.val = 1 then 1 else if a.val = 2 then -r else r + 1
  3. The candidate embedding of {0, 1} ∪ {x} into ℝ is an isometry, so {0, 1} is 1-strongly Euclidean. automation

    By isometry_iff_dist_eq, it suffices to show that |f(a) - f(b)| = dist a b for all a, b in {0, 1} ∪ {x}. After unfolding set membership (Set.mem_union, Set.mem_insert_iff, Set.mem_singleton_iff) and expressing real distance as absolute values (Real.dist_eq), fin_cases enumerates all cases for x, a, b. In each branch, the goal reduces to linear arithmetic on absolute values (Fin.ext_iff, abs_nonneg, abs_of_nonneg, abs_of_nonpos), handled automatically by linarith.

    lines 24–31

    uses isometry_iff_dist_eq, Set.mem_union, Set.mem_insert_iff, Set.mem_singleton_iff, Real.dist_eq, Fin.ext_iff, abs_nonneg, abs_of_nonneg, abs_of_nonpos

      · rw [isometry_iff_dist_eq]
        intro a b
        rcases a with ⟨a, ha⟩
        rcases b with ⟨b, hb⟩
        simp only [Set.mem_union, Set.mem_insert_iff, Set.mem_singleton_iff] at ha hb
        change dist _ _ = (if a = b then 0 else if a.val / 2 = b.val / 2 then 1 else if a.val % 2 = b.val % 2 then r else r + 1)
        fin_cases x <;> fin_cases a <;> fin_cases b <;>
          norm_num [Real.dist_eq] at * <;> split_ifs at * <;> simp_all [Fin.ext_iff] <;> norm_num at * <;> (first | linarith [abs_nonneg r] | (rw [abs_of_nonneg (by linarith)]; linarith) | (rw [abs_of_nonpos (by linarith)]; linarith))
  4. For any point x ∈ Fin 4, there is a candidate embedding of {2, 3} ∪ {x} into the real line ℝ.

    Symmetrically, we choose ℝ as the target Euclidean space. Given x, the embedding f maps 2 ↦ 0, 3 ↦ 1, 0 ↦ -r, and 1 ↦ r + 1.

    lines 35–39

        IsOneStronglyEuclidean ({2,3} : Set (Fin 4)) := by
      letI := op1304ProjectionMetric r hr
      intro x
      refine ⟨ℝ, inferInstance, inferInstance, inferInstance, ?_, ?_⟩
      · exact fun a => if a.val = 2 then 0 else if a.val = 3 then 1 else if a.val = 0 then -r else r + 1
  5. The candidate embedding of {2, 3} ∪ {x} into ℝ is an isometry, so {2, 3} is 1-strongly Euclidean. automation

    As before, isometry_iff_dist_eq reduces the goal to checking pairwise distances. After simplifying set membership (Set.mem_union, Set.mem_insert_iff, Set.mem_singleton_iff) and real distances (Real.dist_eq), fin_cases enumerates all triples x, a, b, and automated simplification with linear arithmetic (Fin.ext_iff, abs_nonneg, abs_of_nonneg, abs_of_nonpos) confirms that distance is preserved in all cases.

    lines 40–47

    uses isometry_iff_dist_eq, Set.mem_union, Set.mem_insert_iff, Set.mem_singleton_iff, Real.dist_eq, Fin.ext_iff, abs_nonneg, abs_of_nonneg, abs_of_nonpos

      · rw [isometry_iff_dist_eq]
        intro a b
        rcases a with ⟨a, ha⟩
        rcases b with ⟨b, hb⟩
        simp only [Set.mem_union, Set.mem_insert_iff, Set.mem_singleton_iff] at ha hb
        change dist _ _ = (if a = b then 0 else if a.val / 2 = b.val / 2 then 1 else if a.val % 2 = b.val % 2 then r else r + 1)
        fin_cases x <;> fin_cases a <;> fin_cases b <;>
          norm_num [Real.dist_eq] at * <;> split_ifs at * <;> simp_all [Fin.ext_iff] <;> norm_num at * <;> (first | linarith [abs_nonneg r] | (rw [abs_of_nonneg (by linarith)]; linarith) | (rw [abs_of_nonpos (by linarith)]; linarith))
  6. For any L ∈ ℝ, setting r = |L| + 2 yields a metric space on Fin 4 in which {0, 1} and {2, 3} are both 1-strongly Euclidean.

    Given L, we define r = |L| + 2. Since |L| ≥ 0 by abs_nonneg, we have r ≥ 1. We instantiate the metric space using op1304ProjectionMetric r hr, and supply op1304ProjectionA and op1304ProjectionB to confirm that {0, 1} and {2, 3} are 1-strongly Euclidean.

    lines 55–59

    uses abs_nonneg, op1304ProjectionMetric, op1304ProjectionA, op1304ProjectionB

             ((dist (3 : Fin 4) 0)^2 - (dist (3 : Fin 4) 1)^2) / 2| := by
      intro L
      let r : ℝ := |L| + 2
      have hr : 1 ≤ r := by dsimp [r]; linarith [abs_nonneg L]
      refine ⟨op1304ProjectionMetric r hr, op1304ProjectionA r hr, op1304ProjectionB r hr, ?_, ?_, ?_⟩
  7. The distances d(0, 1) and d(2, 3) both equal 1.

    Because 0 and 1 share the quotient 0/2 = 1/2 = 0, and 2 and 3 share the quotient 2/2 = 3/2 = 1, the defined metric evaluates to 1 in both cases by definitional equality (rfl).

    lines 60–61

      · rfl
      · rfl
  8. The difference between the canonical projections of 2 and 3 onto the line through {0, 1} strictly exceeds L.

    From the defined metric, d(2, 0) = r, d(2, 1) = r + 1, d(3, 0) = r + 1, and d(3, 1) = r. The expression inside the absolute value simplifies to (r² - (r+1)²)/2 - ((r+1)² - r²)/2 = -(2r + 1), which is non-positive. Removing the absolute value via abs_of_nonpos gives 2r + 1. Substituting r = |L| + 2 yields 2|L| + 5, which strictly exceeds L since L ≤ |L| by le_abs_self.

    lines 62–65

    uses abs_of_nonpos, le_abs_self

      · change L < |(r^2 - (r+1)^2)/2 - ((r+1)^2 - r^2)/2|
        rw [abs_of_nonpos (by nlinarith)]
        dsimp [r]
        nlinarith [le_abs_self L]
abs_nonneg
The absolute value of any element is non-negative.
abs_of_nonneg
The absolute value of a non-negative element is the element itself.
abs_of_nonpos
The absolute value of a non-positive element is its negation.
Fin.ext_iff
Two elements of Fin n are equal if and only if their underlying natural number values are equal.
isometry_iff_dist_eq
A map between metric spaces is an isometry if and only if it preserves distances between all pairs of points.
le_abs_self
Any real number is less than or equal to its absolute value.
op1304ProjectionA
The subset {0, 1} is 1-strongly Euclidean in the metric space op1304ProjectionMetric r hr.
op1304ProjectionB
The subset {2, 3} is 1-strongly Euclidean in the metric space op1304ProjectionMetric r hr.
op1304ProjectionMetric
Constructs a metric space structure on Fin 4 for any parameter r ≥ 1.
Real.dist_eq
The distance between two real numbers is the absolute value of their difference.
Set.mem_insert_iff
An element belongs to insert a s if and only if it equals a or belongs to s.
Set.mem_singleton_iff
An element belongs to the singleton {b} if and only if it equals b.
Set.mem_union
An element belongs to the union of two sets if and only if it belongs to the first or the second set.

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

Lean’s trace was cut to the first 400 of 944 tactics.

set_option maxHeartbeats 2000000noncomputable def op1304ProjectionMetric (r : ℝ) (hr : 1 ≤ r) : MetricSpace (Fin 4) where  dist a b := if a = b then 0 else if a.val / 2 = b.val / 2 then 1 else if a.val % 2 = b.val % 2 then r else r + 1  dist_self := by intro a; simp  dist_comm := by    intro a b    fin_cases a <;> fin_cases b <;> norm_num  dist_triangle := by    intro a b c    fin_cases a <;> fin_cases b <;> fin_cases c <;> norm_num <;> linarith  eq_of_dist_eq_zero := by    intro a b h    fin_cases a <;> fin_cases b <;> norm_num at * <;> linariththeorem op1304ProjectionA (r : ℝ) (hr : 1 ≤ r) :    letI := op1304ProjectionMetric r hr    IsOneStronglyEuclidean ({0,1} : Set (Fin 4)) := by  letI := op1304ProjectionMetric r hr  intro x  refine ⟨ℝ, inferInstance, inferInstance, inferInstance, ?_, ?_⟩  · exact fun a => if a.val = 0 then 0 else if a.val = 1 then 1 else if a.val = 2 then -r else r + 1  · rw [isometry_iff_dist_eq]    intro a b    rcases a with ⟨a, ha⟩    rcases b with ⟨b, hb⟩    simp only [Set.mem_union, Set.mem_insert_iff, Set.mem_singleton_iff] at ha hb    change dist _ _ = (if a = b then 0 else if a.val / 2 = b.val / 2 then 1 else if a.val % 2 = b.val % 2 then r else r + 1)    fin_cases x <;> fin_cases a <;> fin_cases b <;>      norm_num [Real.dist_eq] at * <;> split_ifs at * <;> simp_all [Fin.ext_iff] <;> norm_num at * <;> (first | linarith [abs_nonneg r] | (rw [abs_of_nonneg (by linarith)]; linarith) | (rw [abs_of_nonpos (by linarith)]; linarith))theorem op1304ProjectionB (r : ℝ) (hr : 1 ≤ r) :    letI := op1304ProjectionMetric r hr    IsOneStronglyEuclidean ({2,3} : Set (Fin 4)) := by  letI := op1304ProjectionMetric r hr  intro x  refine ⟨ℝ, inferInstance, inferInstance, inferInstance, ?_, ?_⟩  · exact fun a => if a.val = 2 then 0 else if a.val = 3 then 1 else if a.val = 0 then -r else r + 1  · rw [isometry_iff_dist_eq]    intro a b    rcases a with ⟨a, ha⟩    rcases b with ⟨b, hb⟩    simp only [Set.mem_union, Set.mem_insert_iff, Set.mem_singleton_iff] at ha hb    change dist _ _ = (if a = b then 0 else if a.val / 2 = b.val / 2 then 1 else if a.val % 2 = b.val % 2 then r else r + 1)    fin_cases x <;> fin_cases a <;> fin_cases b <;>      norm_num [Real.dist_eq] at * <;> split_ifs at * <;> simp_all [Fin.ext_iff] <;> norm_num at * <;> (first | linarith [abs_nonneg r] | (rw [abs_of_nonneg (by linarith)]; linarith) | (rw [abs_of_nonpos (by linarith)]; linarith))theorem one_strongly_euclidean_canonical_projection_unbounded : ∀ L : ℝ,  ∃ m : MetricSpace (Fin 4), letI := m    IsOneStronglyEuclidean ({0,1} : Set (Fin 4)) ∧    IsOneStronglyEuclidean ({2,3} : Set (Fin 4)) ∧    dist (0 : Fin 4) 1 = 1 ∧ dist (2 : Fin 4) 3 = 1 ∧    L < |((dist (2 : Fin 4) 0)^2 - (dist (2 : Fin 4) 1)^2) / 2 -         ((dist (3 : Fin 4) 0)^2 - (dist (3 : Fin 4) 1)^2) / 2| := by  intro L  let r : ℝ := |L| + 2  have hr : 1 ≤ r := by dsimp [r]; linarith [abs_nonneg L]  refine ⟨op1304ProjectionMetric r hr, op1304ProjectionA r hr, op1304ProjectionB r hr, ?_, ?_, ?_⟩  · rfl  · rfl  · change L < |(r^2 - (r+1)^2)/2 - ((r+1)^2 - r^2)/2|    rw [abs_of_nonpos (by nlinarith)]    dsimp [r]    nlinarith [le_abs_self L]
See it in the graphDiscuss this resultChallenge it