Add monotone_of_tendsto and monotone_of_tendsto_of_eventually lemmas - #6
Closed
CoolRmal wants to merge 1 commit into
Closed
Add monotone_of_tendsto and monotone_of_tendsto_of_eventually lemmas#6CoolRmal wants to merge 1 commit into
monotone_of_tendsto and monotone_of_tendsto_of_eventually lemmas#6CoolRmal wants to merge 1 commit into
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Motivation
Monotone ffrom a familyF iwhich is eventually monotone (or eachF iis monotone) and converges pointwise tof, so monotonicity can be transferred from approximating nets to the limit.Description
@[to_dual] theorem monotone_of_tendsto_of_eventuallyand@[to_dual] theorem monotone_of_tendstotoMathlib/Topology/Order/MonotoneConvergence.lean, which inferMonotone ffrom eventual order-preservation ofFalong a nontrivial filterl(or from eachF ibeingMonotone) together withTendsto (fun i => F i a) l (𝓝 (f a))for everya, and prove the result viatendsto_le_of_eventuallyLE.Testing
Codex Task