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

Sequences of positive rational numbers #1371

Open
wants to merge 39 commits into
base: master
Choose a base branch
from
Open
Show file tree
Hide file tree
Changes from 4 commits
Commits
Show all changes
39 commits
Select commit Hold shift + click to select a range
31363e0
arithmetic sequences of positive rational numbers
malarbol Mar 18, 2025
ae0afe4
fix typo
malarbol Mar 18, 2025
fe8c769
fix typo
malarbol Mar 18, 2025
b14aeda
fix name
malarbol Mar 19, 2025
1576dd8
fix link?
malarbol Mar 19, 2025
9ffa218
abstract equality n * p
malarbol Mar 19, 2025
4629d32
Revert "fix link?"
malarbol Mar 19, 2025
6286c11
geometric sequences of positive rational numbers
malarbol Mar 19, 2025
72472c4
asymptotical behaviour of geometric sequences
malarbol Mar 19, 2025
ff4a18d
fix links
malarbol Mar 19, 2025
0d3ca1a
abstract inequalities
malarbol Mar 19, 2025
94653a3
pre-commit
malarbol Mar 19, 2025
9f262c3
abstract
malarbol Mar 19, 2025
5eceeb8
WD entries
malarbol Mar 19, 2025
0777263
Update src/elementary-number-theory/arithmetic-sequences-positive-rat…
malarbol Mar 22, 2025
3e031fb
Update src/elementary-number-theory/arithmetic-sequences-positive-rat…
malarbol Mar 22, 2025
37854d3
abstract inequalities on positive rationals
malarbol Mar 22, 2025
43c638d
Merge branch 'master' into sequences-positive-rational-numbers
malarbol Mar 22, 2025
a0a2f95
arithmetic sequences in semigroups
malarbol Mar 22, 2025
212dfac
unused import
malarbol Mar 22, 2025
c3d153b
Merge branch 'master' into sequences-positive-rational-numbers
malarbol Mar 23, 2025
3e0f14e
homotopies arithmetic sequences semigroup
malarbol Mar 23, 2025
e9842e4
refactor definitions arithmetic/geometric sequences
malarbol Mar 23, 2025
75ffd47
typo
malarbol Mar 23, 2025
261532a
opaque unbounded arithmetic sequence Q+
malarbol Mar 23, 2025
6c1835d
cleanup
malarbol Mar 23, 2025
a22bff4
headers
malarbol Mar 23, 2025
f24f1d6
cleanup
malarbol Mar 23, 2025
3ffa834
no one-sentence paragraph
malarbol Mar 23, 2025
01ceb09
typo
malarbol Mar 23, 2025
d5a78f0
text bernoulli's inequality
malarbol Mar 23, 2025
435b562
definitions
malarbol Mar 23, 2025
c62c86a
fix space
malarbol Mar 23, 2025
f9b580c
remove unused imports
malarbol Mar 23, 2025
bee55a8
remove unused imports
malarbol Mar 23, 2025
9cb7ed7
Merge branch 'master' into sequences-positive-rational-numbers
malarbol Mar 23, 2025
8ccc9e8
Merge branch 'master' into sequences-positive-rational-numbers
malarbol Mar 24, 2025
513b4f7
better definitions
malarbol Mar 25, 2025
543daf7
Merge branch 'master' into sequences-positive-rational-numbers
malarbol Mar 25, 2025
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
1 change: 1 addition & 0 deletions src/elementary-number-theory.lagda.md
Original file line number Diff line number Diff line change
Expand Up @@ -23,6 +23,7 @@ open import elementary-number-theory.archimedean-property-natural-numbers public
open import elementary-number-theory.archimedean-property-positive-rational-numbers public
open import elementary-number-theory.archimedean-property-rational-numbers public
open import elementary-number-theory.arithmetic-functions public
open import elementary-number-theory.arithmetic-sequences-positive-rational-numbers public
open import elementary-number-theory.based-induction-natural-numbers public
open import elementary-number-theory.based-strong-induction-natural-numbers public
open import elementary-number-theory.bell-numbers public
Expand Down
10 changes: 10 additions & 0 deletions src/elementary-number-theory/addition-rational-numbers.lagda.md
Original file line number Diff line number Diff line change
Expand Up @@ -13,6 +13,7 @@ open import elementary-number-theory.addition-integer-fractions
open import elementary-number-theory.addition-integers
open import elementary-number-theory.integer-fractions
open import elementary-number-theory.integers
open import elementary-number-theory.natural-numbers
open import elementary-number-theory.rational-numbers
open import elementary-number-theory.reduced-integer-fractions

Expand Down Expand Up @@ -276,6 +277,15 @@ abstract
succ-rational-ℤ = add-rational-ℤ one-ℤ
```

### The rational successor of a natural number is the successor of the natural number

```agda
abstract
succ-rational-ℕ : (x : ℕ) → succ-ℚ (rational-ℕ x) = rational-ℕ (succ-ℕ x)
succ-rational-ℕ x =
succ-rational-ℤ (int-ℕ x) ∙ ap rational-ℤ (succ-int-ℕ x)
```

## See also

- The additive group structure on the rational numbers is defined in
Expand Down
Original file line number Diff line number Diff line change
@@ -0,0 +1,337 @@
# Arithmetic sequences of positive rational numbers

```agda
{-# OPTIONS --lossy-unification #-}

module elementary-number-theory.arithmetic-sequences-positive-rational-numbers where
```

<details><summary>Imports</summary>

```agda
open import elementary-number-theory.addition-rational-numbers
open import elementary-number-theory.additive-group-of-rational-numbers
open import elementary-number-theory.archimedean-property-rational-numbers
open import elementary-number-theory.inequality-rational-numbers
open import elementary-number-theory.integers
open import elementary-number-theory.multiplication-rational-numbers
open import elementary-number-theory.natural-numbers
open import elementary-number-theory.positive-rational-numbers
open import elementary-number-theory.rational-numbers
open import elementary-number-theory.strict-inequality-rational-numbers

open import foundation.action-on-identifications-functions
open import foundation.binary-transport
open import foundation.dependent-pair-types
open import foundation.function-types
open import foundation.functoriality-dependent-pair-types
open import foundation.identity-types
open import foundation.sequences
open import foundation.transport-along-identifications
open import foundation.universe-levels

open import group-theory.powers-of-elements-monoids
```

</details>

## Idea

The
{{#concept "arithmetic sequence" Disambiguation="of positive rational numbers" Agda="arithmetic-sequence-ℚ⁺"}}
of positive rational numbers with initial term `(a : ℚ⁺)` and common difference
`(d : ℚ⁺)` is the sequence `u : ℕ → ℚ⁺` characterized by

- `u₀ = a`
- `∀ (n : ℕ) uₙ₊₁ = uₙ + d`.

The terms of an arithmetic sequence of positive rational numbers have no greater
element.

## Definitions

### Preliminary definition

```agda
module _
(d : ℚ⁺)
where

power-add-ℚ⁺ : sequence ℚ
power-add-ℚ⁺ n = power-Monoid monoid-add-ℚ n (rational-ℚ⁺ d)

lemma-leq-power-add-ℚ⁺ :
(n : ℕ) → leq-ℚ zero-ℚ (power-add-ℚ⁺ n)
lemma-leq-power-add-ℚ⁺ zero-ℕ = refl-leq-ℚ zero-ℚ
lemma-leq-power-add-ℚ⁺ (succ-ℕ n) =
transitive-leq-ℚ
( zero-ℚ)
( power-Monoid monoid-add-ℚ n (rational-ℚ⁺ d))
( power-Monoid monoid-add-ℚ (succ-ℕ n) (rational-ℚ⁺ d))
( inv-tr
( leq-ℚ (power-add-ℚ⁺ n))
( power-succ-Monoid monoid-add-ℚ n (rational-ℚ⁺ d))
( leq-le-ℚ
{ power-add-ℚ⁺ n}
{add-ℚ (power-add-ℚ⁺ n) (rational-ℚ⁺ d)}
( le-right-add-rational-ℚ⁺
( power-add-ℚ⁺ n)
( d))))
( lemma-leq-power-add-ℚ⁺ n)
```

### Arithmetic sequences of positive rational numbers

```agda
module _
(a d : ℚ⁺)
where

rational-arithmetic-sequence-ℚ⁺ : sequence ℚ
rational-arithmetic-sequence-ℚ⁺ = add-ℚ (rational-ℚ⁺ a) ∘ power-add-ℚ⁺ d

is-positive-rational-arithmetic-sequence-ℚ⁺ :
(n : ℕ) → is-positive-ℚ (rational-arithmetic-sequence-ℚ⁺ n)
is-positive-rational-arithmetic-sequence-ℚ⁺ n =
is-positive-le-zero-ℚ
( (rational-ℚ⁺ a) +ℚ (power-add-ℚ⁺ d n))
( concatenate-leq-le-ℚ
( zero-ℚ)
( power-Monoid monoid-add-ℚ n (rational-ℚ⁺ d))
( rational-ℚ⁺ a +ℚ power-Monoid monoid-add-ℚ n (rational-ℚ⁺ d))
( lemma-leq-power-add-ℚ⁺ d n)
( le-left-add-rational-ℚ⁺
( power-Monoid monoid-add-ℚ n (rational-ℚ⁺ d))
( a)))

arithmetic-sequence-ℚ⁺ : sequence ℚ⁺
arithmetic-sequence-ℚ⁺ n =
( rational-arithmetic-sequence-ℚ⁺ n) ,
( is-positive-rational-arithmetic-sequence-ℚ⁺ n)
```

### Unitary arithmetic sequences of rational numbers

An arithmetic sequence with initial term equal to `1` is called unitary

```agda
module _
(d : ℚ⁺)
where

unitary-arithmetic-sequence-ℚ⁺ : sequence ℚ⁺
unitary-arithmetic-sequence-ℚ⁺ = arithmetic-sequence-ℚ⁺ one-ℚ⁺ d
```

## Properties

### `u₀ = a`

```agda
module _
(a d : ℚ⁺)
where

abstract
eq-init-arithmetic-sequence-ℚ⁺ :
arithmetic-sequence-ℚ⁺ a d zero-ℕ = a
eq-init-arithmetic-sequence-ℚ⁺ =
eq-ℚ⁺ (right-unit-law-add-ℚ (rational-ℚ⁺ a))
```

### `uₙ₊₁ = uₙ + d`

```agda
module _
(a d : ℚ⁺)
where

abstract
eq-succ-arithmetic-sequence-ℚ⁺ :
( n : ℕ) →
( arithmetic-sequence-ℚ⁺ a d (succ-ℕ n)) =
( arithmetic-sequence-ℚ⁺ a d n +ℚ⁺ d)
eq-succ-arithmetic-sequence-ℚ⁺ n =
eq-ℚ⁺
( ( ap
( add-ℚ (rational-ℚ⁺ a))
( power-succ-Monoid monoid-add-ℚ n (rational-ℚ⁺ d))) ∙
( inv
(associative-add-ℚ
( rational-ℚ⁺ a)
( power-add-ℚ⁺ d n)
( rational-ℚ⁺ d))))
```

### The nth term of an arithmetic sequence with initial term `a` and common difference `d` is `a + n d`

```agda
module _
(a d : ℚ⁺) (n : ℕ)
where

abstract
compute-arithmetic-sequence-ℚ⁺ :
( rational-ℚ⁺ a +ℚ rational-ℕ n *ℚ rational-ℚ⁺ d) =
( rational-arithmetic-sequence-ℚ⁺ a d n)
compute-arithmetic-sequence-ℚ⁺ =
ap
( add-ℚ (rational-ℚ⁺ a))
( compute-power-monoid-add-ℚ n (rational-ℚ⁺ d))
```

### An arithmetic sequence of positive rational numbers is strictly increasing

```agda
module _
(a d : ℚ⁺) (n : ℕ)
where

is-strictly-increasing-arithmetic-sequence-ℚ⁺ :
le-ℚ⁺
( arithmetic-sequence-ℚ⁺ a d n)
( arithmetic-sequence-ℚ⁺ a d (succ-ℕ n))
is-strictly-increasing-arithmetic-sequence-ℚ⁺ =
inv-tr
( le-ℚ⁺ (arithmetic-sequence-ℚ⁺ a d n))
( eq-succ-arithmetic-sequence-ℚ⁺ a d n)
( le-right-add-rational-ℚ⁺
( rational-ℚ⁺ (arithmetic-sequence-ℚ⁺ a d n))
( d))
```

### The terms of an arithmetic sequence of positive rational numbers are greater than or equal to its initial term

```agda
module _
(a d : ℚ⁺)
where

leq-init-arithmetic-sequence-ℚ⁺ :
(n : ℕ) → leq-ℚ⁺ a (arithmetic-sequence-ℚ⁺ a d n)
leq-init-arithmetic-sequence-ℚ⁺ zero-ℕ =
inv-tr
( leq-ℚ⁺ a)
( eq-init-arithmetic-sequence-ℚ⁺ a d)
( refl-leq-ℚ (rational-ℚ⁺ a))
leq-init-arithmetic-sequence-ℚ⁺ (succ-ℕ n) =
transitive-leq-ℚ
( rational-ℚ⁺ a)
( rational-ℚ⁺ (arithmetic-sequence-ℚ⁺ a d n))
( rational-ℚ⁺ (arithmetic-sequence-ℚ⁺ a d (succ-ℕ n)))
( leq-le-ℚ
{ rational-ℚ⁺ (arithmetic-sequence-ℚ⁺ a d n)}
{ rational-ℚ⁺ (arithmetic-sequence-ℚ⁺ a d (succ-ℕ n))}
( is-strictly-increasing-arithmetic-sequence-ℚ⁺ a d n))
( leq-init-arithmetic-sequence-ℚ⁺ n)
```

### An arithmetic sequence of positive rational numbers has no upper bound

```agda
module _
(a d : ℚ⁺)
where

unbounded-arithmetic-sequence-ℚ⁺ :
(M : ℚ⁺) → Σ ℕ (le-ℚ⁺ M ∘ arithmetic-sequence-ℚ⁺ a d)
unbounded-arithmetic-sequence-ℚ⁺ M =
tot
( tr-archimidean-bound)
( bound-archimedean-property-ℚ
( rational-ℚ⁺ d)
( rational-ℚ⁺ M)
( is-positive-rational-ℚ⁺ d))
where
tr-archimidean-bound :
(n : ℕ) (I : le-ℚ (rational-ℚ⁺ M) (rational-ℕ n *ℚ (rational-ℚ⁺ d))) →
le-ℚ⁺ M (arithmetic-sequence-ℚ⁺ a d n)
tr-archimidean-bound n I =
tr
( le-ℚ (rational-ℚ⁺ M))
( compute-arithmetic-sequence-ℚ⁺ a d n)
( transitive-le-ℚ
( rational-ℚ⁺ M)
( rational-ℕ n *ℚ rational-ℚ⁺ d)
( (rational-ℚ⁺ a) +ℚ rational-ℕ n *ℚ rational-ℚ⁺ d)
( le-left-add-rational-ℚ⁺
( rational-ℕ n *ℚ rational-ℚ⁺ d)
( a))
( I))
```

### The ratio of two consecutive terms of a unitary arithmetic sequence is bounded

The terms of a unitary arithmetic sequence with common difference `d` satisfy
`uₙ₊₁/uₙ ≤ 1 + d`; we prove the equivalent inequality `uₙ₊₁ ≤ uₙ (1 + d)`.

```agda
module _
(d : ℚ⁺)
where

bounded-ratio-unitary-arithmetic-sequence-ℚ⁺ :
(n : ℕ) →
leq-ℚ⁺
( unitary-arithmetic-sequence-ℚ⁺ d (succ-ℕ n))
( mul-ℚ⁺
( unitary-arithmetic-sequence-ℚ⁺ d n)
( one-ℚ⁺ +ℚ⁺ d))
bounded-ratio-unitary-arithmetic-sequence-ℚ⁺ n =
binary-tr
( leq-ℚ⁺)
( inv (eq-succ-arithmetic-sequence-ℚ⁺ one-ℚ⁺ d n))
( inv rhs)
( H)
where

rhs :
( mul-ℚ⁺
( unitary-arithmetic-sequence-ℚ⁺ d n)
( one-ℚ⁺ +ℚ⁺ d)) =
( add-ℚ⁺
( unitary-arithmetic-sequence-ℚ⁺ d n)
( unitary-arithmetic-sequence-ℚ⁺ d n *ℚ⁺ d))
rhs =
eq-ℚ⁺
( ( left-distributive-mul-add-ℚ
( rational-arithmetic-sequence-ℚ⁺ one-ℚ⁺ d n)
( one-ℚ)
( rational-ℚ⁺ d)) ∙
( ap
( λ x →
add-ℚ
( x)
(rational-arithmetic-sequence-ℚ⁺ one-ℚ⁺ d n *ℚ rational-ℚ⁺ d))
( right-unit-law-mul-ℚ
(rational-arithmetic-sequence-ℚ⁺ one-ℚ⁺ d n))))
H :
leq-ℚ⁺
( add-ℚ⁺
( unitary-arithmetic-sequence-ℚ⁺ d n)
( d))
( add-ℚ⁺
( unitary-arithmetic-sequence-ℚ⁺ d n)
( unitary-arithmetic-sequence-ℚ⁺ d n *ℚ⁺ d))
H =
preserves-leq-right-add-ℚ
( rational-arithmetic-sequence-ℚ⁺ one-ℚ⁺ d n)
( rational-ℚ⁺ d)
( rational-arithmetic-sequence-ℚ⁺ one-ℚ⁺ d n *ℚ rational-ℚ⁺ d)
( tr
( λ x →
leq-ℚ
( x)
( rational-arithmetic-sequence-ℚ⁺ one-ℚ⁺ d n *ℚ rational-ℚ⁺ d))
( left-unit-law-mul-ℚ (rational-ℚ⁺ d))
( preserves-leq-right-mul-ℚ⁺
( d)
( one-ℚ)
( rational-arithmetic-sequence-ℚ⁺ one-ℚ⁺ d n)
( leq-init-arithmetic-sequence-ℚ⁺ one-ℚ⁺ d n)))
```

## References

- [Arithmetic progressions](https://en.wikipedia.org/wiki/Arithmetic_progression)
at Wikipedia
Loading
Loading