Keyboard shortcuts

Press or to navigate between chapters

Press ? to show this help

Press Esc to hide this help

Knowledge Policy Threshold

Abstract

Secret recovery and injective secret policies have the same coalition-size threshold.

Definition 1.1 (Coalition readout).

Lean statement: D5/S3/ConceptDynamics/InstitutionalCapture/KnowledgePolicyThreshold.coalitionReadout

Formalization. D5/S3/ConceptDynamics/InstitutionalCapture/KnowledgePolicyThreshold.coalitionReadout (✓ std3).

Source. Repository-derived.

Commentary.

A coalition readout exposes a participant’s share exactly when its label belongs to the coalition, using none for absent labels.

Theorem 1.2 (Knowledge and policy thresholds agree).

Proof. Machine-checked in Lean as D5/S3/ConceptDynamics/InstitutionalCapture/KnowledgePolicyThreshold.knowledge_policy_threshold_consistent (✓ std3). ∎

Source. Repository-derived.

Commentary.

The secret and policy are readouts on the same state space. The policy factors through the secret by a map injective on the secret image, so its values preserve every secret distinction.

For each finite coalition, policy factorization is equivalent to secret factorization: the forward direction uses the inverse selected on the secret image, and the reverse direction composes the policy map.

Consequently the two sets of attainable coalition cardinalities are equal, and their natural infima, the source minimum thresholds, agree.

References

  • Truth anchor: D5/S3/ConceptDynamics/InstitutionalCapture/KnowledgePolicyThreshold.coalitionReadout
  • Truth anchor: D5/S3/ConceptDynamics/InstitutionalCapture/KnowledgePolicyThreshold.knowledge_policy_threshold_consistent
  • Dependency: D5/S3/ConceptDynamics/ConceptJoinUniversal