pith. machine review for the scientific record. sign in
Pith / Derivations

Derivations from first principles

Every entry below begins from the Recognition Science primitives (ledger, tick, voxel, cost composition law) and ends at a measurable consequence. Each step is a clickable Lean theorem; every empirical claim carries a named falsifier. 222 published of 246 tracked.

Domains: All Applied 7 Biology & medicine 1 Consciousness & ethics 11 Fundamental constants 23 Cosmology 37 Gravity 32 Mathematics & foundations 29 Particle physics 55 Quantum mechanics 27
Tiers: All Applied 23 Derived 148 Foundational 51

Recently published

Mathematics & foundations

The formal forcing chain: logic, cost, phi, discreteness, dimension, arithmetic.

Derivation Tier Status Anchors Predictions
Dimensional-Quantity Type System
Definitions for L, T, M dimensions and dimensioned positive quantities 		Applied MODEL 3 0
Euler-Mascheroni Constant Band
gamma is bracketed by phi-arithmetic; current bound 0 < gamma < 2/3 		Derived THEOREM 6 1
Recognition Coupling Bridge
Recognition coupling encodes the bridge between micro and macro scales 		Derived THEOREM 1 0
Recognition Coupling Law
The coupling law relating recognition variables across scales 		Derived THEOREM 1 0
Arithmetic is Categorical Across Realizations
All admissible realizations of recognition extract the same arithmetic up to unique iso 		Foundational THEOREM 4 1
Calibration is Forced by a Unique Fixed Point
The lambda=1 calibration is the unique fixed point of substitutivity 		Foundational THEOREM 2 0
Count Law at D=3
Counting laws on the 3-cube reproduce the standard combinatorial bounds 		Foundational THEOREM 3 0
Discreteness of Recognition States
Continuous configuration spaces cannot host a stable recognition; the ledger is forced to be discrete 		Foundational THEOREM 3 1
J-Cost is Additive on Independent Events
Cost composes additively whenever recognition events are independent 		Foundational THEOREM 3 0
J-Cost is Quadratic near the Identity
The log-coordinate J satisfies a calibrated quadratic bound around zero 		Foundational THEOREM 3 0
Law of Logic Forces the Canonical Cost
J-cost uniqueness from the Law of Logic 		Foundational THEOREM 1 0
Logic from Cost and Distinction
How classical logic is reconstructed from the recognition primitive 		Foundational THEOREM 2 0
Modus Ponens as a Derived Operation
The single inference rule of classical logic emerges from substitutivity in the recognition ledger 		Foundational THEOREM 1 0
Multi-Level Composition Forces the Golden Ratio
Uniform scaling across hierarchical recognition layers reduces to phi 		Foundational THEOREM 3 0
Natural Numbers Emerge from Logic
Peano arithmetic is reconstructed inside the recognition realization 		Foundational THEOREM 5 1
Nontrivial Linking Requires D = 3
Topological linking is the unique three-dimensional signature in the canon 		Foundational THEOREM 5 0
Observers Are Cooper-Paired Recognition References
A coherent observer is forced as a zero-cost persistent reference state 		Foundational THEOREM 8 0
phi forcing complete Foundational THEOREM 1 0
Recognition Event Cost is Nonnegative
Every recognition event has nonnegative cost; self-recognition costs zero 		Foundational THEOREM 3 0
Recognition is the Unique Stable Cost Minimum
Every J-cost minimum is a recognition event; nothing else achieves stability 		Foundational THEOREM 7 1
The 45-Gap as 9 x 5 Structure
The 45-rung gap factorizes into 9 and 5; both feed phi-arithmetic 		Foundational THEOREM 2 0
The Arrow of Time from Recognition
Time orientation is forced by the asymmetry between balanced ledger postings 		Foundational THEOREM 2 0
The d'Alembert Recognition Composition Law
J satisfies J(xy)+J(x/y)=2J(x)J(y)+2J(x)+2J(y), uniquely 		Foundational THEOREM 1 1
The Gray Cycle Realizes the 8-Tick Cycle
A 3-bit Gray code with single-bit transitions gives the minimal recognition cycle 		Foundational THEOREM 4 1
The Recognition Cycle Has Period 2^3
The 8-tick cycle is the only power-of-two period consistent with the three-dimensional cube 		Foundational THEOREM 3 1
Two Limits Discharged
The classical and quantum limits of the recognition framework are both formally discharged 		Foundational THEOREM 1 0
Unified Recognition Hub
The umbrella module that ties forcing chain, constants, cosmology, and gauge predictions together 		Foundational THEOREM 1 0
Uniqueness of the Recognition Tracker
Any recognition is recoverable from a unique extraction mechanism 		Foundational THEOREM 2 0
Why Reality Posts a Ledger
Recognition events must close in a conservation-respecting ledger; balance and reciprocity are forced 		Foundational THEOREM 9 1

How to read these pages

Pith derivations are a hybrid of narrative explanation and machine-checked proof. Anything tagged THEOREM is backed by a Lean 4 proof in the canonical Recognition library; the corresponding declarations are linked inline. A tag of HYPOTHESIS means the claim is empirically falsifiable but not yet formally derived; a MODEL tag means the claim is a definitional choice. OPEN is reserved for active gaps.

Direct URL: https://pith.science/derivations/<slug>. JSON form: https://pith.science/derivations/<slug>.json. Search: https://pith.science/derivations/search.json?q=.... No nav link by design. Cite a derivation by its stable URL plus the version number printed at the top of the page.