Pith. sign in

recognition

the machine-checked proof layer behind Pith

Recognition Science is a parameter-free formalization of reality. It begins with distinction ∃ xy ∈ K : x ≠ y and continues, by forced theorems, to every empirically observed constant. The library is public Lean 4 source. Each module is auditable, every theorem citable.

the proof path

A forced sequence. Each step is a Lean theorem; nothing is fitted.

  1. 1 distinction existence forced
  2. 2 J-cost unique cost J(x)
  3. 3 phi self-similar fixed point
  4. 4 D = 3 8-tick forces 3D
  5. 5 constants all from phi
  6. 6 universal forcing one canonical arithmetic

ask recognition

Get a derivation grounded in the formal library. Every answer becomes its own permalink page and can back an explainer.

recognition review

Submit a paper. Recognition Review currently uses Grok 4.3 at high reasoning for the active review lane, plus synthesis grounded in the Recognition library.

check a claim

Speed of light, fine-structure constant, gravity, dimension 3, the mass gap, and more — each linked to its proof.

formal source

Browse every Lean module the framework relies on. Module and theorem pages now have tracked explainer pages.

what can recognition prove?

High-signal claims. Each card links to the load-bearing theorem in Lean. Every claim carries an honest status label.

Speed of light

proved

c = one voxel per tick in RS-native units. The SI numerical value enters only by external calibration.

gap: SI numerical value of c requires external calibration.

Fine-structure constant

proved

alpha-inverse sits inside (137.030, 137.039) by an explicit phi-based derivation; CODATA 137.036 lies inside the interval.

gap: Higher-order corrections beyond the gap-45 term are still being audited.

load-bearing theorems

The named results papers actually map onto. The forcing chain reads roughly top to bottom.

theorem law_of_existence

Existence is forced by distinction. The first move of the chain.

Foundation Foundation.LawOfExistence 17 papers
def universal_forcing

Logic forces one canonical arithmetic across all admissible settings.

Foundation Foundation.UniversalForcing no papers cited yet
theorem law_of_logic_forces_jcost

Reciprocal-symmetric cost has one solution: J(x) = ½(x + x⁻¹) − 1.

Cost Cost.FunctionalEquation no papers cited yet
theorem bilinear_family_forced

The bilinear cost family is forced by the d'Alembert factorization.

Foundation Foundation.DAlembert.Inevitability 150 papers
theorem phi_unique_self_similar

Self-similar closure forces the golden ratio: r² = r + 1.

Foundation Foundation.PhiForcing 3 papers
theorem eight_tick_forces_D3

The 8-tick cycle forces space dimension D = 3.

Foundation Foundation.DimensionForcing 24 papers
theorem all_constants_from_phi

All named constants are functions of φ alone.

Foundation Foundation.ConstantDerivations 15 papers
theorem gravity_from_ledger

Gravity falls out of the ledger. Equivalence principle automatic.

Gravity Gravity.ZeroParameterGravity no papers cited yet
theorem spacetime_dim_eq_four

Spacetime, light cone, and proper time emerge from the recognition lattice.

Unification Unification.SpacetimeEmergence no papers cited yet
theorem spectral_gap

Yang-Mills mass gap on the φ-lattice: Δ = J(φ) = (√5 − 2)/2.

Unification Unification.YangMillsMassGap 2 papers
theorem etaBExactRungCert

Baryon asymmetry η_B sits at φ-rung 44.

Cosmology Cosmology.EtaBExactRungDerivation 1 paper

proof browser

The formal library, grouped by branch. Click through to browse all modules and declarations.

Foundation

From one distinction to a forced arithmetic. The core derivation chain: existence, distinction, recognition lattice, φ, dimension, time, universal forcing.

  • Foundation.AlexanderDuality 6 thm/lemma · 6886 papers
  • Foundation.ArithmeticFromLogic 58 thm/lemma · 4879 papers
  • Foundation.AbsoluteFloorClosure 6 thm/lemma · 4621 papers
490 modules · 6142 thm/lemma · 128937 lines
browse →

Cost

Reciprocal-symmetric cost. Uniqueness of J(x) = ½(x + x⁻¹) − 1, convexity, the Aczél class, and the d'Alembert factorization.

  • Cost.FunctionalEquation 46 thm/lemma · 27900 papers
  • Cost 49 thm/lemma · 444 papers
  • Cost.JcostCore 2 thm/lemma · 51 papers
39 modules · 353 thm/lemma · 7103 lines
browse →

Constants

Named constants in RS-native units. ℏ = φ⁻⁵, the α⁻¹ band, gravitational coupling, ℓ₀, τ₀ — all as functions of φ.

  • Constants 51 thm/lemma · 184 papers
  • Constants.RSUnitsHelpers 1 thm/lemma · 28 papers
  • Constants.Derivation 26 thm/lemma
45 modules · 418 thm/lemma · 8201 lines
browse →

Gravity

Zero-parameter gravity. G = φ⁵/π, the equivalence principle from the ledger, kappa bounds.

  • Gravity.PhysicalSixTetCubicDirichletInstance 373 thm/lemma
  • Gravity.MasterTheoremHandoffIntegration 108 thm/lemma
  • Gravity.TensorShearSector 83 thm/lemma
143 modules · 1874 thm/lemma · 48368 lines
browse →

Unification

Cross-domain consequences. Spacetime emergence, Lorentzian signature uniqueness, the Yang-Mills mass gap on the φ-lattice, octave duality.

  • Unification.YangMillsMassGap 37 thm/lemma · 10 papers
  • Unification.SpacetimeEmergence 36 thm/lemma · 8 papers
  • Unification.QuantumGravityOctaveDuality 39 thm/lemma · 1 paper
7 modules · 173 thm/lemma · 2323 lines
browse →

Cosmology

Cosmological identities. The η_B baryon asymmetry as the φ-rung 44 result, prefactor derivations.

  • Cosmology.EtaBExactRungDerivation 17 thm/lemma · 2 papers
  • Cosmology.EtaBPrefactorDerivation 26 thm/lemma · 1 paper
  • Cosmology.BaryogenesisStaging 124 thm/lemma
159 modules · 1340 thm/lemma · 24000 lines
browse →

Patterns

Discrete pattern algebra used throughout the recognition lattice.

  • Patterns 7 thm/lemma · 4 papers
  • Patterns.GrayCycle 11 thm/lemma
  • Patterns.GrayCycleGeneral 11 thm/lemma
6 modules · 44 thm/lemma · 1335 lines
browse →

Root

Top-level imports and lake configuration.

  • IndisputableMonolith 0 thm/lemma · 10 papers
  • lakefile 0 thm/lemma
2 modules · 0 thm/lemma · 98 lines
browse →

all other domains

Auto-discovered from the public mirror. Every directory shown below is sorry-free, admit-free, and contains no domain-specific axioms.

source: github.com/jonwashburn/shape-of-logic · the public face of the Recognition library.