AFTD Auto-Formalizing Theoretical Domains

not_is_m_number_four

theoremverified

The natural number 4 is not an M-number.

Statement

theorem not_is_m_number_four : ¬ is_m_number 4
Source
arXiv:2610.37512 Section 6
Verified
29 Oct 2026
Axioms
Classical.choiceQuot.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

It is not the case that 4 is an m-number; that is, it is false that for every prime natural number p, p^p does not divide 4.

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 n is an M-number if no prime p satisfies p^p ∣ n. Assuming 4 is an M-number, we instantiate this property at the prime p = 2 to obtain ¬(2^2 ∣ 4). Since 2^2 = 4 divides 4 by reflexivity of divisibility, this immediately contradicts the assumption.

  1. 4 is not an M-number

    Assume for contradiction that 4 is an M-number (h). By definition, no prime p satisfies p^p ∣ 4. Specializing this condition to the prime p = 2 (via Nat.prime_two) implies ¬(2^2 ∣ 4). However, 2^2 = 4, and 4 ∣ 4 holds by reflexivity of divisibility (dvd_rfl), producing a contradiction.

    line 2

    uses Nat.prime_two, dvd_rfl

    theorem not_is_m_number_four : ¬ is_m_number 4 := fun h => h 2 Nat.prime_two dvd_rfl
Nat.prime_two
2 is a prime number
dvd_rfl
any element divides itself in a monoid (a ∣ a)

Written by a model (gemini-3.8-flash) from the Lean source alone (no goal states were available). Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.

Lean source view module on GitHub

/-- The integer 4 is not an M-number. -/theorem not_is_m_number_four : ¬ is_m_number 4 := fun h => h 2 Nat.prime_two dvd_rfl
See it in the graphDiscuss this resultChallenge it