Module mathcomp.analysis.lebesgue_integral_theory.lebesgue_Rintegral
From HB Require Import structures.From mathcomp Require Import boot order ssralg ssrnum ssrint interval.
From mathcomp Require Import interval_inference archimedean finmap.
From mathcomp Require Import boolp classical_sets functions cardinality fsbigop.
From mathcomp Require Import reals real_interval topology ereal tvs.
From mathcomp Require Import normedtype sequences esum measure.
From mathcomp Require Import lebesgue_measure numfun realfun measurable_realfun.
From mathcomp Require Import simple_functions measurable_fun_approximation.
From mathcomp Require Import lebesgue_integral_definition.
From mathcomp Require Import lebesgue_integral_monotone_convergence.
From mathcomp Require Import lebesgue_integral_nonneg lebesgue_integrable.
From mathcomp Require Import lebesgue_integral_dominated_convergence.
Set Implicit Arguments.
Unset Strict Implicit.
Unset Printing Implicit Defensive.
Import Order.TTheory GRing.Theory Num.Theory.
Import numFieldNormedType.Exports.
Local Open Scope classical_set_scope.
Local Open Scope ring_scope.
Section Rintegral.
Local Open Scope ereal_scope.
Context ( : measurableType d) ( : realType)
( : {measure set T -> \bar R}).
Definition
Rintegral : forall [d : measure_display] [T : measurableType d] [R : realType], {measure set T -> \bar R}%R -> set T -> (T -> R) -> R Rintegral is not universe polymorphic Arguments Rintegral [d]%_measure_display_scope [T R] mu D%_classical_set_scope f%_function_scope Rintegral is transparent Expands to: Constant mathcomp.analysis.lebesgue_integral_theory.lebesgue_Rintegral.Rintegral Declared in library mathcomp.analysis.lebesgue_integral_theory.lebesgue_Rintegral, line 46, characters 11-20
Used by
- mathcomp.analysis.pi_irrational
- mathcomp.analysis.lebesgue_integral_theory.radon_nikodym
- mathcomp.analysis.lebesgue_integral_theory.lebesgue_integral_under
- mathcomp.analysis.probability_theory.beta_distribution
- mathcomp.analysis.gauss_integral
- mathcomp.analysis.ftc
- mathcomp.analysis.elementary_functions.trigonometry_integral
Source code
fine (\int[mu]_( in D) (f x)%:E).
End Rintegral.
Notation
(Rintegral mu D (fun => f)%R) : ring_scope.
Notation
(Rintegral mu setT (fun => f)%R) : ring_scope.
Section Rintegral.
Context { : measurableType d} { : realType}
( : {measure set T -> \bar R}).
Implicit Types (D A B : set T) (f : T -> R).
Lemma
mu.-integrable A (EFin \o f) ->
`| \int[mu]_( in A) f x |%:E = `| \int[mu]_( in A) (f x)%:E |%E.
Proof.
- rewrite abse_fin_num fin_num_abs.
exact: (le_lt_trans (le_abse_integral _ _ _)).
- rewrite /= fine_abse// fin_num_abs.
exact: (le_lt_trans (le_abse_integral _ _ _)).
Qed.
Lemma
- mathcomp.analysis.lebesgue_integral_theory.lebesgue_integral_under
- mathcomp.analysis.probability_theory.beta_distribution
- mathcomp.analysis.gauss_integral
- mathcomp.analysis.ftc
Source code
\int[mu]_( in D) f x = \int[mu]_( in D) g x.
Proof.
Lemma
- mathcomp.analysis.probability_theory.beta_distribution
Source code
Proof.
Lemma
- mathcomp.analysis.ftc
Source code
\int[mu]_( in D `&` P) f x = \int[mu]_( in D) (f \_ P) x.
Proof.
Lemma
\int[mu]_( in P `&` D) f x = \int[mu]_( in D) (f \_ P) x.
Proof.
Lemma
- mathcomp.analysis.lebesgue_integral_theory.lebesgue_integral_under
- mathcomp.analysis.probability_theory.beta_distribution
- mathcomp.analysis.gauss_integral
Source code
\int[mu]_( in D) (r * f x) = r * \int[mu]_( in D) f x.
Proof.
exact: integrable_fin_num.
by congr fine; under eq_integral do rewrite EFinM; exact: integralZl.
Qed.
Lemma
\int[mu]_( in D) f x * r = (\int[mu]_( in D) f x) * r.
Proof.
Lemma
- mathcomp.analysis.gauss_integral
Source code
0 <= \int[mu]_( in D) f x.
Proof.
Import MeasurableR.
Lemma
- mathcomp.analysis.lebesgue_integral_theory.lebesgue_integral_under
- mathcomp.analysis.ftc
Source code
`|\int[mu]_( in D) f t| <= \int[mu]_( in D) `|f t|.
Proof.
rewrite -lee_fin; apply: le_trans.
apply: (le_trans _ (le_abse_integral mu mA mf)).
rewrite /abse.
have [/fineK <-//|] := boolP (\int[mu]_( in D) (EFin \o f) x \is a fin_num)%E.
by rewrite fin_numEn => /orP[|] /eqP ->; rewrite leey.
rewrite /Rintegral.
move: ifoo.
rewrite -ge0_fin_numE; first exact: integral_ge0.
move/fineK ->.
by apply: ge0_le_integral => //=; do 2 apply: measurableT_comp => //;
exact/measurable_EFinP.
Qed.
Lemma
- mathcomp.analysis.ftc
Source code
d.-measurable A -> d.-measurable B ->
mu.-integrable (A `|` B) (EFin \o f) -> [disjoint A & B] ->
\int[mu]_( in (A `|` B)) f x = \int[mu]_( in A) f x + \int[mu]_( in B) f x.
Proof.
exact/(measurable_int mu).
have mAf : mu.-integrable A (EFin \o f).
by apply: integrableS mf => //; exact: measurableU.
have mBf : mu.-integrable B (EFin \o f).
by apply: integrableS mf => //; exact: measurableU.
move/integrableP : mAf => [mAf itAfoo].
move/integrableP : mBf => [mBf itBfoo].
rewrite fineD//.
- by rewrite fin_num_abs (le_lt_trans _ itAfoo)//; exact: le_abse_integral.
- by rewrite fin_num_abs (le_lt_trans _ itBfoo)//; exact: le_abse_integral.
Qed.
Lemma
- mathcomp.analysis.ftc
Source code
Proof.
Lemma
- mathcomp.analysis.pi_irrational
- mathcomp.analysis.lebesgue_integral_theory.lebesgue_integral_differentiation
- mathcomp.analysis.probability_theory.beta_distribution
- mathcomp.analysis.gauss_integral
Source code
forall , \int[mu]_(_ in D) r = r * fine (mu D).
Proof.
have := leey (mu D); rewrite le_eqVlt => /predU1P[->/=|muy]; last first.
by rewrite fineM// ge0_fin_numE.
rewrite mulr0 mulr_infty/=; have [_|r0|r0] := sgrP r.
- by rewrite mul0e.
- by rewrite mul1e.
- by rewrite mulN1e.
Qed.
Lemma
- mathcomp.analysis.pi_irrational
Source code
mu.-integrable D (EFin \o f1) ->
mu.-integrable D (EFin \o f2) ->
(forall , D x -> f1 x <= f2 x) ->
\int[mu]_( in D) f1 x <= \int[mu]_( in D) f2 x.
Proof.
- rewrite -integral_fin_num_abs//; last by case/integrableP : mf1.
by apply/measurable_EFinP; case/integrableP : mf1.
- rewrite -integral_fin_num_abs//; last by case/integrableP : mf2.
by apply/measurable_EFinP; case/integrableP : mf2.
- by apply/le_integral => // x xD; rewrite lee_fin f12//; exact/set_mem.
Qed.
Lemma
mu.-integrable D (EFin \o f1) -> mu.-integrable D (EFin \o f2) ->
\int[mu]_( in D) (f1 x + f2 x) =
\int[mu]_( in D) f1 x + \int[mu]_( in D) f2 x.
Proof.
Lemma
- mathcomp.analysis.lebesgue_integral_theory.lebesgue_integral_under
Source code
mu.-integrable D (EFin \o f1) -> mu.-integrable D (EFin \o f2) ->
\int[mu]_( in D) (f1 x - f2 x) =
\int[mu]_( in D) f1 x - \int[mu]_( in D) f2 x.
Proof.
End Rintegral.
Section semi_sigma_additive_measure_of_density.
Context ( : measurableType d) { : realType} ( : {measure set T -> \bar R}).
Local Open Scope ereal_scope.
Lemma
- mathcomp.analysis.lebesgue_integral_theory.radon_nikodym
Source code
measurable_fun setT f -> (forall , 0 <= f x) ->
semi_sigma_additive (fun => \int[mu]_( in A) f t).
Proof.
exact: measurable_funTS.
by apply: is_cvg_ereal_nneg_natsum_cond => // n _ _; exact: integral_ge0.
Qed.
End semi_sigma_additive_measure_of_density.
#[deprecated(since="mathcomp-analysis 1.19.0", use=semi_sigma_additive_measure_of_density)]
Notation
Section measure_of_density_def.
Import MeasurableR.
Context {} { : measurableType d} { : realType}
( : {measure set T -> \bar R}).
Definition
measure_of_density : forall {d : measure_display} {T : measurableType d} {R : realType}, {measure set T -> \bar R}%R -> forall [f : T -> R], measurable_fun (T:=T) (U:=Real_sort__canonical__measurable_structure_SigmaRing) [set: T] f -> (forall x : T, (0 <= f x)%R) -> set T -> GRing.BaseAddMagma.sort \bar R measure_of_density is not universe polymorphic Arguments measure_of_density {d}%_measure_display_scope {T R} mu [f]%_function_scope mf f0%_function_scope A%_classical_set_scope measure_of_density is transparent Expands to: Constant mathcomp.analysis.lebesgue_integral_theory.lebesgue_Rintegral.measure_of_density Declared in library mathcomp.analysis.lebesgue_integral_theory.lebesgue_Rintegral, line 220, characters 11-29
Used by
- mathcomp.analysis.probability_theory.normal_distribution
Source code
( : forall , 0 <= f x) :=
fun => (\int[mu]_( in A) (f t)%:E)%E.
End measure_of_density_def.
Section measure_of_density.
Import MeasurableR.
Context {} { : measurableType d} { : realType}
( : {measure set T -> \bar R}) ( : T -> R).
Hypotheses ( : measurable_fun [set: T] f) ( : forall , (0 <= f x)%R).
Local Notation := (measure_of_density mu mf f0).
Let
Proof.
Let
Proof.
Let
Proof.
.
m'0 m'_ge0 m'_semi_sigma_additive.
End measure_of_density.
Section integral_measure_of_density.
Import MeasurableR.
Local Open Scope ereal_scope.
Context {} { : measurableType d} { : realType}
( : {measure set T -> \bar R}) ( : T -> R).
Hypothesis : measurable_fun [set: T] h.
Hypothesis : forall , (0 <= h x)%R.
Let
#[local] Lemma
\int[mu]_ ((\1_A x)%:E * (h x)%:E) = mu' A.
Proof.
rewrite patchE indicE; case: ifP => _; first by rewrite mul1e.
by rewrite mul0e.
Qed.
#[local] Lemma
(0 <= r)%R ->
\int[mu]_ (r%:E * (\1_A x)%:E * (h x)%:E) = r%:E * mu' A.
Proof.
under eq_integral do rewrite -muleA.
rewrite ge0_integralZl//=.
- apply: emeasurable_funM => //; by apply /measurable_EFinP.
- by move=> x _; apply: mule_ge0; rewrite ?lee_fin.
- by rewrite integral_measure_of_density_indic.
Qed.
Import HBNNSimple.
#[local] Lemma
sintegral mu' g = \int[mu]_ ((g x)%:E * (h x)%:E).
Proof.
\int[mu]_ (r%:E * (\1_(g @^-1` [set r]) x)%:E * (h x)%:E)).
rewrite sintegralE; apply: eq_fsbigr => r /set_mem[x0 _ <-].
by rewrite integral_measure_of_densityMindic.
transitivity (\int[mu]_ (\sum_( \in range g)
((r * (\1_(g @^-1` [set r]) x))%:E * (h x)%:E))).
rewrite ge0_integral_fsum//=.
- move=> r.
under eq_fun do rewrite EFinM -muleA.
apply: measurable_funeM.
by apply: emeasurable_funM => //; exact/measurable_EFinP.
- move=> r x _; have [r0|r0] := leP 0%R r.
by rewrite mule_ge0// lee_fin// mulr_ge0.
by rewrite preimage_nnfun0// indic0/= mulr0 mul0e.
apply: eq_integral => x _.
rewrite -ge0_mule_fsuml; first by move=> _ [t _ <-]; rewrite lee_fin mulr_ge0.
by rewrite fsumEFin// [in RHS](fimfunE g).
Qed.
Lemma
measurable_fun [set: T] f -> (forall , 0 <= f x) ->
\int[mu']_ f x = \int[mu]_ (f x * (h x)%:E).
Proof.
pose g := nnsfun_approx measurableT mf.
pose gE := fun => EFin \o g n.
have mgE n : measurable_fun [set: T] (EFin \o g n) by exact/measurable_EFinP.
have gE_ge0 n x : 0 <= gE n x by rewrite lee_fin.
have nd_gE x : {homo gE ^~ x : / (n <= p)%O >-> n <= p}.
by move=> *; exact/lefP/nd_nnsfun_approx.
transitivity (limn (fun => \int[mu']_ gE n x)).
rewrite -monotone_convergence//; apply: eq_integral => t _.
by apply/esym/cvg_lim => //; exact: cvg_nnsfun_approx.
transitivity (limn (fun => \int[mu]_ (gE n x * (h x)%:E))).
apply: congr_lim; apply/funext => n.
by rewrite integralT_nnsfun sintegral_measure_of_density.
have mgEh n : measurable_fun [set: T] (fun => gE n x * (h x)%:E).
by apply: emeasurable_funM => //; exact/measurable_EFinP.
have gEh_ge0 n x : 0 <= gE n x * (h x)%:E by rewrite mule_ge0// lee_fin.
have nd_gEh x :
{homo (fun => gE n x * (h x)%:E) : / (n <= p)%O >-> n <= p}.
by move=> p q pq; rewrite lee_wpmul2r ?lee_fin//; exact: nd_gE.
rewrite -monotone_convergence//.
apply: eq_integral => x _.
apply: cvg_lim => //; apply: cvgeZr => //.
exact: cvg_nnsfun_approx.
Qed.
End integral_measure_of_density.
Section Rintegral_lebesgue_measure.
Context { : realType}.
Notation := (@lebesgue_measure R).
Implicit Type f : R -> R.
Import MeasurableR.
Lemma
mu.-integrable [set` Interval a (BLeft r)] (EFin \o f) ->
\int[mu]_( in [set` Interval a (BLeft r)]) (f x) =
\int[mu]_( in [set` Interval a (BRight r)]) (f x).
Proof.
Lemma
- mathcomp.analysis.ftc
Source code
mu.-integrable [set` Interval (BRight r) b] (EFin \o f) ->
\int[mu]_( in [set` Interval (BRight r) b]) (f x) =
\int[mu]_( in [set` Interval (BLeft r) b]) (f x).
Proof.
Lemma
- mathcomp.analysis.gauss_integral
- mathcomp.analysis.ftc
- mathcomp.analysis.elementary_functions.trigonometry_integral
Source code
Proof.
Lemma
- mathcomp.analysis.ftc
Source code
mu.-integrable [set` (Interval a b)] (EFin \o f) ->
(a <= BRight x)%O -> (BRight x <= b)%O ->
\int[mu]_( in [set` Interval a b]) f t -
\int[mu]_( in [set` Interval a (BRight x)]) f t =
\int[mu]_( in [set` Interval (BRight x) b]) f x.
Proof.
rewrite ax => _; rewrite [in X in _ - X]set_itv_ge ?bnd_simp//.
by rewrite Rintegral_set0 subr0.
rewrite (@itv_bndbnd_setU _ _ _ (BLeft x)).
by case: a ax {itf} => -[].
by rewrite (le_trans _ xb)// bnd_simp.
rewrite Rintegral_setU//=.
- by rewrite -itv_bndbnd_setU -?ltBRight_leBLeft// ltW.
- apply/disj_setPS => y [/=]; rewrite 2!in_itv/= => /andP[_ yx] /andP[].
by rewrite leNgt yx.
rewrite Rintegral_itvbo_itvbc//.
apply: integrableS itf => //; apply: subset_itvl.
by rewrite (le_trans _ xb)// bnd_simp.
rewrite addrC addKr Rintegral_itvob_itvcb//.
by apply: integrableS itf => //; exact/subset_itvr/ltW.
Qed.
End Rintegral_lebesgue_measure.
#[deprecated(since="mathcomp-analysis 1.17.0", use=Rintegral_itvbo_itvbc)]
Notation
#[deprecated(since="mathcomp-analysis 1.17.0", use=Rintegral_itvob_itvcb)]
Notation
Section Rdominated_convergence.
Context {} { : measurableType d} { : realType}
( : {measure set T -> \bar R}) ( : set T) ( : measurable D)
( : (T -> R)^nat) ( : T -> R).
Import MeasurableR.
Hypotheses (
(
(
(
Lemma
\int[mu]_( in D) f_ n x @[ \oo] --> \int[mu]_( in D) f x.
Proof.
have []// := @dominated_convergence _ _ _ mu _ mD (fun => (f_ n t)%:E)
(EFin \o f) (EFin \o g).
- by move=> n; exact/measurable_EFinP.
- exact/measurable_EFinP/measurable_fun_cvg.
- by apply: aeW => x Dx; apply/fine_cvgP; split; [exact: nearW|exact: f_f].
- by apply: aeW => x n Dx/=; rewrite lee_fin absfg.
by move=> int_f _/= int_f_f; apply/fine_cvg; rewrite fineK// integrable_fin_num.
Qed.
End Rdominated_convergence.