not_mu_star_nine
The natural number 9 does not satisfy mu_star.
Statement
theorem not_mu_star_nine : ¬ mu_star 9- Source
- arXiv:2611.05898, Definition 2.1
- Verified
- 06 Nov 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 1
- 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
It is not the case that 9 satisfies mu_star; that is, it is false that for every prime number p, if p ≠ 2, then p² does not divide 9.
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 property μ*(d) requires that no square of an odd prime divides d. To show that 9 does not satisfy this property, we argue by contradiction using p = 3 as a counterexample: 3 is an odd prime whose square 3² = 9 divides 9.
Assume for contradiction that 9 satisfies μ*.
We assume h : μ*(9), which asserts that no square of an odd prime divides 9, aiming to derive a contradiction.
intro h3 is an odd prime whose square divides 9.
We verify the three conditions needed to use p = 3 as a counterexample: 3 is prime, 3 ≠ 2, and 3² ∣ 9. Each fact is proved by direct numerical computation.
have hp : Nat.Prime 3 := by norm_num have hne : 3 ≠ 2 := by norm_num have hdiv : 3^2 ∣ 9 := by norm_num
This contradicts the assumption that 9 satisfies μ*.
Applying the hypothesis h to p = 3, together with the facts that 3 is prime and 3 ≠ 2, yields ¬(3² ∣ 9). This directly contradicts 3² ∣ 9, completing the proof.
exact h 3 hp hne hdiv
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 9 does not satisfy mu_star. -/theorem not_mu_star_nine : ¬ mu_star 9 := by intro h have hp : Nat.Prime 3 := by norm_num have hne : 3 ≠ 2 := by norm_num have hdiv : 3^2 ∣ 9 := by norm_num exact h 3 hp hne hdiv