prime_twentynine
plain-language theorem explainer
The theorem asserts that 29 satisfies the primality predicate on natural numbers. Number theorists building arithmetic functions such as the Möbius function in the Recognition Science setting would cite this fact when handling small primes in inversion formulas. The proof is a one-line wrapper that invokes a decision procedure to confirm the property computationally.
Claim. The natural number 29 is prime, i.e., its only positive divisors are 1 and 29.
background
The module supplies lightweight wrappers around Mathlib arithmetic functions, beginning with the Möbius function μ. It works in the setting of basic number theory where primality supports squarefree checks and inversion. The upstream result defines Prime as the transparent alias for the standard Nat.Prime predicate on natural numbers.
proof idea
The proof is a one-line wrapper that applies the decide tactic to verify primality of 29 directly.
why it matters
This supplies a concrete small prime for arithmetic function development in the Recognition Science number theory layer. It supports later Möbius and squarefree machinery without depending on deeper framework elements such as the J-cost or phi-ladder. No downstream theorems currently reference it.
Switch to Lean above to see the machine-checked source, dependencies, and usage graph.