-
Notifications
You must be signed in to change notification settings - Fork 298
/
set_to_l1.lean
1825 lines (1591 loc) · 82.6 KB
/
set_to_l1.lean
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
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/-
Copyright (c) 2021 Rémy Degenne. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Zhouhang Zhou, Yury Kudryashov, Sébastien Gouëzel, Rémy Degenne
-/
import measure_theory.function.simple_func_dense_lp
/-!
# Extension of a linear function from indicators to L1
Let `T : set α → E →L[ℝ] F` be additive for measurable sets with finite measure, in the sense that
for `s, t` two such sets, `s ∩ t = ∅ → T (s ∪ t) = T s + T t`. `T` is akin to a bilinear map on
`set α × E`, or a linear map on indicator functions.
This file constructs an extension of `T` to integrable simple functions, which are finite sums of
indicators of measurable sets with finite measure, then to integrable functions, which are limits of
integrable simple functions.
The main result is a continuous linear map `(α →₁[μ] E) →L[ℝ] F`. This extension process is used to
define the Bochner integral in the `measure_theory.integral.bochner` file and the conditional
expectation of an integrable function in `measure_theory.function.conditional_expectation`.
## Main Definitions
- `fin_meas_additive μ T`: the property that `T` is additive on measurable sets with finite measure.
For two such sets, `s ∩ t = ∅ → T (s ∪ t) = T s + T t`.
- `dominated_fin_meas_additive μ T C`: `fin_meas_additive μ T ∧ ∀ s, ∥T s∥ ≤ C * (μ s).to_real`.
This is the property needed to perform the extension from indicators to L1.
- `set_to_L1 (hT : dominated_fin_meas_additive μ T C) : (α →₁[μ] E) →L[ℝ] F`: the extension of `T`
from indicators to L1.
- `set_to_fun μ T (hT : dominated_fin_meas_additive μ T C) (f : α → E) : F`: a version of the
extension which applies to functions (with value 0 if the function is not integrable).
## Properties
For most properties of `set_to_fun`, we provide two lemmas. One version uses hypotheses valid on
all sets, like `T = T'`, and a second version which uses a primed name uses hypotheses on
measurable sets with finite measure, like `∀ s, measurable_set s → μ s < ∞ → T s = T' s`.
The lemmas listed here don't show all hypotheses. Refer to the actual lemmas for details.
Linearity:
- `set_to_fun_zero_left : set_to_fun μ 0 hT f = 0`
- `set_to_fun_add_left : set_to_fun μ (T + T') _ f = set_to_fun μ T hT f + set_to_fun μ T' hT' f`
- `set_to_fun_smul_left : set_to_fun μ (λ s, c • (T s)) (hT.smul c) f = c • set_to_fun μ T hT f`
- `set_to_fun_zero : set_to_fun μ T hT (0 : α → E) = 0`
- `set_to_fun_neg : set_to_fun μ T hT (-f) = - set_to_fun μ T hT f`
If `f` and `g` are integrable:
- `set_to_fun_add : set_to_fun μ T hT (f + g) = set_to_fun μ T hT f + set_to_fun μ T hT g`
- `set_to_fun_sub : set_to_fun μ T hT (f - g) = set_to_fun μ T hT f - set_to_fun μ T hT g`
If `T` is verifies `∀ c : 𝕜, ∀ s x, T s (c • x) = c • T s x`:
- `set_to_fun_smul : set_to_fun μ T hT (c • f) = c • set_to_fun μ T hT f`
Other:
- `set_to_fun_congr_ae (h : f =ᵐ[μ] g) : set_to_fun μ T hT f = set_to_fun μ T hT g`
- `set_to_fun_measure_zero (h : μ = 0) : set_to_fun μ T hT f = 0`
If the space is a `normed_lattice_add_comm_group` and `T` is such that `0 ≤ T s x` for `0 ≤ x`, we
also prove order-related properties:
- `set_to_fun_mono_left (h : ∀ s x, T s x ≤ T' s x) : set_to_fun μ T hT f ≤ set_to_fun μ T' hT' f`
- `set_to_fun_nonneg (hf : 0 ≤ᵐ[μ] f) : 0 ≤ set_to_fun μ T hT f`
- `set_to_fun_mono (hfg : f ≤ᵐ[μ] g) : set_to_fun μ T hT f ≤ set_to_fun μ T hT g`
## Implementation notes
The starting object `T : set α → E →L[ℝ] F` matters only through its restriction on measurable sets
with finite measure. Its value on other sets is ignored.
-/
noncomputable theory
open_locale classical topological_space big_operators nnreal ennreal measure_theory pointwise
open set filter topological_space ennreal emetric
namespace measure_theory
variables {α E F F' G 𝕜 : Type*} {p : ℝ≥0∞}
[normed_group E] [normed_space ℝ E]
[normed_group F] [normed_space ℝ F]
[normed_group F'] [normed_space ℝ F']
[normed_group G]
{m : measurable_space α} {μ : measure α}
local infixr ` →ₛ `:25 := simple_func
open finset
section fin_meas_additive
/-- A set function is `fin_meas_additive` if its value on the union of two disjoint measurable
sets with finite measure is the sum of its values on each set. -/
def fin_meas_additive {β} [add_monoid β] {m : measurable_space α}
(μ : measure α) (T : set α → β) : Prop :=
∀ s t, measurable_set s → measurable_set t → μ s ≠ ∞ → μ t ≠ ∞ → s ∩ t = ∅ → T (s ∪ t) = T s + T t
namespace fin_meas_additive
variables {β : Type*} [add_comm_monoid β] {T T' : set α → β}
lemma zero : fin_meas_additive μ (0 : set α → β) := λ s t hs ht hμs hμt hst, by simp
lemma add (hT : fin_meas_additive μ T) (hT' : fin_meas_additive μ T') :
fin_meas_additive μ (T + T') :=
begin
intros s t hs ht hμs hμt hst,
simp only [hT s t hs ht hμs hμt hst, hT' s t hs ht hμs hμt hst, pi.add_apply],
abel,
end
lemma smul [monoid 𝕜] [distrib_mul_action 𝕜 β] (hT : fin_meas_additive μ T) (c : 𝕜) :
fin_meas_additive μ (λ s, c • (T s)) :=
λ s t hs ht hμs hμt hst, by simp [hT s t hs ht hμs hμt hst]
lemma of_eq_top_imp_eq_top {μ' : measure α}
(h : ∀ s, measurable_set s → μ s = ∞ → μ' s = ∞) (hT : fin_meas_additive μ T) :
fin_meas_additive μ' T :=
λ s t hs ht hμ's hμ't hst, hT s t hs ht (mt (h s hs) hμ's) (mt (h t ht) hμ't) hst
lemma of_smul_measure (c : ℝ≥0∞) (hc_ne_top : c ≠ ∞) (hT : fin_meas_additive (c • μ) T) :
fin_meas_additive μ T :=
begin
refine of_eq_top_imp_eq_top (λ s hs hμs, _) hT,
rw [measure.smul_apply, smul_eq_mul, with_top.mul_eq_top_iff] at hμs,
simp only [hc_ne_top, or_false, ne.def, false_and] at hμs,
exact hμs.2,
end
lemma smul_measure (c : ℝ≥0∞) (hc_ne_zero : c ≠ 0) (hT : fin_meas_additive μ T) :
fin_meas_additive (c • μ) T :=
begin
refine of_eq_top_imp_eq_top (λ s hs hμs, _) hT,
rw [measure.smul_apply, smul_eq_mul, with_top.mul_eq_top_iff],
simp only [hc_ne_zero, true_and, ne.def, not_false_iff],
exact or.inl hμs,
end
lemma smul_measure_iff (c : ℝ≥0∞) (hc_ne_zero : c ≠ 0) (hc_ne_top : c ≠ ∞) :
fin_meas_additive (c • μ) T ↔ fin_meas_additive μ T :=
⟨λ hT, of_smul_measure c hc_ne_top hT, λ hT, smul_measure c hc_ne_zero hT⟩
lemma map_empty_eq_zero {β} [add_cancel_monoid β] {T : set α → β} (hT : fin_meas_additive μ T) :
T ∅ = 0 :=
begin
have h_empty : μ ∅ ≠ ∞, from (measure_empty.le.trans_lt ennreal.coe_lt_top).ne,
specialize hT ∅ ∅ measurable_set.empty measurable_set.empty h_empty h_empty
(set.inter_empty ∅),
rw set.union_empty at hT,
nth_rewrite 0 ← add_zero (T ∅) at hT,
exact (add_left_cancel hT).symm,
end
lemma map_Union_fin_meas_set_eq_sum (T : set α → β) (T_empty : T ∅ = 0)
(h_add : fin_meas_additive μ T)
{ι} (S : ι → set α) (sι : finset ι) (hS_meas : ∀ i, measurable_set (S i))
(hSp : ∀ i ∈ sι, μ (S i) ≠ ∞) (h_disj : ∀ i j ∈ sι, i ≠ j → disjoint (S i) (S j)) :
T (⋃ i ∈ sι, S i) = ∑ i in sι, T (S i) :=
begin
revert hSp h_disj,
refine finset.induction_on sι _ _,
{ simp only [finset.not_mem_empty, is_empty.forall_iff, Union_false, Union_empty, sum_empty,
forall_2_true_iff, implies_true_iff, forall_true_left, not_false_iff, T_empty], },
intros a s has h hps h_disj,
rw [finset.sum_insert has, ← h],
swap, { exact λ i hi, hps i (finset.mem_insert_of_mem hi), },
swap, { exact λ i hi j hj hij,
h_disj i (finset.mem_insert_of_mem hi) j (finset.mem_insert_of_mem hj) hij, },
rw ← h_add (S a) (⋃ i ∈ s, S i) (hS_meas a) (measurable_set_bUnion _ (λ i _, hS_meas i))
(hps a (finset.mem_insert_self a s)),
{ congr, convert finset.supr_insert a s S, },
{ exact ((measure_bUnion_finset_le _ _).trans_lt $
ennreal.sum_lt_top $ λ i hi, hps i $ finset.mem_insert_of_mem hi).ne, },
{ simp_rw set.inter_Union,
refine Union_eq_empty.mpr (λ i, Union_eq_empty.mpr (λ hi, _)),
rw ← set.disjoint_iff_inter_eq_empty,
refine h_disj a (finset.mem_insert_self a s) i (finset.mem_insert_of_mem hi) (λ hai, _),
rw ← hai at hi,
exact has hi, },
end
end fin_meas_additive
/-- A `fin_meas_additive` set function whose norm on every set is less than the measure of the
set (up to a multiplicative constant). -/
def dominated_fin_meas_additive {β} [semi_normed_group β] {m : measurable_space α}
(μ : measure α) (T : set α → β) (C : ℝ) : Prop :=
fin_meas_additive μ T ∧ ∀ s, measurable_set s → μ s < ∞ → ∥T s∥ ≤ C * (μ s).to_real
namespace dominated_fin_meas_additive
variables {β : Type*} [semi_normed_group β] {T T' : set α → β} {C C' : ℝ}
lemma zero {m : measurable_space α} (μ : measure α) (hC : 0 ≤ C) :
dominated_fin_meas_additive μ (0 : set α → β) C :=
begin
refine ⟨fin_meas_additive.zero, λ s hs hμs, _⟩,
rw [pi.zero_apply, norm_zero],
exact mul_nonneg hC to_real_nonneg,
end
lemma eq_zero_of_measure_zero {β : Type*} [normed_group β] {T : set α → β} {C : ℝ}
(hT : dominated_fin_meas_additive μ T C) {s : set α}
(hs : measurable_set s) (hs_zero : μ s = 0) :
T s = 0 :=
begin
refine norm_eq_zero.mp _,
refine ((hT.2 s hs (by simp [hs_zero])).trans (le_of_eq _)).antisymm (norm_nonneg _),
rw [hs_zero, ennreal.zero_to_real, mul_zero],
end
lemma eq_zero {β : Type*} [normed_group β] {T : set α → β} {C : ℝ}
{m : measurable_space α} (hT : dominated_fin_meas_additive (0 : measure α) T C)
{s : set α} (hs : measurable_set s) :
T s = 0 :=
eq_zero_of_measure_zero hT hs (by simp only [measure.coe_zero, pi.zero_apply])
lemma add (hT : dominated_fin_meas_additive μ T C) (hT' : dominated_fin_meas_additive μ T' C') :
dominated_fin_meas_additive μ (T + T') (C + C') :=
begin
refine ⟨hT.1.add hT'.1, λ s hs hμs, _⟩,
rw [pi.add_apply, add_mul],
exact (norm_add_le _ _).trans (add_le_add (hT.2 s hs hμs) (hT'.2 s hs hμs)),
end
lemma smul [normed_field 𝕜] [normed_space 𝕜 β] (hT : dominated_fin_meas_additive μ T C)
(c : 𝕜) :
dominated_fin_meas_additive μ (λ s, c • (T s)) (∥c∥ * C) :=
begin
refine ⟨hT.1.smul c, λ s hs hμs, _⟩,
dsimp only,
rw [norm_smul, mul_assoc],
exact mul_le_mul le_rfl (hT.2 s hs hμs) (norm_nonneg _) (norm_nonneg _),
end
lemma of_measure_le {μ' : measure α} (h : μ ≤ μ') (hT : dominated_fin_meas_additive μ T C)
(hC : 0 ≤ C) :
dominated_fin_meas_additive μ' T C :=
begin
have h' : ∀ s, measurable_set s → μ s = ∞ → μ' s = ∞,
{ intros s hs hμs, rw [eq_top_iff, ← hμs], exact h s hs, },
refine ⟨hT.1.of_eq_top_imp_eq_top h', λ s hs hμ's, _⟩,
have hμs : μ s < ∞, from (h s hs).trans_lt hμ's,
refine (hT.2 s hs hμs).trans (mul_le_mul le_rfl _ ennreal.to_real_nonneg hC),
rw to_real_le_to_real hμs.ne hμ's.ne,
exact h s hs,
end
lemma add_measure_right {m : measurable_space α}
(μ ν : measure α) (hT : dominated_fin_meas_additive μ T C) (hC : 0 ≤ C) :
dominated_fin_meas_additive (μ + ν) T C :=
of_measure_le (measure.le_add_right le_rfl) hT hC
lemma add_measure_left {m : measurable_space α}
(μ ν : measure α) (hT : dominated_fin_meas_additive ν T C) (hC : 0 ≤ C) :
dominated_fin_meas_additive (μ + ν) T C :=
of_measure_le (measure.le_add_left le_rfl) hT hC
lemma of_smul_measure (c : ℝ≥0∞) (hc_ne_top : c ≠ ∞)
(hT : dominated_fin_meas_additive (c • μ) T C) :
dominated_fin_meas_additive μ T (c.to_real * C) :=
begin
have h : ∀ s, measurable_set s → c • μ s = ∞ → μ s = ∞,
{ intros s hs hcμs,
simp only [hc_ne_top, algebra.id.smul_eq_mul, with_top.mul_eq_top_iff, or_false, ne.def,
false_and] at hcμs,
exact hcμs.2, },
refine ⟨hT.1.of_eq_top_imp_eq_top h, λ s hs hμs, _⟩,
have hcμs : c • μ s ≠ ∞, from mt (h s hs) hμs.ne,
rw smul_eq_mul at hcμs,
simp_rw [dominated_fin_meas_additive, measure.smul_apply, smul_eq_mul, to_real_mul] at hT,
refine (hT.2 s hs hcμs.lt_top).trans (le_of_eq _),
ring,
end
lemma of_measure_le_smul {μ' : measure α} (c : ℝ≥0∞) (hc : c ≠ ∞) (h : μ ≤ c • μ')
(hT : dominated_fin_meas_additive μ T C) (hC : 0 ≤ C) :
dominated_fin_meas_additive μ' T (c.to_real * C) :=
(hT.of_measure_le h hC).of_smul_measure c hc
end dominated_fin_meas_additive
end fin_meas_additive
namespace simple_func
/-- Extend `set α → (F →L[ℝ] F')` to `(α →ₛ F) → F'`. -/
def set_to_simple_func {m : measurable_space α} (T : set α → F →L[ℝ] F') (f : α →ₛ F) : F' :=
∑ x in f.range, T (f ⁻¹' {x}) x
@[simp] lemma set_to_simple_func_zero {m : measurable_space α} (f : α →ₛ F) :
set_to_simple_func (0 : set α → F →L[ℝ] F') f = 0 :=
by simp [set_to_simple_func]
lemma set_to_simple_func_zero' {T : set α → E →L[ℝ] F'}
(h_zero : ∀ s, measurable_set s → μ s < ∞ → T s = 0) (f : α →ₛ E) (hf : integrable f μ) :
set_to_simple_func T f = 0 :=
begin
simp_rw set_to_simple_func,
refine sum_eq_zero (λ x hx, _),
by_cases hx0 : x = 0,
{ simp [hx0], },
rw [h_zero (f ⁻¹' ({x} : set E)) (measurable_set_fiber _ _)
(measure_preimage_lt_top_of_integrable f hf hx0),
continuous_linear_map.zero_apply],
end
@[simp] lemma set_to_simple_func_zero_apply {m : measurable_space α} (T : set α → F →L[ℝ] F') :
set_to_simple_func T (0 : α →ₛ F) = 0 :=
by casesI is_empty_or_nonempty α; simp [set_to_simple_func]
lemma set_to_simple_func_eq_sum_filter {m : measurable_space α}
(T : set α → F →L[ℝ] F') (f : α →ₛ F) :
set_to_simple_func T f = ∑ x in f.range.filter (λ x, x ≠ 0), (T (f ⁻¹' {x})) x :=
begin
symmetry,
refine sum_filter_of_ne (λ x hx, mt (λ hx0, _)),
rw hx0,
exact continuous_linear_map.map_zero _,
end
lemma map_set_to_simple_func (T : set α → F →L[ℝ] F') (h_add : fin_meas_additive μ T)
{f : α →ₛ G} (hf : integrable f μ) {g : G → F} (hg : g 0 = 0) :
(f.map g).set_to_simple_func T = ∑ x in f.range, T (f ⁻¹' {x}) (g x) :=
begin
have T_empty : T ∅ = 0, from h_add.map_empty_eq_zero,
have hfp : ∀ x ∈ f.range, x ≠ 0 → μ (f ⁻¹' {x}) ≠ ∞,
from λ x hx hx0, (measure_preimage_lt_top_of_integrable f hf hx0).ne,
simp only [set_to_simple_func, range_map],
refine finset.sum_image' _ (assume b hb, _),
rcases mem_range.1 hb with ⟨a, rfl⟩,
by_cases h0 : g (f a) = 0,
{ simp_rw h0,
rw [continuous_linear_map.map_zero, finset.sum_eq_zero (λ x hx, _)],
rw mem_filter at hx,
rw [hx.2, continuous_linear_map.map_zero], },
have h_left_eq : T ((map g f) ⁻¹' {g (f a)}) (g (f a))
= T (f ⁻¹' ↑(f.range.filter (λ b, g b = g (f a)))) (g (f a)),
{ congr, rw map_preimage_singleton, },
rw h_left_eq,
have h_left_eq' : T (f ⁻¹' ↑(filter (λ (b : G), g b = g (f a)) f.range)) (g (f a))
= T (⋃ y ∈ (filter (λ (b : G), g b = g (f a)) f.range), f ⁻¹' {y}) (g (f a)),
{ congr, rw ← finset.set_bUnion_preimage_singleton, },
rw h_left_eq',
rw h_add.map_Union_fin_meas_set_eq_sum T T_empty,
{ simp only [filter_congr_decidable, sum_apply, continuous_linear_map.coe_sum'],
refine finset.sum_congr rfl (λ x hx, _),
rw mem_filter at hx,
rw hx.2, },
{ exact λ i, measurable_set_fiber _ _, },
{ intros i hi,
rw mem_filter at hi,
refine hfp i hi.1 (λ hi0, _),
rw [hi0, hg] at hi,
exact h0 hi.2.symm, },
{ intros i j hi hj hij,
rw set.disjoint_iff,
intros x hx,
rw [set.mem_inter_iff, set.mem_preimage, set.mem_preimage, set.mem_singleton_iff,
set.mem_singleton_iff] at hx,
rw [← hx.1, ← hx.2] at hij,
exact absurd rfl hij, },
end
lemma set_to_simple_func_congr' (T : set α → E →L[ℝ] F) (h_add : fin_meas_additive μ T)
{f g : α →ₛ E} (hf : integrable f μ) (hg : integrable g μ)
(h : ∀ x y, x ≠ y → T ((f ⁻¹' {x}) ∩ (g ⁻¹' {y})) = 0) :
f.set_to_simple_func T = g.set_to_simple_func T :=
show ((pair f g).map prod.fst).set_to_simple_func T
= ((pair f g).map prod.snd).set_to_simple_func T, from
begin
have h_pair : integrable (f.pair g) μ, from integrable_pair hf hg,
rw map_set_to_simple_func T h_add h_pair prod.fst_zero,
rw map_set_to_simple_func T h_add h_pair prod.snd_zero,
refine finset.sum_congr rfl (λ p hp, _),
rcases mem_range.1 hp with ⟨a, rfl⟩,
by_cases eq : f a = g a,
{ dsimp only [pair_apply], rw eq },
{ have : T ((pair f g) ⁻¹' {(f a, g a)}) = 0,
{ have h_eq : T (⇑(f.pair g) ⁻¹' {(f a, g a)}) = T ((f ⁻¹' {f a}) ∩ (g ⁻¹' {g a})),
{ congr, rw pair_preimage_singleton f g, },
rw h_eq,
exact h (f a) (g a) eq, },
simp only [this, continuous_linear_map.zero_apply, pair_apply], },
end
lemma set_to_simple_func_congr (T : set α → (E →L[ℝ] F))
(h_zero : ∀ s, measurable_set s → μ s = 0 → T s = 0) (h_add : fin_meas_additive μ T)
{f g : α →ₛ E} (hf : integrable f μ) (h : f =ᵐ[μ] g) :
f.set_to_simple_func T = g.set_to_simple_func T :=
begin
refine set_to_simple_func_congr' T h_add hf ((integrable_congr h).mp hf) _,
refine λ x y hxy, h_zero _ ((measurable_set_fiber f x).inter (measurable_set_fiber g y)) _,
rw [eventually_eq, ae_iff] at h,
refine measure_mono_null (λ z, _) h,
simp_rw [set.mem_inter_iff, set.mem_set_of_eq, set.mem_preimage, set.mem_singleton_iff],
intro h,
rwa [h.1, h.2],
end
lemma set_to_simple_func_congr_left (T T' : set α → E →L[ℝ] F)
(h : ∀ s, measurable_set s → μ s < ∞ → T s = T' s) (f : α →ₛ E) (hf : integrable f μ) :
set_to_simple_func T f = set_to_simple_func T' f :=
begin
simp_rw set_to_simple_func,
refine sum_congr rfl (λ x hx, _),
by_cases hx0 : x = 0,
{ simp [hx0], },
{ rw h (f ⁻¹' {x}) (simple_func.measurable_set_fiber _ _)
(simple_func.measure_preimage_lt_top_of_integrable _ hf hx0), },
end
lemma set_to_simple_func_add_left {m : measurable_space α} (T T' : set α → F →L[ℝ] F')
{f : α →ₛ F} :
set_to_simple_func (T + T') f = set_to_simple_func T f + set_to_simple_func T' f :=
begin
simp_rw [set_to_simple_func, pi.add_apply],
push_cast,
simp_rw [pi.add_apply, sum_add_distrib],
end
lemma set_to_simple_func_add_left' (T T' T'' : set α → E →L[ℝ] F)
(h_add : ∀ s, measurable_set s → μ s < ∞ → T'' s = T s + T' s) {f : α →ₛ E}
(hf : integrable f μ) :
set_to_simple_func (T'') f = set_to_simple_func T f + set_to_simple_func T' f :=
begin
simp_rw [set_to_simple_func_eq_sum_filter],
suffices : ∀ x ∈ filter (λ (x : E), x ≠ 0) f.range,
T'' (f ⁻¹' {x}) = T (f ⁻¹' {x}) + T' (f ⁻¹' {x}),
{ rw ← sum_add_distrib,
refine finset.sum_congr rfl (λ x hx, _),
rw this x hx,
push_cast,
rw pi.add_apply, },
intros x hx,
refine h_add (f ⁻¹' {x}) (measurable_set_preimage _ _)
(measure_preimage_lt_top_of_integrable _ hf _),
rw mem_filter at hx,
exact hx.2,
end
lemma set_to_simple_func_smul_left {m : measurable_space α}
(T : set α → F →L[ℝ] F') (c : ℝ) (f : α →ₛ F) :
set_to_simple_func (λ s, c • (T s)) f = c • set_to_simple_func T f :=
by simp_rw [set_to_simple_func, continuous_linear_map.smul_apply, smul_sum]
lemma set_to_simple_func_smul_left'
(T T' : set α → E →L[ℝ] F') (c : ℝ) (h_smul : ∀ s, measurable_set s → μ s < ∞ → T' s = c • (T s))
{f : α →ₛ E} (hf : integrable f μ) :
set_to_simple_func T' f = c • set_to_simple_func T f :=
begin
simp_rw [set_to_simple_func_eq_sum_filter],
suffices : ∀ x ∈ filter (λ (x : E), x ≠ 0) f.range, T' (f ⁻¹' {x}) = c • (T (f ⁻¹' {x})),
{ rw smul_sum,
refine finset.sum_congr rfl (λ x hx, _),
rw this x hx,
refl, },
intros x hx,
refine h_smul (f ⁻¹' {x}) (measurable_set_preimage _ _)
(measure_preimage_lt_top_of_integrable _ hf _),
rw mem_filter at hx,
exact hx.2,
end
lemma set_to_simple_func_add (T : set α → E →L[ℝ] F) (h_add : fin_meas_additive μ T)
{f g : α →ₛ E} (hf : integrable f μ) (hg : integrable g μ) :
set_to_simple_func T (f + g) = set_to_simple_func T f + set_to_simple_func T g :=
have hp_pair : integrable (f.pair g) μ, from integrable_pair hf hg,
calc set_to_simple_func T (f + g) = ∑ x in (pair f g).range,
T ((pair f g) ⁻¹' {x}) (x.fst + x.snd) :
by { rw [add_eq_map₂, map_set_to_simple_func T h_add hp_pair], simp, }
... = ∑ x in (pair f g).range, (T ((pair f g) ⁻¹' {x}) x.fst + T ((pair f g) ⁻¹' {x}) x.snd) :
finset.sum_congr rfl $ assume a ha, continuous_linear_map.map_add _ _ _
... = ∑ x in (pair f g).range, T ((pair f g) ⁻¹' {x}) x.fst +
∑ x in (pair f g).range, T ((pair f g) ⁻¹' {x}) x.snd :
by rw finset.sum_add_distrib
... = ((pair f g).map prod.fst).set_to_simple_func T
+ ((pair f g).map prod.snd).set_to_simple_func T :
by rw [map_set_to_simple_func T h_add hp_pair prod.snd_zero,
map_set_to_simple_func T h_add hp_pair prod.fst_zero]
lemma set_to_simple_func_neg (T : set α → E →L[ℝ] F) (h_add : fin_meas_additive μ T)
{f : α →ₛ E} (hf : integrable f μ) :
set_to_simple_func T (-f) = - set_to_simple_func T f :=
calc set_to_simple_func T (-f) = set_to_simple_func T (f.map (has_neg.neg)) : rfl
... = - set_to_simple_func T f :
begin
rw [map_set_to_simple_func T h_add hf neg_zero, set_to_simple_func,
← sum_neg_distrib],
exact finset.sum_congr rfl (λ x h, continuous_linear_map.map_neg _ _),
end
lemma set_to_simple_func_sub (T : set α → E →L[ℝ] F) (h_add : fin_meas_additive μ T)
{f g : α →ₛ E} (hf : integrable f μ) (hg : integrable g μ) :
set_to_simple_func T (f - g) = set_to_simple_func T f - set_to_simple_func T g :=
begin
rw [sub_eq_add_neg, set_to_simple_func_add T h_add hf,
set_to_simple_func_neg T h_add hg, sub_eq_add_neg],
rw integrable_iff at hg ⊢,
intros x hx_ne,
change μ ((has_neg.neg ∘ g) ⁻¹' {x}) < ∞,
rw [preimage_comp, neg_preimage, set.neg_singleton],
refine hg (-x) _,
simp [hx_ne],
end
lemma set_to_simple_func_smul_real (T : set α → E →L[ℝ] F) (h_add : fin_meas_additive μ T)
(c : ℝ) {f : α →ₛ E} (hf : integrable f μ) :
set_to_simple_func T (c • f) = c • set_to_simple_func T f :=
calc set_to_simple_func T (c • f) = ∑ x in f.range, T (f ⁻¹' {x}) (c • x) :
by { rw [smul_eq_map c f, map_set_to_simple_func T h_add hf], rw smul_zero, }
... = ∑ x in f.range, c • (T (f ⁻¹' {x}) x) :
finset.sum_congr rfl $ λ b hb, by { rw continuous_linear_map.map_smul (T (f ⁻¹' {b})) c b, }
... = c • set_to_simple_func T f :
by simp only [set_to_simple_func, smul_sum, smul_smul, mul_comm]
lemma set_to_simple_func_smul {E} [normed_group E] [normed_field 𝕜]
[normed_space 𝕜 E] [normed_space ℝ E] [normed_space 𝕜 F] (T : set α → E →L[ℝ] F)
(h_add : fin_meas_additive μ T) (h_smul : ∀ c : 𝕜, ∀ s x, T s (c • x) = c • T s x)
(c : 𝕜) {f : α →ₛ E} (hf : integrable f μ) :
set_to_simple_func T (c • f) = c • set_to_simple_func T f :=
calc set_to_simple_func T (c • f) = ∑ x in f.range, T (f ⁻¹' {x}) (c • x) :
by { rw [smul_eq_map c f, map_set_to_simple_func T h_add hf],
rw smul_zero, }
... = ∑ x in f.range, c • (T (f ⁻¹' {x}) x) : finset.sum_congr rfl $ λ b hb, by { rw h_smul, }
... = c • set_to_simple_func T f : by simp only [set_to_simple_func, smul_sum, smul_smul, mul_comm]
section order
variables {G' G'' : Type*} [normed_lattice_add_comm_group G''] [normed_space ℝ G'']
[normed_lattice_add_comm_group G'] [normed_space ℝ G']
lemma set_to_simple_func_mono_left {m : measurable_space α}
(T T' : set α → F →L[ℝ] G'') (hTT' : ∀ s x, T s x ≤ T' s x) (f : α →ₛ F) :
set_to_simple_func T f ≤ set_to_simple_func T' f :=
by { simp_rw set_to_simple_func, exact sum_le_sum (λ i hi, hTT' _ i), }
lemma set_to_simple_func_mono_left'
(T T' : set α → E →L[ℝ] G'') (hTT' : ∀ s, measurable_set s → μ s < ∞ → ∀ x, T s x ≤ T' s x)
(f : α →ₛ E) (hf : integrable f μ) :
set_to_simple_func T f ≤ set_to_simple_func T' f :=
begin
refine sum_le_sum (λ i hi, _),
by_cases h0 : i = 0,
{ simp [h0], },
{ exact hTT' _ (measurable_set_fiber _ _) (measure_preimage_lt_top_of_integrable _ hf h0) i, }
end
lemma set_to_simple_func_nonneg {m : measurable_space α}
(T : set α → G' →L[ℝ] G'') (hT_nonneg : ∀ s x, 0 ≤ x → 0 ≤ T s x) (f : α →ₛ G') (hf : 0 ≤ f) :
0 ≤ set_to_simple_func T f :=
begin
refine sum_nonneg (λ i hi, hT_nonneg _ i _),
rw mem_range at hi,
obtain ⟨y, hy⟩ := set.mem_range.mp hi,
rw ← hy,
refine le_trans _ (hf y),
simp,
end
lemma set_to_simple_func_nonneg' (T : set α → G' →L[ℝ] G'')
(hT_nonneg : ∀ s, measurable_set s → μ s < ∞ → ∀ x, 0 ≤ x → 0 ≤ T s x)
(f : α →ₛ G') (hf : 0 ≤ f) (hfi : integrable f μ) :
0 ≤ set_to_simple_func T f :=
begin
refine sum_nonneg (λ i hi, _),
by_cases h0 : i = 0,
{ simp [h0], },
refine hT_nonneg _ (measurable_set_fiber _ _)
(measure_preimage_lt_top_of_integrable _ hfi h0) i _,
rw mem_range at hi,
obtain ⟨y, hy⟩ := set.mem_range.mp hi,
rw ← hy,
convert (hf y),
end
lemma set_to_simple_func_mono
{T : set α → G' →L[ℝ] G''} (h_add : fin_meas_additive μ T)
(hT_nonneg : ∀ s, measurable_set s → μ s < ∞ → ∀ x, 0 ≤ x → 0 ≤ T s x) {f g : α →ₛ G'}
(hfi : integrable f μ) (hgi : integrable g μ) (hfg : f ≤ g) :
set_to_simple_func T f ≤ set_to_simple_func T g :=
begin
rw [← sub_nonneg, ← set_to_simple_func_sub T h_add hgi hfi],
refine set_to_simple_func_nonneg' T hT_nonneg _ _ (hgi.sub hfi),
intro x,
simp only [coe_sub, sub_nonneg, coe_zero, pi.zero_apply, pi.sub_apply],
exact hfg x,
end
end order
lemma norm_set_to_simple_func_le_sum_op_norm {m : measurable_space α}
(T : set α → F' →L[ℝ] F) (f : α →ₛ F') :
∥f.set_to_simple_func T∥ ≤ ∑ x in f.range, ∥T (f ⁻¹' {x})∥ * ∥x∥ :=
calc ∥∑ x in f.range, T (f ⁻¹' {x}) x∥
≤ ∑ x in f.range, ∥T (f ⁻¹' {x}) x∥ : norm_sum_le _ _
... ≤ ∑ x in f.range, ∥T (f ⁻¹' {x})∥ * ∥x∥ :
by { refine finset.sum_le_sum (λb hb, _), simp_rw continuous_linear_map.le_op_norm, }
lemma norm_set_to_simple_func_le_sum_mul_norm (T : set α → F →L[ℝ] F') {C : ℝ}
(hT_norm : ∀ s, measurable_set s → ∥T s∥ ≤ C * (μ s).to_real) (f : α →ₛ F) :
∥f.set_to_simple_func T∥ ≤ C * ∑ x in f.range, (μ (f ⁻¹' {x})).to_real * ∥x∥ :=
calc ∥f.set_to_simple_func T∥
≤ ∑ x in f.range, ∥T (f ⁻¹' {x})∥ * ∥x∥ : norm_set_to_simple_func_le_sum_op_norm T f
... ≤ ∑ x in f.range, C * (μ (f ⁻¹' {x})).to_real * ∥x∥ :
begin
refine finset.sum_le_sum (λ b hb, _),
by_cases hb : ∥b∥ = 0,
{ rw hb, simp, },
rw _root_.mul_le_mul_right _,
{ exact hT_norm _ (simple_func.measurable_set_fiber _ _), },
{ exact lt_of_le_of_ne (norm_nonneg _) (ne.symm hb), },
end
... ≤ C * ∑ x in f.range, (μ (f ⁻¹' {x})).to_real * ∥x∥ : by simp_rw [mul_sum, ← mul_assoc]
lemma norm_set_to_simple_func_le_sum_mul_norm_of_integrable (T : set α → E →L[ℝ] F') {C : ℝ}
(hT_norm : ∀ s, measurable_set s → μ s < ∞ → ∥T s∥ ≤ C * (μ s).to_real) (f : α →ₛ E)
(hf : integrable f μ) :
∥f.set_to_simple_func T∥ ≤ C * ∑ x in f.range, (μ (f ⁻¹' {x})).to_real * ∥x∥ :=
calc ∥f.set_to_simple_func T∥
≤ ∑ x in f.range, ∥T (f ⁻¹' {x})∥ * ∥x∥ : norm_set_to_simple_func_le_sum_op_norm T f
... ≤ ∑ x in f.range, C * (μ (f ⁻¹' {x})).to_real * ∥x∥ :
begin
refine finset.sum_le_sum (λ b hb, _),
by_cases hb : ∥b∥ = 0,
{ rw hb, simp, },
rw _root_.mul_le_mul_right _,
{ refine hT_norm _ (simple_func.measurable_set_fiber _ _)
(simple_func.measure_preimage_lt_top_of_integrable _ hf _),
rwa norm_eq_zero at hb, },
{ exact lt_of_le_of_ne (norm_nonneg _) (ne.symm hb), },
end
... ≤ C * ∑ x in f.range, (μ (f ⁻¹' {x})).to_real * ∥x∥ : by simp_rw [mul_sum, ← mul_assoc]
lemma set_to_simple_func_indicator (T : set α → F →L[ℝ] F') (hT_empty : T ∅ = 0)
{m : measurable_space α} {s : set α} (hs : measurable_set s) (x : F) :
simple_func.set_to_simple_func T
(simple_func.piecewise s hs (simple_func.const α x) (simple_func.const α 0))
= T s x :=
begin
by_cases hs_empty : s = ∅,
{ simp only [hs_empty, hT_empty, continuous_linear_map.zero_apply, piecewise_empty, const_zero,
set_to_simple_func_zero_apply], },
by_cases hs_univ : s = univ,
{ casesI hα : is_empty_or_nonempty α,
{ refine absurd _ hs_empty,
haveI : subsingleton (set α), by { unfold set, apply_instance, },
exact subsingleton.elim s ∅, },
simp [hs_univ, set_to_simple_func], },
simp_rw set_to_simple_func,
rw [← ne.def, set.ne_empty_iff_nonempty] at hs_empty,
rw range_indicator hs hs_empty hs_univ,
by_cases hx0 : x = 0,
{ simp_rw hx0, simp, },
rw sum_insert,
swap, { rw finset.mem_singleton, exact hx0, },
rw [sum_singleton, (T _).map_zero, add_zero],
congr,
simp only [coe_piecewise, piecewise_eq_indicator, coe_const, pi.const_zero,
piecewise_eq_indicator],
rw [indicator_preimage, preimage_const_of_mem],
swap, { exact set.mem_singleton x, },
rw [← pi.const_zero, preimage_const_of_not_mem],
swap, { rw set.mem_singleton_iff, exact ne.symm hx0, },
simp,
end
lemma set_to_simple_func_const' [nonempty α] (T : set α → F →L[ℝ] F') (x : F)
{m : measurable_space α} :
simple_func.set_to_simple_func T (simple_func.const α x) = T univ x :=
by simp only [set_to_simple_func, range_const, set.mem_singleton, preimage_const_of_mem,
sum_singleton, coe_const]
lemma set_to_simple_func_const (T : set α → F →L[ℝ] F') (hT_empty : T ∅ = 0) (x : F)
{m : measurable_space α} :
simple_func.set_to_simple_func T (simple_func.const α x) = T univ x :=
begin
casesI hα : is_empty_or_nonempty α,
{ have h_univ_empty : (univ : set α) = ∅, from subsingleton.elim _ _,
rw [h_univ_empty, hT_empty],
simp only [set_to_simple_func, continuous_linear_map.zero_apply, sum_empty,
range_eq_empty_of_is_empty], },
{ exact set_to_simple_func_const' T x, },
end
end simple_func
namespace L1
open ae_eq_fun Lp.simple_func Lp
variables {α E μ}
namespace simple_func
lemma norm_eq_sum_mul (f : α →₁ₛ[μ] G) :
∥f∥ = ∑ x in (to_simple_func f).range, (μ ((to_simple_func f) ⁻¹' {x})).to_real * ∥x∥ :=
begin
rw [norm_to_simple_func, snorm_one_eq_lintegral_nnnorm],
have h_eq := simple_func.map_apply (λ x, (∥x∥₊ : ℝ≥0∞)) (to_simple_func f),
dsimp only at h_eq,
simp_rw ← h_eq,
rw [simple_func.lintegral_eq_lintegral, simple_func.map_lintegral, ennreal.to_real_sum],
{ congr,
ext1 x,
rw [ennreal.to_real_mul, mul_comm, ← of_real_norm_eq_coe_nnnorm,
ennreal.to_real_of_real (norm_nonneg _)], },
{ intros x hx,
by_cases hx0 : x = 0,
{ rw hx0, simp, },
{ exact ennreal.mul_ne_top ennreal.coe_ne_top
(simple_func.measure_preimage_lt_top_of_integrable _ (simple_func.integrable f) hx0).ne } }
end
section set_to_L1s
variables [normed_field 𝕜] [normed_space 𝕜 E]
local attribute [instance] Lp.simple_func.module
local attribute [instance] Lp.simple_func.normed_space
/-- Extend `set α → (E →L[ℝ] F')` to `(α →₁ₛ[μ] E) → F'`. -/
def set_to_L1s (T : set α → E →L[ℝ] F) (f : α →₁ₛ[μ] E) : F :=
(to_simple_func f).set_to_simple_func T
lemma set_to_L1s_eq_set_to_simple_func (T : set α → E →L[ℝ] F) (f : α →₁ₛ[μ] E) :
set_to_L1s T f = (to_simple_func f).set_to_simple_func T :=
rfl
@[simp] lemma set_to_L1s_zero_left (f : α →₁ₛ[μ] E) :
set_to_L1s (0 : set α → E →L[ℝ] F) f = 0 :=
simple_func.set_to_simple_func_zero _
lemma set_to_L1s_zero_left' {T : set α → E →L[ℝ] F}
(h_zero : ∀ s, measurable_set s → μ s < ∞ → T s = 0) (f : α →₁ₛ[μ] E) :
set_to_L1s T f = 0 :=
simple_func.set_to_simple_func_zero' h_zero _ (simple_func.integrable f)
lemma set_to_L1s_congr (T : set α → E →L[ℝ] F) (h_zero : ∀ s, measurable_set s → μ s = 0 → T s = 0)
(h_add : fin_meas_additive μ T)
{f g : α →₁ₛ[μ] E} (h : to_simple_func f =ᵐ[μ] to_simple_func g) :
set_to_L1s T f = set_to_L1s T g :=
simple_func.set_to_simple_func_congr T h_zero h_add (simple_func.integrable f) h
lemma set_to_L1s_congr_left (T T' : set α → E →L[ℝ] F)
(h : ∀ s, measurable_set s → μ s < ∞ → T s = T' s) (f : α →₁ₛ[μ] E) :
set_to_L1s T f = set_to_L1s T' f :=
simple_func.set_to_simple_func_congr_left T T' h (simple_func.to_simple_func f)
(simple_func.integrable f)
/-- `set_to_L1s` does not change if we replace the measure `μ` by `μ'` with `μ ≪ μ'`. The statement
uses two functions `f` and `f'` because they have to belong to different types, but morally these
are the same function (we have `f =ᵐ[μ] f'`). -/
lemma set_to_L1s_congr_measure {μ' : measure α} (T : set α → E →L[ℝ] F)
(h_zero : ∀ s, measurable_set s → μ s = 0 → T s = 0) (h_add : fin_meas_additive μ T)
(hμ : μ ≪ μ') (f : α →₁ₛ[μ] E) (f' : α →₁ₛ[μ'] E) (h : f =ᵐ[μ] f') :
set_to_L1s T f = set_to_L1s T f' :=
begin
refine simple_func.set_to_simple_func_congr T h_zero h_add (simple_func.integrable f) _,
refine (to_simple_func_eq_to_fun f).trans _,
suffices : f' =ᵐ[μ] ⇑(simple_func.to_simple_func f'), from h.trans this,
have goal' : f' =ᵐ[μ'] simple_func.to_simple_func f', from (to_simple_func_eq_to_fun f').symm,
exact hμ.ae_eq goal',
end
lemma set_to_L1s_add_left (T T' : set α → E →L[ℝ] F) (f : α →₁ₛ[μ] E) :
set_to_L1s (T + T') f = set_to_L1s T f + set_to_L1s T' f :=
simple_func.set_to_simple_func_add_left T T'
lemma set_to_L1s_add_left' (T T' T'' : set α → E →L[ℝ] F)
(h_add : ∀ s, measurable_set s → μ s < ∞ → T'' s = T s + T' s) (f : α →₁ₛ[μ] E) :
set_to_L1s T'' f = set_to_L1s T f + set_to_L1s T' f :=
simple_func.set_to_simple_func_add_left' T T' T'' h_add (simple_func.integrable f)
lemma set_to_L1s_smul_left (T : set α → E →L[ℝ] F) (c : ℝ) (f : α →₁ₛ[μ] E) :
set_to_L1s (λ s, c • (T s)) f = c • set_to_L1s T f :=
simple_func.set_to_simple_func_smul_left T c _
lemma set_to_L1s_smul_left' (T T' : set α → E →L[ℝ] F) (c : ℝ)
(h_smul : ∀ s, measurable_set s → μ s < ∞ → T' s = c • (T s)) (f : α →₁ₛ[μ] E) :
set_to_L1s T' f = c • set_to_L1s T f :=
simple_func.set_to_simple_func_smul_left' T T' c h_smul (simple_func.integrable f)
lemma set_to_L1s_add (T : set α → E →L[ℝ] F) (h_zero : ∀ s, measurable_set s → μ s = 0 → T s = 0)
(h_add : fin_meas_additive μ T) (f g : α →₁ₛ[μ] E) :
set_to_L1s T (f + g) = set_to_L1s T f + set_to_L1s T g :=
begin
simp_rw set_to_L1s,
rw ← simple_func.set_to_simple_func_add T h_add
(simple_func.integrable f) (simple_func.integrable g),
exact simple_func.set_to_simple_func_congr T h_zero h_add (simple_func.integrable _)
(add_to_simple_func f g),
end
lemma set_to_L1s_neg {T : set α → E →L[ℝ] F}
(h_zero : ∀ s, measurable_set s → μ s = 0 → T s = 0) (h_add : fin_meas_additive μ T)
(f : α →₁ₛ[μ] E) :
set_to_L1s T (-f) = - set_to_L1s T f :=
begin
simp_rw set_to_L1s,
have : simple_func.to_simple_func (-f) =ᵐ[μ] ⇑(-simple_func.to_simple_func f),
from neg_to_simple_func f,
rw simple_func.set_to_simple_func_congr T h_zero h_add (simple_func.integrable _) this,
exact simple_func.set_to_simple_func_neg T h_add (simple_func.integrable f),
end
lemma set_to_L1s_sub {T : set α → E →L[ℝ] F}
(h_zero : ∀ s, measurable_set s → μ s = 0 → T s = 0) (h_add : fin_meas_additive μ T)
(f g : α →₁ₛ[μ] E) :
set_to_L1s T (f - g) = set_to_L1s T f - set_to_L1s T g :=
by rw [sub_eq_add_neg, set_to_L1s_add T h_zero h_add, set_to_L1s_neg h_zero h_add, sub_eq_add_neg]
lemma set_to_L1s_smul_real (T : set α → E →L[ℝ] F)
(h_zero : ∀ s, measurable_set s → μ s = 0 → T s = 0) (h_add : fin_meas_additive μ T)
(c : ℝ) (f : α →₁ₛ[μ] E) :
set_to_L1s T (c • f) = c • set_to_L1s T f :=
begin
simp_rw set_to_L1s,
rw ← simple_func.set_to_simple_func_smul_real T h_add c (simple_func.integrable f),
refine simple_func.set_to_simple_func_congr T h_zero h_add (simple_func.integrable _) _,
exact smul_to_simple_func c f,
end
lemma set_to_L1s_smul {E} [normed_group E] [normed_space ℝ E]
[normed_space 𝕜 E] [normed_space 𝕜 F]
(T : set α → E →L[ℝ] F) (h_zero : ∀ s, measurable_set s → μ s = 0 → T s = 0)
(h_add : fin_meas_additive μ T)
(h_smul : ∀ c : 𝕜, ∀ s x, T s (c • x) = c • T s x) (c : 𝕜) (f : α →₁ₛ[μ] E) :
set_to_L1s T (c • f) = c • set_to_L1s T f :=
begin
simp_rw set_to_L1s,
rw ← simple_func.set_to_simple_func_smul T h_add h_smul c (simple_func.integrable f),
refine simple_func.set_to_simple_func_congr T h_zero h_add (simple_func.integrable _) _,
exact smul_to_simple_func c f,
end
lemma norm_set_to_L1s_le (T : set α → E →L[ℝ] F) {C : ℝ}
(hT_norm : ∀ s, measurable_set s → μ s < ∞ → ∥T s∥ ≤ C * (μ s).to_real) (f : α →₁ₛ[μ] E) :
∥set_to_L1s T f∥ ≤ C * ∥f∥ :=
begin
rw [set_to_L1s, norm_eq_sum_mul f],
exact simple_func.norm_set_to_simple_func_le_sum_mul_norm_of_integrable T hT_norm _
(simple_func.integrable f),
end
lemma set_to_L1s_indicator_const {T : set α → E →L[ℝ] F} {s : set α}
(h_zero : ∀ s, measurable_set s → μ s = 0 → T s = 0) (h_add : fin_meas_additive μ T)
(hs : measurable_set s) (hμs : μ s < ∞) (x : E) :
set_to_L1s T (simple_func.indicator_const 1 hs hμs.ne x) = T s x :=
begin
have h_empty : T ∅ = 0, from h_zero _ measurable_set.empty measure_empty,
rw set_to_L1s_eq_set_to_simple_func,
refine eq.trans _ (simple_func.set_to_simple_func_indicator T h_empty hs x),
refine simple_func.set_to_simple_func_congr T h_zero h_add (simple_func.integrable _) _,
exact to_simple_func_indicator_const hs hμs.ne x,
end
lemma set_to_L1s_const [is_finite_measure μ] {T : set α → E →L[ℝ] F}
(h_zero : ∀ s, measurable_set s → μ s = 0 → T s = 0) (h_add : fin_meas_additive μ T) (x : E) :
set_to_L1s T (simple_func.indicator_const 1 measurable_set.univ (measure_ne_top μ _) x)
= T univ x :=
set_to_L1s_indicator_const h_zero h_add measurable_set.univ (measure_lt_top _ _) x
section order
variables {G'' G' : Type*} [normed_lattice_add_comm_group G'] [normed_space ℝ G']
[normed_lattice_add_comm_group G''] [normed_space ℝ G'']
{T : set α → G'' →L[ℝ] G'}
lemma set_to_L1s_mono_left {T T' : set α → E →L[ℝ] G''} (hTT' : ∀ s x, T s x ≤ T' s x)
(f : α →₁ₛ[μ] E) :
set_to_L1s T f ≤ set_to_L1s T' f :=
simple_func.set_to_simple_func_mono_left T T' hTT' _
lemma set_to_L1s_mono_left' {T T' : set α → E →L[ℝ] G''}
(hTT' : ∀ s, measurable_set s → μ s < ∞ → ∀ x, T s x ≤ T' s x) (f : α →₁ₛ[μ] E) :
set_to_L1s T f ≤ set_to_L1s T' f :=
simple_func.set_to_simple_func_mono_left' T T' hTT' _ (simple_func.integrable f)
lemma set_to_L1s_nonneg (h_zero : ∀ s, measurable_set s → μ s = 0 → T s = 0)
(h_add : fin_meas_additive μ T)
(hT_nonneg : ∀ s, measurable_set s → μ s < ∞ → ∀ x, 0 ≤ x → 0 ≤ T s x)
{f : α →₁ₛ[μ] G''} (hf : 0 ≤ f) :
0 ≤ set_to_L1s T f :=
begin
simp_rw set_to_L1s,
obtain ⟨f', hf', hff'⟩ : ∃ f' : α →ₛ G'', 0 ≤ f' ∧ simple_func.to_simple_func f =ᵐ[μ] f',
{ obtain ⟨f'', hf'', hff''⟩ := exists_simple_func_nonneg_ae_eq hf,
exact ⟨f'', hf'', (Lp.simple_func.to_simple_func_eq_to_fun f).trans hff''⟩, },
rw simple_func.set_to_simple_func_congr _ h_zero h_add (simple_func.integrable _) hff',
exact simple_func.set_to_simple_func_nonneg' T hT_nonneg _ hf'
((simple_func.integrable f).congr hff'),
end
lemma set_to_L1s_mono (h_zero : ∀ s, measurable_set s → μ s = 0 → T s = 0)
(h_add : fin_meas_additive μ T)
(hT_nonneg : ∀ s, measurable_set s → μ s < ∞ → ∀ x, 0 ≤ x → 0 ≤ T s x)
{f g : α →₁ₛ[μ] G''} (hfg : f ≤ g) :
set_to_L1s T f ≤ set_to_L1s T g :=
begin
rw ← sub_nonneg at ⊢ hfg,
rw ← set_to_L1s_sub h_zero h_add,
exact set_to_L1s_nonneg h_zero h_add hT_nonneg hfg,
end
end order
variables [normed_space 𝕜 F]
variables (α E μ 𝕜)
/-- Extend `set α → E →L[ℝ] F` to `(α →₁ₛ[μ] E) →L[𝕜] F`. -/
def set_to_L1s_clm' {T : set α → E →L[ℝ] F} {C : ℝ} (hT : dominated_fin_meas_additive μ T C)
(h_smul : ∀ c : 𝕜, ∀ s x, T s (c • x) = c • T s x) :
(α →₁ₛ[μ] E) →L[𝕜] F :=
linear_map.mk_continuous ⟨set_to_L1s T, set_to_L1s_add T (λ _, hT.eq_zero_of_measure_zero) hT.1,
set_to_L1s_smul T (λ _, hT.eq_zero_of_measure_zero) hT.1 h_smul⟩ C
(λ f, norm_set_to_L1s_le T hT.2 f)
/-- Extend `set α → E →L[ℝ] F` to `(α →₁ₛ[μ] E) →L[ℝ] F`. -/
def set_to_L1s_clm {T : set α → E →L[ℝ] F} {C : ℝ} (hT : dominated_fin_meas_additive μ T C) :
(α →₁ₛ[μ] E) →L[ℝ] F :=
linear_map.mk_continuous ⟨set_to_L1s T, set_to_L1s_add T (λ _, hT.eq_zero_of_measure_zero) hT.1,
set_to_L1s_smul_real T (λ _, hT.eq_zero_of_measure_zero) hT.1⟩ C
(λ f, norm_set_to_L1s_le T hT.2 f)
variables {α E μ 𝕜}
variables {T T' T'' : set α → E →L[ℝ] F} {C C' C'' : ℝ}
@[simp] lemma set_to_L1s_clm_zero_left
(hT : dominated_fin_meas_additive μ (0 : set α → E →L[ℝ] F) C) (f : α →₁ₛ[μ] E) :
set_to_L1s_clm α E μ hT f = 0 :=
set_to_L1s_zero_left _
lemma set_to_L1s_clm_zero_left' (hT : dominated_fin_meas_additive μ T C)
(h_zero : ∀ s, measurable_set s → μ s < ∞ → T s = 0) (f : α →₁ₛ[μ] E) :
set_to_L1s_clm α E μ hT f = 0 :=
set_to_L1s_zero_left' h_zero f
lemma set_to_L1s_clm_congr_left (hT : dominated_fin_meas_additive μ T C)
(hT' : dominated_fin_meas_additive μ T' C') (h : T = T') (f : α →₁ₛ[μ] E) :
set_to_L1s_clm α E μ hT f = set_to_L1s_clm α E μ hT' f :=
set_to_L1s_congr_left T T' (λ _ _ _, by rw h) f
lemma set_to_L1s_clm_congr_left' (hT : dominated_fin_meas_additive μ T C)
(hT' : dominated_fin_meas_additive μ T' C')
(h : ∀ s, measurable_set s → μ s < ∞ → T s = T' s) (f : α →₁ₛ[μ] E) :
set_to_L1s_clm α E μ hT f = set_to_L1s_clm α E μ hT' f :=
set_to_L1s_congr_left T T' h f
lemma set_to_L1s_clm_congr_measure {μ' : measure α}
(hT : dominated_fin_meas_additive μ T C) (hT' : dominated_fin_meas_additive μ' T C')
(hμ : μ ≪ μ') (f : α →₁ₛ[μ] E) (f' : α →₁ₛ[μ'] E) (h : f =ᵐ[μ] f') :
set_to_L1s_clm α E μ hT f = set_to_L1s_clm α E μ' hT' f' :=
set_to_L1s_congr_measure T (λ s, hT.eq_zero_of_measure_zero) hT.1 hμ _ _ h
lemma set_to_L1s_clm_add_left (hT : dominated_fin_meas_additive μ T C)
(hT' : dominated_fin_meas_additive μ T' C') (f : α →₁ₛ[μ] E) :
set_to_L1s_clm α E μ (hT.add hT') f = set_to_L1s_clm α E μ hT f + set_to_L1s_clm α E μ hT' f :=
set_to_L1s_add_left T T' f
lemma set_to_L1s_clm_add_left' (hT : dominated_fin_meas_additive μ T C)
(hT' : dominated_fin_meas_additive μ T' C') (hT'' : dominated_fin_meas_additive μ T'' C'')
(h_add : ∀ s, measurable_set s → μ s < ∞ → T'' s = T s + T' s) (f : α →₁ₛ[μ] E) :
set_to_L1s_clm α E μ hT'' f = set_to_L1s_clm α E μ hT f + set_to_L1s_clm α E μ hT' f :=
set_to_L1s_add_left' T T' T'' h_add f
lemma set_to_L1s_clm_smul_left (c : ℝ) (hT : dominated_fin_meas_additive μ T C) (f : α →₁ₛ[μ] E) :
set_to_L1s_clm α E μ (hT.smul c) f = c • set_to_L1s_clm α E μ hT f :=
set_to_L1s_smul_left T c f
lemma set_to_L1s_clm_smul_left' (c : ℝ)
(hT : dominated_fin_meas_additive μ T C) (hT' : dominated_fin_meas_additive μ T' C')
(h_smul : ∀ s, measurable_set s → μ s < ∞ → T' s = c • (T s)) (f : α →₁ₛ[μ] E) :
set_to_L1s_clm α E μ hT' f = c • set_to_L1s_clm α E μ hT f :=
set_to_L1s_smul_left' T T' c h_smul f
lemma norm_set_to_L1s_clm_le {T : set α → E →L[ℝ] F} {C : ℝ}
(hT : dominated_fin_meas_additive μ T C) (hC : 0 ≤ C) :
∥set_to_L1s_clm α E μ hT∥ ≤ C :=
linear_map.mk_continuous_norm_le _ hC _
lemma norm_set_to_L1s_clm_le' {T : set α → E →L[ℝ] F} {C : ℝ}
(hT : dominated_fin_meas_additive μ T C) :
∥set_to_L1s_clm α E μ hT∥ ≤ max C 0 :=
linear_map.mk_continuous_norm_le' _ _
lemma set_to_L1s_clm_const [is_finite_measure μ] {T : set α → E →L[ℝ] F} {C : ℝ}
(hT : dominated_fin_meas_additive μ T C) (x : E) :
set_to_L1s_clm α E μ hT (simple_func.indicator_const 1 measurable_set.univ (measure_ne_top μ _) x)
= T univ x :=
set_to_L1s_const (λ s, hT.eq_zero_of_measure_zero) hT.1 x
section order
variables {G' G'' : Type*} [normed_lattice_add_comm_group G''] [normed_space ℝ G'']
[normed_lattice_add_comm_group G'] [normed_space ℝ G']
lemma set_to_L1s_clm_mono_left {T T' : set α → E →L[ℝ] G''} {C C' : ℝ}
(hT : dominated_fin_meas_additive μ T C) (hT' : dominated_fin_meas_additive μ T' C')
(hTT' : ∀ s x, T s x ≤ T' s x) (f : α →₁ₛ[μ] E) :
set_to_L1s_clm α E μ hT f ≤ set_to_L1s_clm α E μ hT' f :=
simple_func.set_to_simple_func_mono_left T T' hTT' _