File size: 2,378 Bytes
4a56cd6 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 | 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
|