Arbitrary Prediction, Opposite Optimal Actions
Abstract
Every PMF prediction admits opposite unique optima under two constant loss models.
Theorem 1.1 (Any fixed predictive law is compatible with opposite unique optima).
Proof. Machine-checked in Lean as D5/S3/ConceptDynamics/Decision/ArbitraryPredictionOppositeOptima.arbitrary_prediction_opposite_unique_optima (✓ std3). ∎
Source. Repository-derived.
Commentary.
The same arbitrary PMF-valued prediction is used for both losses. The false action has constant losses zero and one respectively, while the true action has constant losses one and zero.
Expected loss is constructed by integrating each action loss against the supplied predictive PMF. The displayed optimal-action sets are the full pointwise argmin sets, not separately chosen selectors.
References
- Truth anchor:
D5/S3/ConceptDynamics/Decision/ArbitraryPredictionOppositeOptima.arbitrary_prediction_opposite_unique_optima - Dependency: D5/S3/ConceptDynamics/Decision/PredictionLawDecisionSufficiency