File size: 3,699 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
import OAI.Analysis.FiniteFactor.Fiber.StrongContinuity
import OAI.Analysis.FiniteFactor.CrossedProduct.FieldRepresentation

namespace OAI

namespace FiniteFactor
open MeasureTheory Filter
open scoped Topology
noncomputable section

/-- A bounded diagonal on the original l2(Z) fiber. -/
def fiberDiagonal (d : β„€ β†’ β„‚) (hd : βˆ€ k, β€–d kβ€– ≀ 1) :
    SourceFiberHilbert β†’L[β„‚] SourceFiberHilbert :=
  LinearMap.mkContinuous
    { toFun := fun v => ⟨fun k => d k * v k,
        (lp.memβ„“p v).mono' (fun k => by
          rw [norm_mul]
          exact (mul_le_mul_of_nonneg_right (hd k) (norm_nonneg _)).trans_eq (one_mul _))⟩
      map_add' := fun u v => by apply Subtype.ext; funext k; exact mul_add _ _ _
      map_smul' := fun c v => by apply Subtype.ext; funext k; exact mul_left_comm _ _ _ }
    1 (fun v => by
      rw [one_mul]
      apply lp.norm_mono (by norm_num)
      intro k
      change β€–d k * v kβ€– ≀ β€–v kβ€–
      rw [norm_mul]
      exact (mul_le_mul_of_nonneg_right (hd k) (norm_nonneg _)).trans_eq (one_mul _))

@[simp] theorem fiberDiagonal_apply (d : β„€ β†’ β„‚) (hd : βˆ€ k, β€–d kβ€– ≀ 1)
    (v : SourceFiberHilbert) (k : β„€) : fiberDiagonal d hd v k = d k * v k := rfl

theorem fiberDiagonal_norm (d : β„€ β†’ β„‚) (hd : βˆ€ k, β€–d kβ€– ≀ 1) :
    β€–fiberDiagonal d hdβ€– ≀ 1 :=
  LinearMap.mkContinuous_norm_le _ (by norm_num) _

theorem fiberDiagonal_single (d : β„€ β†’ β„‚) (hd : βˆ€ k, β€–d kβ€– ≀ 1) (n : β„€) :
    fiberDiagonal d hd (lp.single 2 n (1 : β„‚)) = d n β€’ lp.single 2 n (1 : β„‚) := by
  classical
  apply Subtype.ext
  funext k
  change d k * (lp.single 2 n (1 : β„‚) : SourceFiberHilbert) k =
    d n * (lp.single 2 n (1 : β„‚) : SourceFiberHilbert) k
  by_cases h : n = k
  Β· subst k; rfl
  Β· simp [lp.single_apply, h]

theorem fiberDiagonal_continuousOn {X : Type*} [TopologicalSpace X]
    (d : X β†’ β„€ β†’ β„‚) (hd : βˆ€ x k, β€–d x kβ€– ≀ 1) (Q : Set X)
    (hc : βˆ€ k, ContinuousOn (fun x => d x k) Q) (v : SourceFiberHilbert) :
    ContinuousOn (fun x => fiberDiagonal (d x) (hd x) v) Q := by
  apply fiberField_continuousOn _ Q 1 (fun x _ => fiberDiagonal_norm _ _) _ v
  intro k
  simp_rw [fiberDiagonal_single]
  exact (hc k).smul continuousOn_const

theorem fiberDiagonal_stronglyMeasurable {X : Type*} [MeasurableSpace X]
    (d : X β†’ β„€ β†’ β„‚) (hd : βˆ€ x k, β€–d x kβ€– ≀ 1)
    (hm : βˆ€ k, Measurable (fun x => d x k)) (v : SourceFiberHilbert) :
    StronglyMeasurable (fun x => fiberDiagonal (d x) (hd x) v) := by
  apply fiberCoordinates_stronglyMeasurable
  intro k
  exact (hm k).mul_const (v k)

/-- Applying a measurable field to a measurable vector uses finite coordinate
approximations, without measurability in the operator norm topology. -/
theorem fiberField_stronglyMeasurable_apply {X : Type*} [MeasurableSpace X]
    (A : X β†’ SourceFiberHilbert β†’L[β„‚] SourceFiberHilbert)
    (hA : βˆ€ v, StronglyMeasurable (fun x => A x v))
    (v : X β†’ SourceFiberHilbert) (hv : StronglyMeasurable v) :
    StronglyMeasurable (fun x => A x (v x)) := by
  classical
  apply stronglyMeasurable_of_tendsto (atTop : Filter (Finset β„€))
    (f := fun s x => βˆ‘ k ∈ s, (v x k) β€’ A x (lp.single 2 k (1 : β„‚)))
  Β· intro s
    have h (k : β„€) : StronglyMeasurable (fun x => (v x k) β€’ A x (lp.single 2 k (1 : β„‚))) :=
      (((lp.evalCLM β„‚ (fun _ : β„€ => β„‚) 2 k).continuous.comp_stronglyMeasurable hv).smul
        (hA (lp.single 2 k (1 : β„‚))))
    convert Finset.stronglyMeasurable_sum s (fun k _ => h k) using 1
    ext x
    simp only [Finset.sum_apply]
  Β· rw [tendsto_pi_nhds]
    intro x
    exact fiberOperator_hasSum (A x) (v x)

end
end FiniteFactor

end OAI