|
| 1 | +(* mathcomp analysis (c) 2017 Inria and AIST. License: CeCILL-C. *) |
| 2 | +From HB Require Import structures. |
| 3 | +From mathcomp Require Import all_ssreflect ssralg ssrnum ssrint interval finmap. |
| 4 | +From mathcomp.classical Require Import boolp classical_sets functions. |
| 5 | +From mathcomp.classical Require Import cardinality fsbigop mathcomp_extra. |
| 6 | +Require Import signed reals ereal topology normedtype sequences esum measure. |
| 7 | +Require Import lebesgue_measure lebesgue_integral numfun derive. |
| 8 | + |
| 9 | +Set Implicit Arguments. |
| 10 | +Unset Strict Implicit. |
| 11 | +Unset Printing Implicit Defensive. |
| 12 | +Import Order.TTheory GRing.Theory Num.Def Num.Theory. |
| 13 | +Import numFieldTopology.Exports. |
| 14 | + |
| 15 | +Local Open Scope classical_set_scope. |
| 16 | +Local Open Scope ring_scope. |
| 17 | + |
| 18 | +Section AC_BV. |
| 19 | +Variable R : realType. |
| 20 | + |
| 21 | +Definition AC (f : R -> R) (a b : R) := forall e : {posnum R}, |
| 22 | + exists d : {posnum R}, forall n (ab : 'I_n -> R * R), |
| 23 | + (forall i, `[(ab i).1, (ab i).2]%classic `<=` `[a, b]%classic) /\ |
| 24 | + trivIset setT (fun i => `[(ab i).1, (ab i).2]%classic) /\ |
| 25 | + \sum_(k < n) maxr 0 ((ab k).2 - (ab k).1) < d%:num -> |
| 26 | + \sum_(k < n) maxr 0 (f (ab k).2 - f (ab k).1) < e%:num. |
| 27 | + |
| 28 | +Definition BV (f : R -> R) (a b : R) := |
| 29 | + exists g h : R -> R, |
| 30 | + {in `[a, b], {homo g : x y / x <= y}} /\ |
| 31 | + {in `[a, b], {homo h : x y / x <= y}} /\ |
| 32 | + {in `[a, b], f =1 g \- h}. |
| 33 | + |
| 34 | +End AC_BV. |
| 35 | + |
| 36 | +Section vitali. |
| 37 | +Variables (R : realType) (I : eqType). |
| 38 | +Let mu := @lebesgue_measure R. |
| 39 | + |
| 40 | +Definition Ball (C : R * {posnum R}) := ball_ normr C.1 C.2%:num. |
| 41 | + |
| 42 | +Definition Ball5 (C : R * {posnum R}) := Ball (C.1, (C.2%:num *+ 5)%:pos). |
| 43 | + |
| 44 | +Definition bounded (E : set R) := (mu E < +oo)%E. |
| 45 | + |
| 46 | +Lemma vitali (C : I -> R * {posnum R}) : |
| 47 | + exists iot : nat -> I, let D := C \o iot in |
| 48 | + (forall i, exists2 j, |
| 49 | + Ball (C i) `&` Ball (D j) !=set0 & |
| 50 | + (D j).2%:num >= (C i).2%:num * 2^-1) /\ |
| 51 | + \bigcup_i (Ball (C i)) `<=` \bigcup_j (Ball5 (D j)). |
| 52 | +Proof. |
| 53 | +Admitted. |
| 54 | + |
| 55 | +Definition is_vitali_covering (E : set R) (V : I -> R * {posnum R}) := |
| 56 | + forall x (e : {posnum R}), x \in E -> |
| 57 | + exists2 i, x \in Ball (V i) & (V i).2%:num < e%:num. |
| 58 | + |
| 59 | +Local Open Scope measure_scope. |
| 60 | +Theorem vitali_covering_theorem (E : set R) (V : I -> R * {posnum R}) : |
| 61 | + is_vitali_covering E V -> bounded E -> exists iot : nat -> I, |
| 62 | + trivIset setT (fun j => Ball (V (iot j))) /\ |
| 63 | + mu^* (E `\` \bigcup_k (Ball (V (iot k)))) = 0%E /\ |
| 64 | + (forall e : {posnum R}, exists N, |
| 65 | + mu^* (E `\` \big[setU/set0]_(k < N) (Ball (V (iot k)))) < e%:num%:E)%E. |
| 66 | +Proof. |
| 67 | +Admitted. |
| 68 | + |
| 69 | +Corollary vitali_covering_theorem2 (E : set R) (V : I -> R * {posnum R}) : |
| 70 | + is_vitali_covering E V -> bounded E -> forall e : {posnum R}, |
| 71 | + exists n (iot : 'I_n -> I), |
| 72 | + (mu (\big[setU/set0]_(i < n) (Ball (V (iot i)))) < mu^* E + e%:num%:E /\ |
| 73 | + mu^* (E `&` \big[setU/set0]_(i < n) (Ball (V (iot i)))) > mu^* E + e%:num%:E)%E. |
| 74 | +Proof. |
| 75 | +Admitted. |
| 76 | + |
| 77 | +Local Close Scope measure_scope. |
| 78 | + |
| 79 | +End vitali. |
| 80 | + |
| 81 | +Section lebesgue_differentiation. |
| 82 | +Variables (R : realType) (a b : R) (f : R^o -> R^o). |
| 83 | +Let mu := @lebesgue_measure R. |
| 84 | +Hypothesis f_nd : {in `[a, b], {homo f : x y / x <= y}}. |
| 85 | + |
| 86 | +Theorem Lebesgue_differentiation : |
| 87 | + {ae mu, forall x, x \in `[a, b] -> derivable f x 1 /\ 0 <= derive f x 1 } /\ |
| 88 | + \int[mu]_(x in `[a, b]) derive f x 1 <= f b - f a. |
| 89 | +Proof. |
| 90 | +Admitted. |
| 91 | + |
| 92 | +End lebesgue_differentiation. |
| 93 | + |
| 94 | +Section Lebesgue_differentiation_corollary. |
| 95 | +Variables (R : realType) (a b : R) (f : R -> R). |
| 96 | +Let mu := @lebesgue_measure R. |
| 97 | + |
| 98 | +Corollary Lebesgue_differentiation_corollary : |
| 99 | + BV f a b -> |
| 100 | + {ae mu, forall x, x \in `[a, b] -> derivable f x 1} /\ |
| 101 | + mu.-integrable (derive f x 1) |
| 102 | + |
| 103 | +End Lebesgue_differentiation_corollary. |
0 commit comments