Refinement-Monotone Safe Coverage
Abstract
Concept refinement preserves canonical safe answers and monotonically enlarges both their admitted domain and its probability.
Definition 1.1 (Safe coverage).
Formalization. D5/S3/ConceptDynamics/Answering/RefinementSafeCoverageMonotonicity.safeCoverage (✓ std3).
Source. Repository-derived.
Commentary.
Safe coverage is constructed by measuring the canonical admitted safe-answer domain under the supplied probability law.
Theorem 1.2 (Refinement monotonically enlarges safe coverage).
Proof. Machine-checked in Lean as D5/S3/ConceptDynamics/Answering/RefinementSafeCoverageMonotonicity.refinement_safe_coverage_monotonicity (✓ std3). ∎
Source. Repository-derived.
Commentary.
The first public conjunct applies the frozen pointwise theorem: every canonical answer at an admitted state survives refinement with the same target value.
The second conjunct exposes inclusion of admitted answer domains. The third measures that same inclusion under an arbitrary probability law and applies measure monotonicity.
References
- Truth anchor:
D5/S3/ConceptDynamics/Answering/RefinementSafeCoverageMonotonicity.refinement_safe_coverage_monotonicity - Truth anchor:
D5/S3/ConceptDynamics/Answering/RefinementSafeCoverageMonotonicity.safeCoverage - Dependency: D5/S3/ConceptDynamics/Answering/RefinementMonotoneAnswerDomain