Encyclopedia Foundation Foundation Hierarchy Realization From Scale

ARTICLE 4 claims 4 theorems

Foundation Hierarchy Realization From Scale

A hierarchy of levels can be derived from a simple geometric scale, if that scale is closed under a composition rule.

The scale-to-hierarchy bridge

A hierarchy is a stack of levels, each one a fixed multiple of the one below. The classical example is a musical octave: each step up multiplies the frequency by two, and the whole ladder is one geometric scale. A geometric scale sequence is any list of values where each adjacent ratio equals the base ratio, so the sequence reads a, ar, ar², ar³, and so on. In the Recognition Science framework, such a scale becomes the skeleton of a realized hierarchy when it is also closed under a composition operation called ledgerCompose, which combines two levels to produce a third.

The central result is conditional. If a ClosedObservableFramework orbit, a sequence of states generated by repeated application of a transition map, realizes an earlier geometric scale sequence that is closed under ledgerCompose, then the two defining fields of a realized hierarchy become theorems instead of assumptions. The first field, ratio_self_similar, states that the ratio between consecutive observed values is constant along the whole orbit. The second, additive_posting, states that the value at the third step equals the sum of the values at the first two steps. Both follow from the closure of the underlying scale, as the machine-checked proofs show.

The proofs are short and direct. For ratio self-similarity, the argument cancels the amplitude factor and reduces the claim to the definition of a geometric scale sequence. For additive posting, the closure condition ledgerCompose supplies the equation scale 0 + scale 1 = scale 2, and the orbit's realization law converts that into the additive statement about observed values. The module then packages these results into the RealizedHierarchy interface, turning what were previously assumed fields into proved consequences.

What remains open is the existence question. The framework has not yet proved that such a realized closed scale model exists from a ClosedObservableFramework alone. The derivation shows that if the scale is there, the hierarchy follows; it does not yet show that the scale must be there. This is the difference between a conditional theorem and a forced consequence, and the module states that gap plainly.

The practical consequence is that a hierarchy of levels, with its characteristic ratio and additive structure, can be a derived object instead of a primitive assumption. When a system exhibits a geometric scale that composes, the two signature properties of a hierarchy come along for free. This narrows the search for physical hierarchies to the search for closed geometric scales, which is a more tractable question than postulating hierarchical structure by hand.

THEOREM toRealizedHierarchy · IndisputableMonolith/Foundation/HierarchyRealizationFromScale.lean
/-- The earlier closed-scale model packages into the later
`RealizedHierarchy` interface, with the two critical fields now proved
rather than assumed. -/
noncomputable def toRealizedHierarchy
    (F : ClosedObservableFramework) (H : RealizedClosedScaleModel F) :
    RealizedHierarchy F where
  baseState := H.baseState
  levels_eq := by
    intro k
    rfl
  levels_pos := by
    intro k
    exact F.r_pos _
  growth := by
    rw [realized_closed_scale_ratio_step F H 0]
    exact H.growth
  ratio_self_similar := ratio_self_similar_of_realized_closed_scale F H
  additive_posting := by
    simpa using additive_posting_of_realized_closed_scale F H
THEOREM realized_closed_scale_ratio_step · IndisputableMonolith/Foundation/HierarchyRealizationFromScale.lean
/-- The realized orbit has constant adjacent ratio. -/
theorem realized_closed_scale_ratio_step
    (F : ClosedObservableFramework) (H : RealizedClosedScaleModel F) (k : ℕ) :
    F.r (F.T^[k + 1] H.baseState) / F.r (F.T^[k] H.baseState) = H.scales.ratio := by
  rw [H.realize (k + 1), H.realize k]
  have ha : H.amplitude ≠ 0 := ne_of_gt H.amplitude_pos
  calc
    H.amplitude * H.scales.scale (k + 1) / (H.amplitude * H.scales.scale k)
      = H.scales.scale (k + 1) / H.scales.scale k := by
          rw [mul_div_mul_left _ _ ha]
    _ = H.scales.ratio := scale_step_ratio H.scales k
THEOREM ratio_self_similar_of_realized_closed_scale · IndisputableMonolith/Foundation/HierarchyRealizationFromScale.lean
ratio_self_similar_of_realized_closed_scale · IndisputableMonolith/Foundation/HierarchyRealizationFromScale.lean:64
/-- Therefore the realized orbit satisfies ratio self-similarity. -/
theorem ratio_self_similar_of_realized_closed_scale
    (F : ClosedObservableFramework) (H : RealizedClosedScaleModel F) :
    ∀ k,
      F.r (F.T^[k + 2] H.baseState) / F.r (F.T^[k + 1] H.baseState) =
        F.r (F.T^[k + 1] H.baseState) / F.r (F.T^[k] H.baseState) := by
  intro k
  rw [realized_closed_scale_ratio_step F H (k + 1), realized_closed_scale_ratio_step F H k]
THEOREM additive_posting_of_realized_closed_scale · IndisputableMonolith/Foundation/HierarchyRealizationFromScale.lean
additive_posting_of_realized_closed_scale · IndisputableMonolith/Foundation/HierarchyRealizationFromScale.lean:73
/-- Closure of the earlier geometric scale sequence yields additive
posting on the realized orbit. -/
theorem additive_posting_of_realized_closed_scale
    (F : ClosedObservableFramework) (H : RealizedClosedScaleModel F) :
    F.r (F.T^[2] H.baseState) =
      F.r (F.T^[1] H.baseState) + F.r (F.T^[0] H.baseState) := by
  have hclosed : H.scales.scale 0 + H.scales.scale 1 = H.scales.scale 2 := by
    simpa [GeometricScaleSequence.isClosed, ledgerCompose] using H.scales_closed
  have hclosed' : H.scales.scale 2 = H.scales.scale 1 + H.scales.scale 0 := by
    linarith
  rw [H.realize 2, H.realize 1, H.realize 0]
  rw [hclosed']
  ring

What this page does not claim

Not a proof that any ClosedObservableFramework admits a realized closed scale model. Not a derivation of the golden ratio or any specific ratio from this module alone. Not a claim that ledgerCompose is the only composition operation that yields hierarchy structure.

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/HierarchyRealizationFromScale.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