File size: 4,220 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
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
import OAI.Analysis.CircleDomains.Selection.TaggedPointContacts

namespace OAI

/-! Fubini for complete path images. At free points, tuple absolute
continuity reduces a path hit to a residual hit; residual nullity then
annihilates the integrated whole-image hit probability. -/

open Set MeasureTheory Filter
open scoped ENNReal

noncomputable section

namespace CircleDomainRigidity

variable {X Y : Type*} [MetricSpace X] [MetricSpace Y]
  [MeasurableSpace X] [MeasurableSpace C(PathTime, X)]

def codeHitGraph (d : PathCodeData X Y) : Set (BasePathCode d Γ— X) :=
  {q | q.2 ∈ Set.range q.1.val.1}

def codeResidualGraph (d : PathCodeData X Y) : Set (BasePathCode d Γ— X) :=
  {q | q.2 ∈ residualImage d.dust q.1.val}

theorem isClosed_codeHitGraph (d : PathCodeData X Y) : IsClosed (codeHitGraph d) :=
  isClosed_pathHitSet.preimage
    (((continuous_subtype_val.comp continuous_fst).fst).prodMk continuous_snd)

theorem isClosed_codeResidualGraph (d : PathCodeData X Y) (hB : IsClosed d.dust) :
    IsClosed (codeResidualGraph d) :=
  (isClosed_residualImageGraph hB).preimage
    ((continuous_subtype_val.comp continuous_fst).prodMk continuous_snd)

def codeHitProbability (d : PathCodeData X Y) (P : ProbabilityMeasure (BasePathCode d))
    (x : X) : ℝβ‰₯0∞ :=
  (P : Measure (BasePathCode d)) {Ξ“ | x ∈ Set.range Ξ“.val.1}

def codeResidualProbability (d : PathCodeData X Y) (P : ProbabilityMeasure (BasePathCode d))
    (x : X) : ℝβ‰₯0∞ :=
  (P : Measure (BasePathCode d)) {Ξ“ | x ∈ residualImage d.dust Ξ“.val}

variable [BorelSpace X] [BorelSpace C(PathTime, X)] [SecondCountableTopology X]

theorem measurable_codeHitProbability (d : PathCodeData X Y)
    (P : ProbabilityMeasure (BasePathCode d)) : Measurable (codeHitProbability d P) :=
  measurable_measure_prodMk_right (isClosed_codeHitGraph d).measurableSet

theorem measurable_codeResidualProbability (d : PathCodeData X Y) (hB : IsClosed d.dust)
    (P : ProbabilityMeasure (BasePathCode d)) : Measurable (codeResidualProbability d P) :=
  measurable_measure_prodMk_right (isClosed_codeResidualGraph d hB).measurableSet

theorem lintegral_codeResidualProbability (d : PathCodeData X Y) (hB : IsClosed d.dust)
    (P : ProbabilityMeasure (BasePathCode d)) (Ξ½ : Measure X) [SFinite Ξ½] :
    ∫⁻ x, codeResidualProbability d P x βˆ‚Ξ½ =
      ∫⁻ Ξ“ : BasePathCode d, Ξ½ (residualImage d.dust Ξ“.val) βˆ‚(P : Measure (BasePathCode d)) := by
  have hm := (isClosed_codeResidualGraph d hB).measurableSet
  exact (Measure.prod_apply_symm hm).symm.trans (Measure.prod_apply hm)

omit [BorelSpace X] [BorelSpace C(PathTime, X)] [SecondCountableTopology X] in
theorem codeHitProbability_eq_residual (d : PathCodeData X Y)
    (hH : βˆ€ i, IsClosed (d.levels i)) (P : ProbabilityMeasure (BasePathCode d))
    (Ο‰ : TupleType β†’ ℝβ‰₯0∞) (hΟ„ : meanCodeTuple d P β‰ͺ tupleReference Ο‰)
    {x : X} (hx : x ∈ d.dust)
    (hfree : βˆ€ i, volume {t : UnitAddCircle | (t, x) ∈ d.levels i} = 0) :
    codeHitProbability d P x = codeResidualProbability d P x := by
  apply measure_congr
  filter_upwards [ae_path_hit_iff_residual d hH P Ο‰ hΟ„ hx hfree] with Ξ“ hΞ“
  exact propext hΞ“

theorem lintegral_codeHitProbability_zero (d : PathCodeData X Y) (hB : IsClosed d.dust)
    (hH : βˆ€ i, IsClosed (d.levels i)) (P : ProbabilityMeasure (BasePathCode d))
    (Ο‰ : TupleType β†’ ℝβ‰₯0∞) (hΟ„ : meanCodeTuple d P β‰ͺ tupleReference Ο‰)
    (Ξ½ : Measure X) [SFinite Ξ½]
    (hfree : βˆ€α΅ x βˆ‚Ξ½, x ∈ d.dust ∧
      βˆ€ i, volume {t : UnitAddCircle | (t, x) ∈ d.levels i} = 0)
    (hres : βˆ€α΅ Ξ“ βˆ‚(P : Measure (BasePathCode d)), Ξ½ (residualImage d.dust Ξ“.val) = 0) :
    ∫⁻ x, codeHitProbability d P x βˆ‚Ξ½ = 0 := by
  calc
    _ = ∫⁻ x, codeResidualProbability d P x βˆ‚Ξ½ :=
      lintegral_congr_ae (hfree.mono fun x hx =>
        codeHitProbability_eq_residual d hH P Ο‰ hΟ„ hx.1 hx.2)
    _ = ∫⁻ Ξ“ : BasePathCode d, Ξ½ (residualImage d.dust Ξ“.val)
        βˆ‚(P : Measure (BasePathCode d)) := lintegral_codeResidualProbability d hB P Ξ½
    _ = 0 := (lintegral_eq_zero_iff
      ((measurable_residualImageMass hB Ξ½).comp measurable_subtype_coe)).mpr hres

end CircleDomainRigidity

end

end OAI