pith. machine review for the scientific record. sign in
module module high

IndisputableMonolith.Foundation.UniversalForcing.Strict.Biology

show as:
view Lean formalization →

This module defines lineage states as generation-depth coordinates paired with labels to realize biological reproduction inside the strict universal forcing chain. It extends the music module's ratio-based equality costs to reproductive steps, supplying a StrictLogicRealization instance for the biology domain. Researchers extending Recognition Science to non-physical domains cite it when assembling the five-domain cost theorems. The module consists entirely of definitions and basic arithmetic lemmas that force operations via repeated steps.

claimA lineage state is an element of $L := D_g × Label$ where $D_g$ is a generation-depth coordinate. The reproductive step induces addition on states; the cost function satisfies $C(s_1 + s_2) = C(s_1) + C(s_2)$ together with symmetry and zero axioms, all derived from the step operation rather than from the carrier type.

background

The module sits inside the strict branch of UniversalForcing, which supplies domain-specific realizations of the Recognition Composition Law and the three logic laws (excluded middle, composition, invariance). It imports the Music module, whose doc-comment states that it realizes domain-rich musical structure over positive frequency ratios using equality-cost comparisons. LineageState is introduced precisely to keep arithmetic from being presupposed by a bare Nat carrier; the doc-comment notes that repeated reproductive steps force the arithmetic instead.

proof idea

This is a definition module, no proofs.

why it matters in Recognition Science

The module supplies the biology instance of StrictLogicRealization that RichDomainCosts aggregates with the Music, Narrative, Ethics, and Metaphysical modules to prove the actual composition, excluded-middle, and invariance laws. It is cited by the Narrative module for event-state generation and advances the forcing chain by furnishing one of the five domain realizations required for the full strict logic embedding.

scope and limits

used by (2)

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 (9)