Pith. sign in
module module moderate

IndisputableMonolith.Foundation.UniversalForcing.ForcedSemiring

show as:
view Lean formalization →

Establishes that the unique zero-fixing, successor-commuting map out of the naturals is a semiring homomorphism, so addition and multiplication are forced by recursion alone. Anyone tracing the universal forcing chain toward forced integers cites this layer. The argument is a short stack of inductions on the second argument of add and mul, plus uniqueness and bijectivity of the forcing map.

claimThere is a unique map $f$ with $f(0)=0$ and $f(n+1)=S(f(n))$ that preserves addition and multiplication, hence realizes a forced semiring structure on the image; equivalently, $+\!$ and $\cdot$ are completely determined by successor recursion.

background

This module sits in the Universal Forcing layer of the Foundation stack. The upstream import is CanonicalForcing, which supplies the ambient forcing setup: a carrier generated from zero by successor, together with the expectation that any structure-preserving map is uniquely determined by those two data.

The local objects are a forcing function $f$ (zero-fixing and successor-commuting) and a family of preservation lemmas. Addition and multiplication are treated as recursive on the second argument, so any map that respects zero and successor automatically respects the full binary operations once the inductive step is checked. A certificate object packages the resulting semiring laws for downstream use.

Notation is ordinary: $0$, successor $S$, and the induced $+!$ and $\cdot$. No Recognition-cost $J$ or $\varphi$-ladder appears here; the module is pure algebraic forcing.

proof idea

The module is organized as a ladder of small lemmas rather than one monolithic theorem. First, any zero-fixing successor-commuting map preserves addition by a single induction on the second summand (addition recurses there). Multiplication is handled analogously, again by induction, using the already-proved add-preservation. One and the unit laws follow by the same recursion. The forcing map is then shown bijective and unique among maps with the same zero/successor constraints. A final certificate bundles these facts into a single forced-semiring witness for importers.

why it matters in Recognition Science

ForcedIntegers imports this module, so the forced semiring is the algebraic substrate on which integer structure is later forced. In the broader Recognition Science foundation, universal forcing is the route by which discrete arithmetic is not postulated but derived from minimal generative data (zero and successor). This file closes the semiring step of that chain: once $+!$ and $\cdot$ are forced, the path to additive inverses and the integers is well-defined. It does not yet touch the T0–T8 physical forcing chain (J-uniqueness, $\varphi$, eight-tick octave, $D=3$), but it is part of the same foundational program that makes those later steps rest on forced rather than assumed arithmetic.

scope and limits

used by (1)

From the project-wide theorem graph. These declarations reference this one in their body.

depends on (1)

Lean names referenced from this declaration's body.

declarations in this module (17)