-
Notifications
You must be signed in to change notification settings - Fork 82
Eventually pointed sequences #1382
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
Conversation
is-eventually-pointed-sequence : UU l | ||
is-eventually-pointed-sequence = Σ ℕ is-modulus-eventually-pointed-sequence |
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.
This property(!) should be phrased with existential quantification. You can call the untruncated thing something like a bound-modulus-eventually-pointed-sequence
(open for suggestions)
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.
Actually, wouldn't this just be a modulus-eventually-pointed-sequence
?
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.
This property(!) should be phrased with existential quantification. You can call the untruncated thing something like a
bound-modulus-eventually-pointed-sequence
(open for suggestions)
As we've seen in #1378, there's still some debate (I think) on when to use dependent pairs vs existential quantifications. I'm starting with the easy version. Maybe the truncated things could me called is-merely-eventually-XXX
?
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.
You're free to use the easy version, I'm just saying that it does not deserve the name is-eventually-pointed-sequence
, and that a more fitting name for the thing you're defining is modulus-eventually-pointed-sequence
since every eventually pointed sequence is eventually pointed in an infinite number of distinct ways with your current definition. Doing arithmetic on the modulus is surely useful, and for that you will need the untruncated version. This is analogous to the distinction between finite types and counting in univalent combinatorics. A finite type with
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.
ok, what about has-modulus-eventually-pointed-sequence
?
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.
This file can be called moduli-eventually-constant-sequences
, leaving room for the eventual file (no pun intended)eventually-constant-sequences
, which should consider the proof theoretically correct notion of eventually constant sequences.
A [sequence](foundation.sequences.md) `u` is | ||
{{#concept "eventually constant" Disambiguation="sequence" Agda=has-modulus-eventually-constant-sequence}} | ||
if `u p = u q` for sufficiently large `p` and `q`. |
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.
Please update the idea section to instead define moduli of eventually constant sequences
@@ -0,0 +1,98 @@ | |||
# Eventually constant sequences |
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.
# Eventually constant sequences | |
# Moduli of eventually constant sequences |
|
||
## Definitions | ||
|
||
### Eventually constant sequences |
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.
### Eventually constant sequences | |
### Moduli of eventually constant sequences |
{l : Level} {A : UU l} (u : sequence A) | ||
where | ||
|
||
has-modulus-eventually-constant-sequence : UU l |
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.
Under your current definitions, you can't deduce that "an eventually constant sequence has a modulus" without a choice principle. By omitting the qualifier has
you avoid this hairy problem with semantics. "Of course you can't extract a choice of a modulus from an eventually constant sequence without choice!"
has-modulus-eventually-constant-sequence : UU l | |
modulus-eventually-constant-sequence : UU l |
This is analogous to how we say "countings of finite types" as opposed to "finite types have counting".
(λ p → has-modulus-eventually-pointed-sequence (λ q → u p = u q)) | ||
``` | ||
|
||
### The eventual value of an eventually constant sequence |
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 believe the standard nomenclature is to call this "eventual value" the "clustering point" or "asymptotic value". Please find a standard reference to follow for the terminology usage here.
|
||
## Properties | ||
|
||
### Constant sequences are eventually constant |
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.
### Constant sequences are eventually constant | |
### Moduli of eventual constancy of constant sequences |
(zero-ℕ , λ _ _ → refl) | ||
``` | ||
|
||
### An eventually constant sequence is eventually equal to the constant sequence of its eventual value |
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.
### An eventually constant sequence is eventually equal to the constant sequence of its eventual value | |
### A sequence with a modulus of eventual constancy has a modulus of eventual equality to the constant sequence of its ??asymptotic value?? |
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.
moduli-eventually-equal-sequences
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.
Please implement my suggestions for all of the contributed files
Ok, I'll do my best. Do you have any suggestion for
|
I'll just stall this PR and go back to sequences in posets. Although it's really tempting to compare values "for sufficiently large |
Moduli of eventually constant sequences, moduli of eventually equal sequences, moduli of eventually pointed sequences of types |
A lot of properties from #1378 follow the pattern
This PR introduces this concept for sequences of types and a few applications: eventually equal sequences and eventually constant sequences.