Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
N
Numerical Analysis in Coq
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Wiki
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Snippets
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Deploy
Releases
Package Registry
Model registry
Operate
Environments
Terraform modules
Monitor
Incidents
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
Micaela Mayero
Numerical Analysis in Coq
Commits
42f1fbda
Commit
42f1fbda
authored
3 years ago
by
François Clément
Browse files
Options
Downloads
Patches
Plain Diff
Add measurable_Rbar_gen_lub_up_{m,p}.
parent
dc3b0de3
No related branches found
No related tags found
No related merge requests found
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
Lebesgue/measurable_Rbar.v
+44
-0
44 additions, 0 deletions
Lebesgue/measurable_Rbar.v
with
44 additions
and
0 deletions
Lebesgue/measurable_Rbar.v
+
44
−
0
View file @
42f1fbda
...
...
@@ -287,6 +287,50 @@ repeat apply measurable_union; easy.
rewrite
up_id_union_seq
;
apply
measurable_union_seq
;
easy
.
Qed
.
Inductive
Up_m_G
:
(
Rbar
->
Prop
)
->
Prop
:=
UG_m
:
forall
A
,
G
A
->
Up_m_G
(
up_m
A
).
Hypothesis
measurable_Up_m_G_singleton
:
forall
y
,
measurable
Up_m_G
(
singleton
y
).
Lemma
measurable_Rbar_gen_lub_up_m
:
Incl
(
measurable
G
)
(
fun
A
=>
measurable
Up_m_G
(
up_m
A
)).
Proof
.
intros
A
HA
;
induction
HA
as
[
A
HA
|
|
A
HA
|
A
HA1
HA2
].
apply
measurable_gen
;
easy
.
apply
measurable_union
;
try
easy
.
rewrite
up_id_empty
;
apply
measurable_empty
.
rewrite
up_m_compl
;
apply
measurable_compl
.
apply
measurable_union
;
try
easy
.
apply
measurable_ext
with
(
diff
(
up_m
A
)
(
singleton
m_infty
)).
Rbar_subset_full_unfold
;
intros
y
;
destruct
y
;
simpl
;
repeat
split
;
intros
;
try
easy
;
tauto
.
apply
measurable_diff
;
easy
.
rewrite
up_m_union_seq
;
apply
measurable_union_seq
;
easy
.
Qed
.
Inductive
Up_p_G
:
(
Rbar
->
Prop
)
->
Prop
:=
UG_p
:
forall
A
,
G
A
->
Up_p_G
(
up_p
A
).
Hypothesis
measurable_Up_p_G_singleton
:
forall
y
,
measurable
Up_p_G
(
singleton
y
).
Lemma
measurable_Rbar_gen_lub_up_p
:
Incl
(
measurable
G
)
(
fun
A
=>
measurable
Up_p_G
(
up_p
A
)).
Proof
.
intros
A
HA
;
induction
HA
as
[
A
HA
|
|
A
HA
|
A
HA1
HA2
].
apply
measurable_gen
;
easy
.
apply
measurable_union
;
try
easy
.
rewrite
up_id_empty
;
apply
measurable_empty
.
rewrite
up_p_compl
;
apply
measurable_compl
.
apply
measurable_union
;
try
easy
.
apply
measurable_ext
with
(
diff
(
up_p
A
)
(
singleton
p_infty
)).
Rbar_subset_full_unfold
;
intros
y
;
destruct
y
;
simpl
;
repeat
split
;
intros
;
try
easy
;
tauto
.
apply
measurable_diff
;
easy
.
rewrite
up_p_union_seq
;
apply
measurable_union_seq
;
easy
.
Qed
.
Inductive
Up_mp_G
:
(
Rbar
->
Prop
)
->
Prop
:=
UG_mp
:
forall
A
,
G
A
->
Up_mp_G
(
up_mp
A
).
...
...
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment