Download data/lean/OAI/Analysis/CircleDomains/Selection/CodeConstraints.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 2.38 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Analysis/CircleDomains/Selection/CodeConstraints.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/Analysis/CircleDomains/Selection/CodeConstraints.lean
-
curl -L -o CodeConstraints.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Analysis/CircleDomains/Selection/CodeConstraints.lean
2.38 kB
| import OAI.Analysis.CircleDomains.Topology.BasePathCodes | |
| namespace OAI | |
| /-! Forgetting auxiliary dust and tuple exclusions maps an allowed endpoint | |
| code into the base-code family without changing its path or tags. -/ | |
| open Set MeasureTheory | |
| open scoped Topology ENNReal | |
| noncomputable section | |
| namespace CircleDomainRigidity | |
| theorem tagTupleExcluded_mono | |
| {S T : β n : β, (Fin (n + 1) β β) β Set (Fin (n + 1) β UnitAddCircle)} | |
| (h : β n l, S n l β T n l) : tagTupleExcluded S β tagTupleExcluded T := by | |
| apply iUnion_mono | |
| intro n | |
| apply iUnion_mono | |
| intro l | |
| exact image_mono (Set.prod_mono (h n l) Subset.rfl) | |
| theorem tagRules_relax {X : Type*} [MetricSpace X] | |
| {H : β β Set (UnitAddCircle Γ X)} | |
| {S T : β n : β, (Fin (n + 1) β β) β Set (Fin (n + 1) β UnitAddCircle)} | |
| (h : β n l, S n l β T n l) {Ξ : TaggedPath X} (hΞ : TagRules H T Ξ) : | |
| TagRules H S Ξ := by | |
| intro k | |
| exact β¨(hΞ k).1, (hΞ k).2.1, fun hk => (hΞ k).2.2 (tagTupleExcluded_mono h hk)β© | |
| variable {X Y : Type*} [MetricSpace X] [MetricSpace Y] | |
| [MeasurableSpace X] [MeasurableSpace C(PathTime, X)] | |
| theorem allowedTaggedPath_forget (d : PathCodeData X Y) (Ξ½ : Measure X) | |
| (T : β n : β, (Fin (n + 1) β β) β Set (Fin (n + 1) β UnitAddCircle)) | |
| {Ξ : TaggedPath X} (hΞ : AllowedTaggedPath d Ξ½ T Ξ) : | |
| AllowedTaggedPath d 0 (fun _ _ => β ) Ξ := by | |
| refine β¨hΞ.1, tagRules_relax (fun _ _ => empty_subset _) hΞ.2.1, | |
| hΞ.2.2.1, hΞ.2.2.2.1, ?_β© | |
| simp | |
| theorem endpointCode_forget (d : PathCodeData X Y) (Ξ½ : Measure X) | |
| (T : β n : β, (Fin (n + 1) β β) β Set (Fin (n + 1) β UnitAddCircle)) | |
| {Ξ : TaggedPath X} (hΞ : EndpointCode d Ξ½ T Ξ) : | |
| EndpointCode d 0 (fun _ _ => β ) Ξ := | |
| β¨allowedTaggedPath_forget d Ξ½ T hΞ.1, hΞ.2β© | |
| def forgetCode (d : PathCodeData X Y) (Ξ½ : Measure X) | |
| (T : β n : β, (Fin (n + 1) β β) β Set (Fin (n + 1) β UnitAddCircle)) | |
| (Ξ : {Ξ : TaggedPath X // EndpointCode d Ξ½ T Ξ}) : BasePathCode d := | |
| β¨Ξ.val, endpointCode_forget d Ξ½ T Ξ.propertyβ© | |
| theorem measurable_forgetCode (d : PathCodeData X Y) (Ξ½ : Measure X) | |
| (T : β n : β, (Fin (n + 1) β β) β Set (Fin (n + 1) β UnitAddCircle)) : | |
| Measurable (forgetCode d Ξ½ T) := measurable_subtype_coe.subtype_mk | |
| end CircleDomainRigidity | |
| end | |
| end OAI | |