prime_fourhundredfortythree
plain-language theorem explainer
443 is asserted to be prime. Researchers applying Möbius inversion or squarefree checks inside the Recognition Science arithmetic functions module would cite this fact when handling small primes. The proof is a one-line native decision procedure that verifies the primality predicate directly.
Claim. $443$ is prime.
background
The module supplies lightweight wrappers around Mathlib's arithmetic function library, beginning with the Möbius function. Prime is the transparent alias for Nat.Prime. The local setting keeps statements lightweight pending deeper Dirichlet algebra and inversion layers.
proof idea
The proof is a one-line wrapper that applies native_decide to confirm that 443 satisfies the primality predicate.
why it matters
This supplies a basic prime fact supporting Möbius and squarefree results in the same module. It fills a concrete number-theoretic foothold before inversion theorems are layered on, though no downstream uses are recorded yet.
Switch to Lean above to see the machine-checked source, dependencies, and usage graph.