is_m_number_one
The natural number 1 is an M-number.
Statement
theorem is_m_number_one : is_m_number 1- Source
- arXiv:2610.37512 Section 1
- Verified
- 29 Oct 2026
- Axioms
Quot.soundpropext- Built on 1
- is_m_numberA natural number n is an M-number if for every prime p, p^p does not divide n.
Read back from the Lean
For every natural number p, if p is prime, then p^p does not divide 1 (that is, 1 is an "m-number").
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
By definition, a natural number is an M-number if it is not divisible by p ^ p for any prime p. Assuming for contradiction that p ^ p divides 1 for some prime p implies p ^ p = 1. However, every prime satisfies p ≥ 2, so p ^ p > 1, yielding an immediate contradiction.
Assume for contradiction that there exists a prime p such that p ^ p ∣ 1.
By definition, a natural number is an M-number if no prime p has p ^ p dividing it. We introduce an arbitrary prime p and assume for contradiction that p ^ p ∣ 1, reducing the goal to False.
intro p hp hdivp ^ p = 1
Since the only natural divisor of 1 is 1, the divisibility assumption p ^ p ∣ 1 forces p ^ p = 1.
uses
Nat.eq_one_of_dvd_onehave h1 : p ^ p = 1 := Nat.eq_one_of_dvd_one hdiv1 < p ^ p
Since p is prime, it satisfies p ≥ 2, so 1 < p. Raising p to the p-th power preserves this strict inequality (using Nat.one_lt_pow with p ≠ 0, verified by linear arithmetic), yielding 1 < p ^ p.
uses
Nat.one_lt_powhave h2 : 1 < p := hp.two_le have h3 : 1 < p ^ p := Nat.one_lt_pow (by omega) h2
A contradiction is reached.
Linear arithmetic (omega) derives False from the contradictory facts p ^ p = 1 and 1 < p ^ p.
omega
Nat.eq_one_of_dvd_one- If a natural number divides 1, it must be equal to 1.
Nat.one_lt_pow- For natural numbers a and n, if a > 1 and n ≠ 0, then a ^ n > 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
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 is an M-number. -/theorem is_m_number_one : is_m_number 1 := by intro p hp hdiv have h1 : p ^ p = 1 := Nat.eq_one_of_dvd_one hdiv have h2 : 1 < p := hp.two_le have h3 : 1 < p ^ p := Nat.one_lt_pow (by omega) h2 omega