canonicalThreshold_pos
plain-language theorem explainer
The canonical threshold appearing in the domain-coverage milestone is strictly positive. Structural certificates in FinalModule_1397 cite this fact whenever they need a positive cutoff built from φ. The proof is a one-line unfold-plus-linarith wrapper off the bound φ > 1.5.
Claim. The canonical threshold (the real cutoff defined from the golden ratio $\varphi$ in this milestone module) satisfies $0 < t_{\mathrm{can}}$.
background
FinalModule_1397 is a Recognition Science structural certificate module (Plan v7, 109th pass): zero sorry, zero axioms, aimed at a domain-coverage milestone. Sibling definitions introduce a domain cost and a canonical threshold built from the RS constant $\varphi$.
In RS units $\varphi$ is the golden ratio $(1+\sqrt{5})/2$, forced earlier in the T0–T8 chain as the self-similar fixed point (T6). The only upstream lemma used here is phi_gt_onePointFive: "$\varphi > 1.5$ (since $\sqrt{5} > 2$, so $(1+\sqrt{5})/2 > 1.5$)." That stricter lower bound, rather than the weaker $\varphi > 1$, is what makes the threshold expression positive by linear arithmetic after unfolding.
proof idea
One-line wrapper. Unfold the definition of the canonical threshold, then discharge $0 < \cdots$ by linarith using the single fact $\varphi > 1.5$. No case splits, no induction, no further RS identities.
why it matters
Supplies the positivity side-condition for the canonical threshold inside the FinalModule_1397 domain-coverage certificate. The module status line calls the whole package a structural theorem with empty axiom surface; this lemma is the elementary arithmetic hinge that keeps the threshold well-formed as a positive real cutoff.
No downstream consumers are recorded yet (used_by empty), so the result is presently a local certificate ingredient rather than a widely reused lemma. It sits downstream of the Constants layer (φ bounds) and upstream of any milestone certificate that assumes a positive domain threshold. It does not itself touch T5–T8, the RCL, or the mass ladder; it only polices a numeric gate those structures may later use.
Switch to Lean above to see the machine-checked source, dependencies, and usage graph.