AFTD Auto-Formalizing Theoretical Domains

int_crescent_point_injective

theoremverified

For every integer n ≥ 3, the function int_crescent_point n from Fin n to Fin 3 → ℤ is injective.

Statement

theorem int_crescent_point_injective (n : ℕ) (hn : 3 ≤ n) :
    Function.Injective (int_crescent_point n)
Source
arXiv:2610.38368 Section 3
Verified
08 Nov 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 1
  • int_crescent_pointFor a natural number n and an index j in Fin n, int_crescent_point n j is the integer vector of type Fin 3 → ℤ whose coordinate 0 is…
Used by 1

Read back from the Lean

For every natural number $n$ with $3 \le n$, the function int_crescent_point n mapping each $j \in \mathrm{Fin}\ n$ to a point in $\mathrm{Fin}\ 3 \to \mathbb{Z}$ is injective.

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 shows that int_crescent_point n is injective by restricting attention to its third coordinate (index 2), which has the value 2 * j * (4n² + 1)^(n - 1) for each index j ∈ Fin n. If two indices produce the same point, their third coordinates must be identical. Since 4n² + 1 is strictly positive, the factor (4n² + 1)^(n - 1) is nonzero and can be canceled, and canceling 2 then leaves j₁ = j₂ as integers, which implies equality in Fin n.

  1. If two indices j₁ and j₂ have the same image under int_crescent_point n, then their third coordinates are equal: 2 * j₁ * (4n² + 1)^(n - 1) = 2 * j₂ * (4n² + 1)^(n - 1).

    To prove injectivity, we assume int_crescent_point n j₁ = int_crescent_point n j₂ for arbitrary j₁, j₂ ∈ Fin n. Applying congrFun at coordinate 2 evaluates both sides at the third component, and simplifying with the definition of int_crescent_point replaces each side with the explicit expression for that coordinate.

    lines 4–6

    uses congrFun

      intro j1 j2 h
      have h2 := congrFun h 2
      simp only [int_crescent_point] at h2
  2. 2 * (j₁ : ℤ) = 2 * (j₂ : ℤ)

    Since 4n² + 1 is strictly positive for any integer n, its power (4n² + 1)^(n - 1) is strictly positive and therefore nonzero, as established by positivity. Using mul_right_cancel₀, we cancel this nonzero factor from the right of the equality obtained in the previous step.

    lines 7–8

    uses mul_right_cancel₀

      have hP : (4 * (n : ℤ)^2 + 1) ^ (n - 1) ≠ 0 := by positivity
      have h2' : 2 * (j1 : ℤ) = 2 * (j2 : ℤ) := mul_right_cancel₀ hP h2
  3. (j₁ : ℤ) = (j₂ : ℤ)

    Because 2 ≠ 0 in ℤ (closed by norm_num), we cancel 2 from the left of 2 * j₁ = 2 * j₂ using mul_left_cancel₀, concluding that j₁ and j₂ have equal integer representations.

    lines 9–10

    uses mul_left_cancel₀

      have hz : (j1 : ℤ) = (j2 : ℤ) :=
        mul_left_cancel₀ (by norm_num : (2 : ℤ) ≠ 0) h2'
  4. j₁ = j₂ in Fin n

    Using exact_mod_cast, the integer equality is recast to equality of their underlying natural numbers, j₁.val = j₂.val. Finally, Fin.ext deduces that j₁ and j₂ are the same element of Fin n.

    lines 11–12

    uses Fin.ext

      have hval : j1.val = j2.val := by exact_mod_cast hz
      exact Fin.ext hval
congrFun
If two functions are equal, then their evaluations at any given argument are equal.
mul_right_cancel₀
In an algebraic structure with multiplication and zero where right cancellation is valid, if a * b = c * b and b ≠ 0, then a = c.
mul_left_cancel₀
In an algebraic structure with multiplication and zero where left cancellation is valid, if a * b = a * c and a ≠ 0, then b = c.
Fin.ext
Two elements of Fin n are equal if and only if their underlying natural number values are equal.

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

/-- The indexing function int_crescent_point n is injective for n ≥ 3. -/theorem int_crescent_point_injective (n : ℕ) (hn : 3 ≤ n) :    Function.Injective (int_crescent_point n) := by  intro j1 j2 h  have h2 := congrFun h 2  simp only [int_crescent_point] at h2  have hP : (4 * (n : ℤ)^2 + 1) ^ (n - 1) ≠ 0 := by positivity  have h2' : 2 * (j1 : ℤ) = 2 * (j2 : ℤ) := mul_right_cancel₀ hP h2  have hz : (j1 : ℤ) = (j2 : ℤ) :=    mul_left_cancel₀ (by norm_num : (2 : ℤ) ≠ 0) h2'  have hval : j1.val = j2.val := by exact_mod_cast hz  exact Fin.ext hval
See it in the graphDiscuss this resultChallenge it