mu_star_one
The natural number 1 satisfies mu_star.
Statement
theorem mu_star_one : mu_star 1- Source
- arXiv:2611.05898, Definition 2.1
- Verified
- 06 Nov 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 3
- mu_starA natural number d satisfies mu_star if for every prime number p with p ≠ 2, p^2 does not divide d.
- LinearOrder.toTotalPreorderEvery
LinearOrderis aTotalPreorder. - TotalPreorderA total preorder: a preorder where
≤is total (complete). This is weaker thanLinearOrder— it does NOT require antisymmetry or…
- Used by 1
- mem_stein_param_set_one_one_oneThe triple (1, 1, 1) belongs to stein_param_set.
Read back from the Lean
The natural number 1 satisfies the predicate mu_star.
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 satisfies $\mu^*$, we assume for contradiction that $p^2 \mid 1$ for some prime $p$. Since $p^2 \mid 1$ and $1 > 0$, we have $p^2 \le 1$; however, any prime satisfies $p \ge 2$, which implies $p^2 \ge 4$, an immediate contradiction.
Assume for contradiction that there is a prime $p$ such that $p^2 \mid 1$.
Unfolding the definition of $\mu^*(1)$, we introduce an arbitrary prime $p$ and assume for contradiction that $p^2 \mid 1$, discarding the hypothesis $p \neq 2$. The goal is now to derive a contradiction (`False`).
intro p hp _ hdiv$p^2 \le 1$ and $p \ge 2$.
Because $0 < 1$ (`Nat.one_pos`) and $p^2 \mid 1$, any divisor of 1 is at most 1, so $p^2 \le 1$ by `Nat.le_of_dvd`. In addition, since $p$ is prime, we have $2 \le p$ by `hp.two_le`.
uses
Nat.le_of_dvd,Nat.one_pos,hp.two_lehave hle : p ^ 2 ≤ 1 := Nat.le_of_dvd Nat.one_pos hdiv have h2 : 2 ≤ p := hp.two_le
Contradiction. automation
Nonlinear arithmetic derives a contradiction from $p \ge 2$ and $p^2 \le 1$, since $p \ge 2$ implies $p^2 \ge 4 > 1$.
nlinarith
Nat.le_of_dvd- if a positive natural number is divisible by $m$, then $m$ is less than or equal to it
Nat.one_pos- 0 is strictly less than 1
hp.two_le- every prime number is at least 2
- The condition $p \neq 2$ in the definition of $\mu^*$ is ignored (bound to `_`), as the contradiction $p^2 \le 1$ holds for every prime.
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
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
/-- The integer 1 satisfies mu_star. -/theorem mu_star_one : mu_star 1 := by intro p hp _ hdiv have hle : p ^ 2 ≤ 1 := Nat.le_of_dvd Nat.one_pos hdiv have h2 : 2 ≤ p := hp.two_le nlinarith