math / data /lean /OAI /Analysis /CircleDomains /Selection /CodeConstraints.lean
introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
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