Skip to content

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

Closed

Conversation

malarbol
Copy link
Collaborator

A lot of properties from #1378 follow the pattern

Σ ℕ (λ N  (n : ℕ)  leq-ℕ N n  X n)

This PR introduces this concept for sequences of types and a few applications: eventually equal sequences and eventually constant sequences.

Comment on lines 43 to 44
is-eventually-pointed-sequence : UU l
is-eventually-pointed-sequence = Σ ℕ is-modulus-eventually-pointed-sequence
Copy link
Collaborator

@fredrik-bakke fredrik-bakke Mar 26, 2025

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)

Copy link
Collaborator

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?

Copy link
Collaborator Author

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?

Copy link
Collaborator

@fredrik-bakke fredrik-bakke Mar 26, 2025

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 $n$ elements has $n!$ distinct ways of being counted, but you don't for instance distinguish between two 2-element sets by the order in which the elements are counted.

Copy link
Collaborator Author

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?

Copy link
Collaborator

@fredrik-bakke fredrik-bakke Mar 26, 2025

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.

Comment on lines +30 to +32
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`.
Copy link
Collaborator

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
Copy link
Collaborator

Choose a reason for hiding this comment

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

Suggested change
# Eventually constant sequences
# Moduli of eventually constant sequences


## Definitions

### Eventually constant sequences
Copy link
Collaborator

Choose a reason for hiding this comment

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

Suggested change
### Eventually constant sequences
### Moduli of eventually constant sequences

{l : Level} {A : UU l} (u : sequence A)
where

has-modulus-eventually-constant-sequence : UU l
Copy link
Collaborator

@fredrik-bakke fredrik-bakke Mar 26, 2025

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!"

Suggested change
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
Copy link
Collaborator

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
Copy link
Collaborator

Choose a reason for hiding this comment

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

Suggested change
### 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
Copy link
Collaborator

Choose a reason for hiding this comment

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

Suggested change
### 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??

Copy link
Collaborator

Choose a reason for hiding this comment

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

moduli-eventually-equal-sequences

Copy link
Collaborator

@fredrik-bakke fredrik-bakke left a 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

@malarbol
Copy link
Collaborator Author

Please implement my suggestions for all of the contributed files

Ok, I'll do my best. Do you have any suggestion for

  • eventually equal --> modulus of eventual equality
  • eventually constant --> modulus of eventual constancy
  • eventually pointed --> ??

@malarbol malarbol marked this pull request as draft March 28, 2025 16:28
@malarbol
Copy link
Collaborator Author

I'll just stall this PR and go back to sequences in posets. Although it's really tempting to compare values "for sufficiently large n" I think I lack the experience to identify the good concepts, etc. For example, maybe the eventual stuff should be defined for sequences ℕ → Prop l?

@fredrik-bakke
Copy link
Collaborator

Moduli of eventually constant sequences, moduli of eventually equal sequences, moduli of eventually pointed sequences of types

@malarbol malarbol closed this Apr 6, 2025
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

Successfully merging this pull request may close these issues.

2 participants