-
Notifications
You must be signed in to change notification settings - Fork 64
adherence value, extracted seq, limit point #1780
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
base: master
Are you sure you want to change the base?
Conversation
| Let A_nonempty x : A (N_ x) (idx_ x) !=set0. | ||
| Proof. by move: x => [[? ?]] []. Qed. | ||
|
|
||
| Let elt_rel i j := [/\ (idx_ j = (idx_ i).+1), |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
rm parentheses
| Qed. | ||
|
|
||
| Let adherence_value_cvg_direct : adherence_value u_ a -> | ||
| exists2 f : nat -> nat, increasing_seq f & (u_ \o f @ \oo --> a). |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
rm parentheses?
|
Note that Bolzano-Weierstrass is a direct consequence of these lemmas. |
| Qed. | ||
|
|
||
| Definition adherence_value {R : numDomainType} (u_ : R^nat) (a : R) := | ||
| forall (e : R) n, e > 0 -> exists2 p, (p >= n)%N & `|u_ p - a| <= e. |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
I am wondering if we would prefer a \in closure (range u_ : set R^o).
| Proof. | ||
| move=> A0. | ||
| pose B : set int := [set x%:~R | x in A]. | ||
| have B0 : B !=set0 by case: A0 => a Aa; exists a%:~R, a. |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
| have B0 : B !=set0 by case: A0 => a Aa; exists a%:~R, a. | |
| have B0 : B !=set0 by apply: image_nonempty. |
golfing
| have : lbound B 0 by move=> _ [b0 Bb0 <-]; rewrite ler0z. | ||
| move/(int_lbound_has_minimum B0) => [_ [[i Ai <-]]] Bi. | ||
| exists i; split => // k Bk. |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
| have : lbound B 0 by move=> _ [b0 Bb0 <-]; rewrite ler0z. | |
| move/(int_lbound_has_minimum B0) => [_ [[i Ai <-]]] Bi. | |
| exists i; split => // k Bk. | |
| have: lbound B 0 by move=> _ [b0 Bb0 <-]; rewrite ler0z. | |
| move/(int_lbound_has_minimum B0) => [_ [[i Ai <-]]] Bi. | |
| exists i; split=> // k Bk. |
How so? |
Motivation for this change
Checklist
CHANGELOG_UNRELEASED.mdReference: How to document
Merge policy
As a rule of thumb:
all compile are preferentially merged into master.
Reminder to reviewers