math / data /lean /OAI /Probability /MatroidSecretary /Labels /FiniteLabelAgreement.lean
introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
1.66 kB
import OAI.Probability.MatroidSecretary.Labels.FiniteLabelTransport
import OAI.Probability.MatroidSecretary.Labels.RelabelingProphet
namespace OAI
/-! The two preserved arbitrary-label interfaces describe exactly the same
offline benchmark and online execution. These are definitional equalities,
not extra model-validity premises or comparisons of surrogate rewards. -/
namespace MatroidProphet.FiniteLabelAgreement
variable {E : Type*} [Fintype E] [MeasurableSpace E]
[MeasurableSingletonClass E] {bits : β„•}
omit [MeasurableSpace E] [MeasurableSingletonClass E] in
theorem optimum_eq (M : Matroid E) (w : E β†’ ℝ) :
Labeling.finiteOptimum M w = Relabeling.finiteOptimum M w := rfl
theorem decision_eq (A : OnlineRule (Fintype.card E) bits)
(k : Fin (Fintype.card E)) (r : Seed bits) (s : E β†’ ℝ)
(h : Relabeling.LabeledHistory E k) :
(Labeling.relabelRule A).decide k r s h =
Relabeling.transportedDecision (Fintype.equivFin E) A k r s h := rfl
theorem acceptedThrough_eq (A : OnlineRule (Fintype.card E) bits)
(r : Seed bits) (s v : E β†’ ℝ) (Ο€ : Labeling.LabeledOrder E) (t : β„•) :
Labeling.labeledAcceptedThrough (Labeling.relabelRule A) r s v Ο€ t =
Relabeling.transportedAcceptedThrough (Fintype.equivFin E) A r s v Ο€ t := rfl
theorem reward_eq (A : OnlineRule (Fintype.card E) bits)
(r : Seed bits) (s v : E β†’ ℝ) (Ο€ : Labeling.LabeledOrder E) :
(βˆ‘ e ∈ Labeling.labeledAcceptedThrough (Labeling.relabelRule A)
r s v Ο€ (Fintype.card E), v e) =
Relabeling.transportedReward (Fintype.equivFin E) A r s v Ο€ := rfl
end MatroidProphet.FiniteLabelAgreement
end OAI