AFTD Auto-Formalizing Theoretical Domains

mem_stein_param_set_one_one_one

theoremverified

The triple (1, 1, 1) belongs to stein_param_set.

Statement

theorem mem_stein_param_set_one_one_one : (1, 1, 1) ∈ stein_param_set
Source
arXiv:2611.05898, Theorem 2.2
Verified
06 Nov 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 3
  • stein_param_setThe set of triples (d, u, v) of positive natural numbers such that u is odd, mu_star d holds, and d * (u^2 - 2 * v^2)^2 ≤ 4 * u * v…
  • mu_star_oneThe natural number 1 satisfies mu_star.
  • mu_starA natural number d satisfies mu_star if for every prime number p with p ≠ 2, p^2 does not divide d.

Read back from the Lean

The triple of natural numbers (1, 1, 1) is an element of the set stein_param_set.

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

To show that (1, 1, 1) belongs to stein_param_set, the proof checks the six defining conditions for d = 1, u = 1, and v = 1. The three positivity bounds and the final inequality 1 * (1^2 - 2 * 1^2)^2 ≤ 4 * 1 * 1 (which reduces to 1 ≤ 4) are checked by direct finite computation. The remaining conditions that 1 is odd and satisfies μ* are supplied by the lemmas odd_one and mu_star_one.

  1. The triple (1, 1, 1) satisfies all six defining conditions of stein_param_set.

    By definition of stein_param_set, a triple (d, u, v) belongs to the set if and only if 0 < d, 0 < u, 0 < v, u is odd, μ*(d) holds, and d * (u^2 - 2 * v^2)^2 ≤ 4 * u * v. For the triple (1, 1, 1), the three positivity inequalities 0 < 1 are verified by direct arithmetic (decide). The condition that 1 is odd is supplied by odd_one. The square-freeness condition μ*(1) is supplied by mu_star_one. Finally, the inequality 1 * (1^2 - 2 * 1^2)^2 ≤ 4 * 1 * 1 simplifies to 1 ≤ 4, which is also verified by direct computation (decide).

    line 2

    uses odd_one, mu_star_one

    theorem mem_stein_param_set_one_one_one : (1, 1, 1) ∈ stein_param_set := ⟨by decide, by decide, by decide, odd_one, mu_star_one, by decide⟩
odd_one
The element 1 is odd in any semiring.
mu_star_one
The integer 1 satisfies the property μ*, meaning no square of an odd prime divides 1.

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 triple (1, 1, 1) belongs to stein_param_set. -/theorem mem_stein_param_set_one_one_one : (1, 1, 1) ∈ stein_param_set := ⟨by decide, by decide, by decide, odd_one, mu_star_one, by decide⟩
See it in the graphDiscuss this resultChallenge it