Foundation Pair Kernel Source Grammar Pi Free Eval

The certificate language

In mathematics, a real number is often described by a formula. The Recognition Science framework defines a tiny formal language, a ledger (a discrete record of allowed symbols) whose only ingredients are rational numbers, the golden ratio, and the field operations of addition, multiplication, negation, and reciprocal. The language has no symbol for pi, and that absence is structural, not an oversight. The machine-checked library proves that every expression in this language evaluates to a real number that is algebraic over the rationals, meaning it is the root of a polynomial with rational coefficients.

The central declaration, piFree_eval, establishes a simple consequence: every expression in this language certifies its own evaluated value as pi-free. The proof is a single line, because the definition of pi-free is exactly "there exists a ledger expression that evaluates to it," and the expression itself is the witness. The golden ratio is algebraic because it satisfies x² = x + 1, and the field operations preserve algebraicity, so the whole grammar stays inside the algebraic numbers.

In Recognition Science, this grammar is the source-strength certificate for the framework's constants. The certificate language deliberately excludes the wider constants module, which contains downstream physical constants irrelevant to the certificate. This keeps the certificate clean: any value it names is provably constructed from rationals and the golden ratio alone, with no circle constant and no additional axioms.

The declaration does not claim that pi is absent from the wider framework, nor that every algebraic number is expressible in this grammar. It claims only what its name says: that every expression in this specific language evaluates to a pi-free value, and that the proof is machine-checked with no gaps.

/-- Every value generated by the grammar is algebraic over the rationals. -/
theorem eval_isAlgebraic (e : LedgerExpr) : IsAlgebraic ℚ e.eval := by
  induction e with
  | ofRat q =>
      exact isAlgebraic_rat ℚ q
  | phi =>
      exact goldenRatio_isAlgebraic
  | add a b ha hb =>
      exact ha.add hb
  | mul a b ha hb =>
      exact ha.mul hb
  | neg a ha =>
      exact ha.neg
  | inv a ha =>
      exact ha.inv

/-- Every expression certifies its own evaluated value. -/
theorem piFree_eval (e : LedgerExpr) : PiFree e.eval := ⟨e, rfl⟩

What this page does not claim

This does not claim that pi is absent from the whole Recognition Science framework. This does not claim that every algebraic number is expressible in this ledger grammar. This does not claim that the golden ratio is the only non-rational constant allowed.

Verify this page

Every tagged claim above names its theorem. To check one yourself rather than trust this page, elaborate the source module with Lean 4 and audit its axiom basis:

$ lake env lean IndisputableMonolith/Foundation/PairKernelSourceGrammar.lean
expected axiom basis: [propext, Classical.choice, Quot.sound] (the Lean kernel's standard three; no RS-specific axioms)

A page whose claims cannot be reproduced this way does not ship. In production, every anchor links to the exact declaration in the public source release, and this block carries the build receipt for the page itself.

Derived articles

This page is generated by a question-recursion engine: the questions its answers raise become the next pages. The current agenda, with open targets marked red: