Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Adding essential supremum for extended reals #1361

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
22 changes: 22 additions & 0 deletions CHANGELOG_PR_ESS_SUP.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,22 @@
# Changelog (unreleased)

## [Unreleased]

### Added
- in `measure.v`:
+ definition `ess_supe`
+ lemma `ess_supe_ge0`

### Changed

### Renamed

### Generalized

### Deprecated

### Removed

### Infrastructure

### Misc
21 changes: 21 additions & 0 deletions theories/measure.v
Original file line number Diff line number Diff line change
Expand Up @@ -277,6 +277,8 @@ From HB Require Import structures.
(* m1 `<< m2 == m1 is absolutely continuous w.r.t. m2 or m2 dominates m1 *)
(* ess_sup f == essential supremum of the function f : T -> R where T is a *)
(* semiRingOfSetsType and R is a realType *)
(* ess_supe f == essential supremum of the function f : T -> \bar R where *)
(* T is a semiRingOfSetsType and R is a realType *)
(* ``` *)
(* *)
(******************************************************************************)
Expand Down Expand Up @@ -5264,3 +5266,22 @@ by apply/seteqP; split => // x _ /=; rewrite in_itv/= (lt_le_trans _ (f0 x)).
Qed.

End essential_supremum.

Section essential_supremum_ereal.
Context d {T : semiRingOfSetsType d} {R : realType}.
Variable mu : {measure set T -> \bar R}.
Implicit Types f : T -> \bar R.

Definition ess_supe f :=
ereal_inf ([set r | mu (f @^-1` `]r, +oo[) = 0]).

Lemma ess_supe_ge0 f : 0 < mu [set: T] -> (forall t, 0 <= f t) ->
Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

It looks like this should generalize easily to any a which is a lower bound on x. That is, ess_supe_ge0 a f : 0 < mu [set: T] -> (forall t, a <= f t) -> a <= ess_supe f. If it's easy to do that, we should. But definitely not a blocker.

0 <= ess_supe f.
Proof.
move=> muT f0; apply: lb_ereal_inf.
by case=> //= [r|] /eqP rf; rewrite leNgt;
apply/negP => r0; apply/negP : rf; rewrite gt_eqF// (_ : _ @^-1` _ = setT)//;
apply/seteqP; split => // x _ /=; rewrite in_itv/= (lt_le_trans _ (f0 x)).
Qed.

End essential_supremum_ereal.