Encyclopedia Constants Constants Alpha Numerics Scaffold Gap Weight Approx

ARTICLE 1 claim 1 theorem

Constants Alpha Numerics Scaffold Gap Weight Approx

A machine-checked theorem pins a framework-internal number to a tiny interval, but the number itself is a construction detail, not a measured constant.

A narrow numerical bound

A numerical bound is a statement about where a number lies, not about what the number means. The theorem gap_weight_approx in the Recognition Science library establishes one such bound: it proves that a quantity called w8_from_eight_tick, a weight attached to an eight-step recognition cycle, lies strictly between 2.490 and 2.491. The proof is machine-checked, meaning a computer verified every step of the argument. The bound itself is narrow, about one part in a thousand of the value, and it is exact in the sense that the theorem states the interval with strict inequalities.

The number 2.4905... is not a measured physical constant. It is a construction detail, a value that emerges from the framework's internal definitions about how recognition events are counted and weighted. The theorem does not compare this number to any experiment. It does not claim that the weight is the golden ratio, or any other special constant, beyond the fact that it falls in the stated interval. The theorem's only content is the bound itself, and the proof that the bound holds.

What the theorem does not claim is as important as what it claims. It does not claim that this weight has any direct physical meaning, such as a mass or a coupling constant. It does not claim that the value is derived from first principles in a way that connects it to measurement. The bound is a check on the internal consistency of the framework's arithmetic, not a prediction about the world. A reader should not take 2.4905 as a new physical constant; it is a number that appears in a specific construction, and the theorem certifies that the construction is numerically well-behaved in this one respect.

The distinction matters because the framework's library contains many claims, and they carry different epistemic weights. Some are theorems about the structure of recognition, some are comparisons to measured data, and some, like this one, are internal numerical checks. The gap_weight_approx theorem belongs to the last category. It tells a reader that a certain computed value is stable and bounded, and that is all. It is a small piece of the larger edifice, a supporting beam that holds a specific number in place, not a load-bearing wall that supports a claim about the physical universe.

THEOREM gap_weight_approx · IndisputableMonolith/Constants/AlphaNumericsScaffold.lean
/-- Check: the 8-tick gap weight is approximately 2.49057. -/
theorem gap_weight_approx :
    2.490 < w8_from_eight_tick ∧ w8_from_eight_tick < 2.491 := by
  constructor
  · calc (2.490 : ℝ) < (2.490564399 : ℝ) := by norm_num
      _ < w8_from_eight_tick := Numerics.W8Bounds.w8_computed_gt
  · calc w8_from_eight_tick < (2.490572090 : ℝ) := Numerics.W8Bounds.w8_computed_lt
      _ < 2.491 := by norm_num

What this page does not claim

The theorem does not claim that 2.4905 is a measured physical constant. The theorem does not claim that the weight has any direct physical meaning. The theorem does not claim that the value is derived from a comparison with experiment.

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/Constants/AlphaNumericsScaffold.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:

MACHINE LAYER · GROUNDED CLAIM TABLE · CLICK TO EXPAND