Download data/lean/OAI/Probability/MatroidSecretary/Labels/LabeledHiddenVector.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 5.49 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Probability/MatroidSecretary/Labels/LabeledHiddenVector.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/Probability/MatroidSecretary/Labels/LabeledHiddenVector.lean
-
curl -L -o LabeledHiddenVector.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Probability/MatroidSecretary/Labels/LabeledHiddenVector.lean
5.49 kB
| import OAI.Probability.MatroidSecretary.Labels.LabeledHiddenModel | |
| import OAI.Probability.MatroidSecretary.Labels.FiniteLabelTransport | |
| import OAI.Probability.MatroidProphet.Main | |
| namespace OAI | |
| /-! | |
| # The full hidden-vector endpoint on arbitrary finite labels | |
| The enumeration is fixed before weights. These exact transport identities | |
| preserve observation, sacrifice, every prefix, and the order minimum before | |
| integration; they do not merely rename an expected fixed-order reward. | |
| -/ | |
| namespace MatroidProphet.Labeling | |
| open Finset MeasureTheory | |
| variable {E : Type*} [Fintype E] [MeasurableSpace E] | |
| [MeasurableSingletonClass E] {bits : β} | |
| noncomputable def relabelHiddenRule (A : HiddenRule (Fintype.card E) bits) : | |
| LabeledHiddenRule E bits where | |
| mask r := (A.mask r).map (Fintype.equivFin E).symm.toEmbedding | |
| core := relabelRule A.core | |
| theorem relabelHiddenRule_observed (A : HiddenRule (Fintype.card E) bits) | |
| (r : Seed bits) (w : E β β) : | |
| finWeights (labeledObserved (relabelHiddenRule A) r w) = | |
| observed A r (finWeights w) := by | |
| classical | |
| funext i | |
| simp [finWeights, labeledObserved, relabelHiddenRule, observed] | |
| theorem relabelHiddenRule_acceptedThrough | |
| (A : HiddenRule (Fintype.card E) bits) (r : Seed bits) | |
| (w : E β β) (Ο : LabeledOrder E) (t : β) : | |
| (labeledHiddenAcceptedThrough (relabelHiddenRule A) r w Ο t).map | |
| (Fintype.equivFin E).toEmbedding = | |
| hiddenAcceptedThrough A r (finWeights w) | |
| (Ο.trans (Fintype.equivFin E)) t := by | |
| classical | |
| unfold labeledHiddenAcceptedThrough hiddenAcceptedThrough | |
| rw [Finset.map_sdiff] | |
| change (labeledAcceptedThrough (relabelRule A.core) r | |
| (labeledObserved (relabelHiddenRule A) r w) w Ο t).map | |
| (Fintype.equivFin E).toEmbedding \ | |
| ((A.mask r).map (Fintype.equivFin E).symm.toEmbedding).map | |
| (Fintype.equivFin E).toEmbedding = _ | |
| rw [relabelRule_acceptedThrough, relabelHiddenRule_observed] | |
| congr 1 | |
| ext i | |
| simp | |
| theorem relabelHiddenRule_reward (A : HiddenRule (Fintype.card E) bits) | |
| (r : Seed bits) (w : E β β) (Ο : LabeledOrder E) : | |
| labeledHiddenReward (relabelHiddenRule A) r w Ο = | |
| hiddenReward A r (finWeights w) (Ο.trans (Fintype.equivFin E)) := by | |
| classical | |
| rw [hiddenReward, β relabelHiddenRule_acceptedThrough] | |
| simp [labeledHiddenReward, finWeights] | |
| /-- The set of labeled orders is transported bijectively, so the exact | |
| seedwise adversarial minimum, not just any one order, is preserved. -/ | |
| theorem relabelHiddenRule_worstReward (A : HiddenRule (Fintype.card E) bits) | |
| (w : E β β) (r : Seed bits) : | |
| labeledHiddenWorstReward (relabelHiddenRule A) w r = | |
| hiddenWorstReward A (finWeights w) r := by | |
| classical | |
| apply le_antisymm | |
| Β· apply Finset.le_inf' | |
| intro Ο _ | |
| have h := Finset.inf'_le | |
| (labeledHiddenReward (relabelHiddenRule A) r w) | |
| (Finset.mem_univ (Ο.trans (Fintype.equivFin E).symm)) | |
| simpa only [labeledHiddenWorstReward, relabelHiddenRule_reward, | |
| Equiv.trans_assoc, Equiv.symm_trans_self, Equiv.trans_refl] using h | |
| Β· apply Finset.le_inf' | |
| intro Ο _ | |
| rw [relabelHiddenRule_reward] | |
| exact Finset.inf'_le _ (Finset.mem_univ _) | |
| theorem relabelHiddenRule_feasible (M : Matroid E) | |
| (A : HiddenRule (Fintype.card E) bits) | |
| (hA : β (w : Weights (Fintype.card E)), (β e, 0 β€ w e) β | |
| β (r : Seed bits) (Ο : ArrivalOrder (Fintype.card E)) (t : β), | |
| (finMatroid M).Indep (hiddenAcceptedThrough A r w Ο t : Set _)) | |
| (w : E β β) (hw : β e, 0 β€ w e) (r : Seed bits) | |
| (Ο : LabeledOrder E) (t : β) : | |
| M.Indep (labeledHiddenAcceptedThrough (relabelHiddenRule A) r w Ο t : Set E) := by | |
| have hi := hA (finWeights w) ((finWeights_nonnegative_iff w).2 hw) r | |
| (Ο.trans (Fintype.equivFin E)) t | |
| rw [β relabelHiddenRule_acceptedThrough A r w Ο t] at hi | |
| exact (mapEquiv_finset_indep M (Fintype.equivFin E) _).1 hi | |
| omit [MeasurableSingletonClass E] in | |
| /-- A hidden label remains sacrificed for every order and every prefix, | |
| irrespective of what the online core would have decided. -/ | |
| theorem labeledHiddenAcceptedThrough_disjoint_mask | |
| (A : LabeledHiddenRule E bits) (r : Seed bits) (w : E β β) | |
| (Ο : LabeledOrder E) (t : β) : | |
| Disjoint (labeledHiddenAcceptedThrough A r w Ο t) (A.mask r) := by | |
| classical | |
| exact Finset.sdiff_disjoint | |
| /-- Literal arbitrary-finite-label version of the hidden-vector result. | |
| All masked labels, loops, empty types, ties and zero weights are retained. -/ | |
| theorem hidden_vector_finite_labels (M : Matroid E) (hE : M.E = Set.univ) : | |
| β (bits : β) (Ξ½ : Measure (Seed bits)), IsProbabilityMeasure Ξ½ β§ | |
| β A : LabeledHiddenRule E bits, | |
| (β (w : E β β), (β e, 0 β€ w e) β | |
| β (r : Seed bits) (Ο : LabeledOrder E) (t : β), | |
| M.Indep (labeledHiddenAcceptedThrough A r w Ο t : Set E)) β§ | |
| β (w : E β β), (β e, 0 β€ w e) β | |
| ((2 : β) ^ 293)β»ΒΉ * finiteOptimum M w β€ | |
| β« r, labeledHiddenWorstReward A w r βΞ½ := by | |
| obtain β¨bits, Ξ½, hΞ½, A, hA, hboundβ© := | |
| MatroidProphet.hidden_vector (Fintype.card E) (finMatroid M) | |
| (finMatroid_ground M hE) | |
| refine β¨bits, Ξ½, hΞ½, relabelHiddenRule A, relabelHiddenRule_feasible M A hA, ?_β© | |
| intro w hw | |
| have h := hbound (finWeights w) ((finWeights_nonnegative_iff w).2 hw) | |
| simpa only [β relabelHiddenRule_worstReward, optimum_finMatroid] using h | |
| end MatroidProphet.Labeling | |
| end OAI | |