AFTD Auto-Formalizing Theoretical Domains

four_point_set_coprime_params

theoremverified

For any integer n, the integers a = 2n - 1 and 2b = 2(2n + 1) are coprime.

Statement

theorem four_point_set_coprime_params (n : ℤ) :
    let a : ℤ := 2 * n - 1
    let b : ℤ := 2 * n + 1
    IsCoprime a (2 * b)
Source
arXiv:2610.24281 Lemma 3.2
Verified
22 Oct 2026
Axioms
Quot.soundpropext

Read back from the Lean

For every integer $n$, letting $a = 2n - 1$ and $b = 2n + 1$, $a$ and $2b$ are coprime (in the sense of IsCoprime, meaning there exist integers $u, v$ such that $u \cdot a + v \cdot (2b) = 1$).

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 theorem establishes that a = 2n - 1 and 2b = 2(2n + 1) are coprime for any integer n. By the multiplicative property of coprimality, this reduces to showing that a is coprime to 2 and that a is coprime to b. Both conditions are then established by exhibiting explicit Bézout coefficients—(-1, n) for (a, 2) and (-(n + 1), n) for (a, b)—and checking the resulting identities by polynomial arithmetic.

  1. It suffices to show that a is coprime to 2 and that a is coprime to b.

    Introduce the definitions a = 2n - 1 and b = 2n + 1. Rewriting with `IsCoprime.mul_right_iff` reduces the coprimality of a and 2b to two independent conditions: IsCoprime a 2 and IsCoprime a b.

    lines 6–7

    uses IsCoprime.mul_right_iff

      intro a b
      rw [IsCoprime.mul_right_iff]
  2. Reduce both coprimality assertions to Bézout identities with explicit integer coefficients.

    Two integers are coprime if 1 can be represented as an integral linear combination of them. For IsCoprime a 2, we provide coefficients -1 and n; for IsCoprime a b, we provide coefficients -(n + 1) and n. This leaves two algebraic equations to verify: -1 * a + n * 2 = 1 and -(n + 1) * a + n * b = 1.

    line 8

      refine ⟨⟨-1, n, ?_⟩, ⟨-(n + 1), n, ?_⟩⟩
  3. The Bézout identity -1 * a + n * 2 = 1 holds.

    Expanding the definition a = 2n - 1 gives -1 * (2n - 1) + 2n = -2n + 1 + 2n = 1, which ring simplification verifies.

    lines 9–10

      · dsimp only [a]
        ring
  4. The Bézout identity -(n + 1) * a + n * b = 1 holds.

    Expanding the definitions a = 2n - 1 and b = 2n + 1 gives -(n + 1)(2n - 1) + n(2n + 1) = -(2n² + n - 1) + (2n² + n) = 1, which ring simplification verifies.

    lines 11–12

      · dsimp only [a, b]
        ring
IsCoprime.mul_right_iff
An element x is coprime to a product y * z if and only if x is coprime to y and x is coprime to z.

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 parameters a = 2n - 1 and 2b = 2(2n + 1) are coprime for any integer n. -/theorem four_point_set_coprime_params (n : ℤ) :    let a : ℤ := 2 * n - 1    let b : ℤ := 2 * n + 1    IsCoprime a (2 * b) := by  intro a b  rw [IsCoprime.mul_right_iff]  refine ⟨⟨-1, n, ?_⟩, ⟨-(n + 1), n, ?_⟩⟩  · dsimp only [a]    ring  · dsimp only [a, b]    ring
See it in the graphDiscuss this resultChallenge it