criterionCount
plain-language theorem explainer
The theorem establishes that the finite type of binary governance criteria has cardinality exactly three. Institutional theorists applying the Recognition framework to configDim D equals five cite this when deriving the classical five-institution structure and the Arrow-like impossibility result. The proof is a one-line decision procedure that evaluates the Fintype instance generated by the three-constructor inductive type.
Claim. The cardinality of the finite type of governance criteria equals three, where the criteria are the three binary conditions of accountability, effectiveness, and legitimacy.
background
The module Governance Design from ConfigDim E7 states that configDim D equals five forces five canonical institutions (executive, legislative, judicial, military, press) together with five failure modes. GovernanceCriterion is the inductive type whose constructors are accountability, effectiveness, and legitimacy; it derives DecidableEq, Repr, BEq, and Fintype. Upstream results supply the active-edge count A equal to one per fundamental tick and the actualization operator A that selects the realized configuration minimizing J-cost.
proof idea
The proof is a one-line wrapper that invokes the decide tactic on Fintype.card applied to GovernanceCriterion. The tactic succeeds because the inductive type carries an automatically derived Fintype instance whose cardinality is the number of constructors.
why it matters
This supplies the three_criteria field inside the governanceDesignCert definition that certifies the full governance design. It realizes the E7 step of the module where configDim D equals five implies the three-criteria structure, paralleling the social-choice impossibility that no single institution satisfies all three conditions simultaneously. The result sits downstream of the forcing chain that produces D equals three spatial dimensions and the Recognition Composition Law.
Switch to Lean above to see the machine-checked source, dependencies, and usage graph.