canonicalThreshold

The module develops D = 3 combinatorics in Recognition Science: three spatial dimensions, three colors, three neutrino flavors, three families, and related ternary structure, all tied to configDim = D = 3. Status is structural (no sorry, no axioms).

The constant $\varphi$ is imported from the Constants layer and is the unique self-similar fixed point forced at T6 of the unified forcing chain. Cost primitives come from the Cost import; sibling definitions such as domainCost measure how far a configuration sits from the recognition minimum.

This threshold sits slightly above zero ($\varphi \approx 1.618$ yields $\varphi - 3/2 \approx 0.118$) and supplies a fixed positive scale against which nonnegativity and positivity lemmas for domain costs can be stated.

Definitional. The body is the closed-form real expression $\varphi - 3/2$; there is no tactic proof or lemma application. Downstream positivity (e.g. that the threshold is strictly positive) is handled by separate lemmas that expand $\varphi$ and compare rationals.

Gives a single named cutoff used by the D = 3 combinatorics certificate layer when comparing domain costs to a canonical positive scale. It sits inside the Foundation forcing picture: T6 forces $\varphi$, T8 forces D = 3, and the module packages ternary counting that follows from that dimension. No parent theorem is listed in the dependency graph for this constant alone; it is scaffolding for sibling positivity and certificate inhabitation results rather than a chain step with its own paper proposition.