Delta Kernel Semantics Subst At Zero

Substitution at zero

In formal logic, a substitution is the operation of replacing a variable by a term. The declaration substAt_zero states a precise fact about this operation in a specific formal system: substituting a value for variable 0 in an environment is exactly the same as adding that value at the front of the environment. The environment is a list-like assignment of natural numbers to variables, and variable 0 is the innermost bound variable. The lemma says, in effect, that the two operations are indistinguishable for all variables.

The system in question is the δ-kernel, a minimal formal core built to study what happens when recognition is treated as a ledger: a discrete record of events. Within this kernel, terms evaluate to natural numbers and formulas to propositions, with the connectives read intuitionistically. The lemma is proved constructively, which means it does not rely on the law of excluded middle or any other classical principle. This matters because the kernel's soundness theorem, which comes later, must itself be axiom-audited as choice-free, and this lemma is one of the pieces that makes that audit possible.

In Recognition Science, the framework models a universe that keeps a ledger of recognition events, and the cost of recognition is forced by a proved theorem. The δ-kernel is the framework's self-examination: a formal system that describes its own rules. The lemma substAt_zero is a small but load-bearing step in that self-description. It is one of several commutation lemmas that together ensure that substitution and quantification behave correctly when a formula is evaluated. Without it, the soundness proof would not go through, and the kernel could not claim to be a faithful model of its own reasoning.

The lemma does not claim anything about the physical world, about the value of any constant, or about the nature of recognition itself. It is a purely syntactic and semantic fact about a formal system. It does not establish that the kernel is consistent, nor that it is complete, nor that it is the only possible such system. It is a tool, not a conclusion. What it does establish is a clean and exact correspondence between two ways of modifying an environment, and that correspondence is what lets the kernel's soundness proof proceed without classical assumptions.

For the reader, the consequence is concrete: the kernel can be trusted to reason about itself in a way that is free of classical choice. The lemma is not a discovery about nature, but it is a necessary condition for the framework's claim that its own formal machinery is sound. It is a small gear in a larger machine, and knowing what it does and does not do is part of understanding what the whole framework can and cannot claim.

/-- `substAt 0` is `cons`, pointwise. -/
theorem substAt_zero (v : Nat) (ρ : Env) :
    ∀ n, substAt 0 v ρ n = cons v ρ n := by
  intro n
  cases n with
  | zero => simp [substAt]
  | succ m => simp [substAt]

/-- `substAt 0` is `cons`, pointwise. -/
theorem substAt_zero (v : Nat) (ρ : Env) :
    ∀ n, substAt 0 v ρ n = cons v ρ n := by
  intro n
  cases n with
  | zero => simp [substAt]
  | succ m => simp [substAt]

What this page does not claim

The lemma does not establish that the δ-kernel is consistent or complete. The lemma does not make any claim about physical constants or the nature of recognition. The lemma does not prove that the δ-kernel is the only possible formal system for recognition.

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/DeltaKernel/Semantics.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: