Transfinite iteration of a function I → I #
This file aims to define the transfinite iteration of a function φ : I → I, starting at a point
i₀ : I. Any reasonable definition must satisfy that iterate φ ⊥ i₀ = i₀ and
iterate φ (succ j) i₀ = φ (iterate φ j i₀). There are multiple ways to handle limit points; two
reasonable approaches are to take the suprema or infima of all previous values. We define these as
supTransfiniteIterate and infTransfiniteIterate.
If I is a complete lattice, we show that j ↦ supTransfiniteIterate φ j i₀ is a monotone function
if i ≤ φ i for all i, and dually for infTransfiniteIterate. Moreover, if i < φ i when
i ≠ ⊤, we show in the theorem top_mem_range_supTransfiniteIterate that there exists j : J such
that transfiniteIteration φ i₀ j = ⊤ if we assume that j ↦ transfiniteIterate φ i₀ j : J → I is
not injective (which shall hold when we know Cardinal.mk I < Cardinal.mk J).
TODO (@joelriou) #
- deduce that in a Grothendieck abelian category, there is a set
Iof monomorphisms such that any monomorphism is a transfinite composition of pushouts of morphisms inI, and then an objectXis injective iffX ⟶ 0has the right lifting property with respect toI.
The jth-iteration of a function φ : I → I when j : J belongs to a well-ordered type,
defined by taking suprema at limit points.
Equations
- One or more equations did not get rendered due to their size.
Instances For
The jth-iteration of a function φ : I → I when j : J belongs to a well-ordered type,
defined by taking infima at limit points.
Equations
- One or more equations did not get rendered due to their size.
Instances For
Alias of supTransfiniteIterate.
The jth-iteration of a function φ : I → I when j : J belongs to a well-ordered type,
defined by taking suprema at limit points.
Equations
Instances For
Alias of supTransfiniteIterate_bot.
Alias of supTransfiniteIterate_succ_of_not_isMax.
Alias of supTransfiniteIterate_limit.
Alias of supTransfiniteIterate_monotone.