canonicalThreshold
plain-language theorem explainer
The canonical compression threshold is the real constant φ − 3/2, with φ the golden-ratio fixed point of Recognition Science. Authors of the RS compression-ratio certificate cite it as the cutoff scale separating structured φ-rung data from the incompressible regime. It is a one-line definitional constant, not a proved inequality.
Claim. The canonical threshold is the real number $\varphi - 3/2$, where $\varphi$ denotes the golden ratio.
background
The module treats maximum lossless compression relative to the Kolmogorov limit inside Recognition Science. Structured data at φ-rung complexity is claimed to achieve compression $J(\varphi)^{-1}\approx 8.47\times$, while random data remains incompressible (ratio 1).
Here $\varphi$ is the unique self-similar fixed point forced by the Recognition chain (T6), and $J$ is the unique cost satisfying the Recognition Composition Law, $J(x)=(x+x^{-1})/2-1$. The constant $\varphi-3/2\approx 0.118$ is the small positive scale used as a canonical cutoff in the same file’s domain-cost and certificate definitions.
proof idea
Definitional abbreviation only: the real is introduced by the equation $\varphi-3/2$. No lemmas, tactics, or proof obligations.
why it matters
Gives the numeric cutoff consumed by positivity and certificate constructions in the compression-ratio module (siblings such as the positivity lemma for this constant and the compression-ratio certificate). Anchors the information-theoretic bound to the forced constant $\varphi$ of the Recognition forcing chain (T6) and to the closed form of $J$, so that the structural claim “structured φ-rung data compresses by $J(\varphi)^{-1}$, random data does not” has a concrete threshold scale.
Switch to Lean above to see the machine-checked source, dependencies, and usage graph.