The computed prime factorization multiplies back to its argument

Identifier: F:nat-prod-factorization
Proof route: kernel-lean
External status: proved
Axiom footprint: Empty

Recorded description

For every positive natural n, the product of the multiset Nat.factorization n -- computed by trial division through minFac with fuel n -- is n. Together with uniqueness and with every element being prime, this is the Fundamental Theorem of Arithmetic in computed form.

Formal statement

theorem Nat.prod_factorization : ((x0 : AxNat) -> ((x1 : AxNat.lt AxNat.zero x0) -> Eq.{1} AxNat (AxNat.Multiset.prod (AxNat.factorization x0)) x0))

Dependencies

The graph shows direct ledger edges. Follow a node to open its artifact page.

1 direct dependencies 0 direct dependents

Evidence

nat-prod-factorization-1

Kind: kernel-term
Status: checked

Supports: Nat.prod_factorization is admitted by the trusted kernel gate with the type recorded in formal.statement.

Checker command

out=$(cargo run -q -p axeyum-lean-kernel --example nat_theorem_inventory -- prod_factorization 2>&1) && test "$(printf "%s\n" "$out" | grep -cE '^Nat\.prod_factorization.2.\(\(x0 : AxNat\) -> \(\(x1 : AxNat\.lt AxNat\.zero x0\) -> Eq\.\{1\} AxNat \(AxNat\.Multiset\.prod \(AxNat\.factorization x0\)\) x0\)\)$')" = 1

Evidence notes

`build_nat_prelude` admits this theorem only through the trusted kernel gate, so a successful build IS the type-check. The pattern pins the ARITY and the FULL rendered type, not the theorem's presence: `scripts/new-fact.py` rejected a name-only pattern as population-only, because it catches the row disappearing but not the statement changing inside a row that is still there.

footprint-nat-prod-factorization

Kind: instance-pin
Status: checked

Supports: axiom_footprint: [] -- the Nat environment admits no trusted declaration

Checker command

cargo run -q -p axeyum-lean-kernel --example nat_axiom_inventory -- --require-axiom-free nat

Evidence notes

Reports `nat: axiom=0 opaque=0 quotient=0 total_trusted=0` over the FULL trusted surface (Axiom, Opaque and Quotient), not `Declaration::Axiom` alone, and exits non-zero unless the surface is empty. The enumeration is per-environment rather than per-theorem; it bounds this theorem's footprint because a proof cannot depend on a trusted declaration the environment does not contain. Read directly from `Kernel::axiom_footprint` via `theorem_axiom_footprint`, this theorem's row prints footprint size 0 and an empty axiom column, and all 904 `nat` rows do. (Count the tool's OWN summary line, not `grep -c '^nat'` -- the summary starts with `nat:` too, so the naive count is 905.)

Provenance

{
  "date": "2026-09-02",
  "established_by": "axeyum-lean-kernel build_nat_prelude",
  "source": "theorem name and canonical type read directly via nat_theorem_inventory, which prints render_lean of the admitted type; declared by `nat_prelude/factorization_multiset.rs` (lane nat-factorization)."
}