palindromic_prime_threehundredfiftythree
plain-language theorem explainer
353 is asserted to be a prime number. Number theorists examining arithmetic functions or palindromic primes in the Recognition Science setting would cite this fact for concrete examples. The proof is a one-line term that applies native_decide for direct computational verification.
Claim. The natural number 353 is prime, where primality is the standard predicate on natural numbers.
background
The module supplies lightweight wrappers around Mathlib arithmetic functions, beginning with the Möbius function μ. Prime is defined locally as an alias for Nat.Prime to maintain transparency with standard number theory. The local setting keeps statements minimal so that deeper Dirichlet inversion can be added once interfaces stabilize.
proof idea
The proof is a one-line term wrapper that invokes native_decide on the primality predicate for 353.
why it matters
This supplies a concrete palindromic prime example inside the arithmetic functions module. It supports basic prime facts used by Möbius-related definitions without adding new structure. No downstream theorems depend on it yet, and it touches no open questions in the T0-T8 forcing chain or RCL.
Switch to Lean above to see the machine-checked source, dependencies, and usage graph.