pith. sign in
theorem

maxAmendmentRate_eq

proved
show as:
module
IndisputableMonolith.Jurisprudence.PrecedentStabilityFromSigma
domain
Jurisprudence
line
106 · github
papers citing
none yet

plain-language theorem explainer

The maximum rate of σ-creating constitutional amendments equals exactly 1/45 per year. Researchers modeling precedent stability under σ-conservation cite this bound when comparing theoretical ceilings against historical frequencies in long-lived constitutions. The proof is a direct unfolding of the cycle-length definition followed by numerical normalization.

Claim. The maximum rate of σ-creating constitutional amendments equals $1/45$ per year, where the denominator is the consciousness-gap cycle length.

background

The module treats common-law precedent as a σ-conserving structure on the legal-decision graph: each precedent carries a σ-weight equal to its jurisdictional level, and total σ of a corpus must stay conserved under overturning. The amendment cycle is defined as 45, the consciousness-gap frustration period that bounds σ-creating changes. Upstream structures supply the necessary conservation: J-cost minimization is strictly convex with unique minimum at unity, ledger factorization calibrates the discrete tiers, and spectral emergence fixes the underlying gauge and generation content that extends to the legal graph.

proof idea

The proof is a one-line wrapper that unfolds the definitions of the maximum amendment rate and the amendment cycle, then applies norm_num to obtain the numerical identity.

why it matters

This equality supplies the max_rate_eq field inside the precedentStabilityCert record and appears directly in the precedent_stability_one_statement theorem, which packages additivity of total σ, the rate bound, and an empirical US check. It realizes the gap-45 frustration period stated in the module, linking the legal σ-dynamics to the eight-tick octave of the forcing chain. No open scaffolding remains at this step.

Switch to Lean above to see the machine-checked source, dependencies, and usage graph.