prime_twohundredseventyone
plain-language theorem explainer
271 is prime. Number theorists in the Recognition Science framework cite this when verifying small primes for arithmetic function evaluations such as Möbius calculations. The proof is a one-line native decision procedure that evaluates the primality predicate directly.
Claim. $271$ is a prime number.
background
The module supplies lightweight wrappers around Mathlib arithmetic functions, beginning with the Möbius function. Prime is the transparent repo-local alias for the standard natural-number primality predicate. Upstream results supply structural definitions from foundation modules, though this declaration rests on the basic Prime abbreviation.
proof idea
The proof is a one-line wrapper applying the native_decide tactic to confirm that 271 satisfies the primality condition.
why it matters
This supplies a verified small-prime fact inside the arithmetic-functions module. It supports potential downstream Möbius evaluations, though no parent theorems are recorded. It aligns with the framework's number-theoretic scaffolding but does not invoke the forcing chain, RCL, or phi-ladder.
Switch to Lean above to see the machine-checked source, dependencies, and usage graph.