VerifiedConstant
plain-language theorem explainer
VerifiedConstant packages a constant's name, real-valued magnitude, derivation provenance, and exactness flag into a single record for CPM constant audits. Physicists verifying Recognition Science derivations would cite this structure when assembling lists of machine-checked constants such as K_net. The declaration is a plain structure definition with four fields and no attached proof obligations.
Claim. A verified constant is a record $(n, v, s, e)$ where $n$ is a string identifier, $v$ is a real number, $s$ is a string describing the derivation source, and $e$ is a boolean flag indicating whether the value is exact.
background
The CPM Constants Audit module supplies machine-checkable records for constants derived from Recognition Science invariants, including consistency checks and probability bounds for coincidental agreement. VerifiedConstant serves as the basic record type for storing each constant's metadata in this audit infrastructure. Upstream structures such as PhiForcingDerived.of supply the J-cost framework while NucleosynthesisTiers.of provides nuclear density tiers on the phi-ladder; the module also imports LawOfExistence and Constants to ground the derivations.
proof idea
This is a structure definition. It introduces the record type with four fields (name, value, source, exact) and contains no proof body, tactics, or lemma applications.
why it matters
This structure is used by verifiedConstants to list specific CPM constants such as K_net from cone projection and eight-tick mechanisms. It supports the audit_passes theorem which confirms the audit summary status. In the Recognition Science framework it contributes to verification of constants like alpha inverse in the 137 band and G = phi^5 / pi by providing a uniform format for provenance tracking.
Switch to Lean above to see the machine-checked source, dependencies, and usage graph.