Documentation

Mathlib.SetTheory.Cardinal.DirectLimit

Cardinality of direct limits #

This file gives upper and lower bounds for the cardinality of a direct limit of types.

Main statements #

theorem DirectLimit.mk_le_sum {ι : Type u} [Preorder ι] {F : ι → Type v} {T : ⦃i j : ι⦄ → i ≤ j → Sort w} (f : (i j : ι) → (h : i ≤ j) → T h) [⦃i j : ι⦄ → (h : i ≤ j) → FunLike (T h) (F i) (F j)] [DirectedSystem F fun (x1 x2 : ι) (x3 : x1 ≤ x2) => ⇑(f x1 x2 x3)] [IsDirectedOrder ι] :
Cardinal.mk (DirectLimit F fun (x1 x2 : ι) (x3 : x1 ≤ x2) => f x1 x2 x3) ≤ Cardinal.sum fun (i : ι) => Cardinal.mk (F i)

The cardinality of a direct limit is at most the sum of the cardinalities of its components.

theorem DirectLimit.mk_le_of_aleph0_le {ι : Type u} [Preorder ι] {F : ι → Type v} {T : ⦃i j : ι⦄ → i ≤ j → Sort w} (f : (i j : ι) → (h : i ≤ j) → T h) [⦃i j : ι⦄ → (h : i ≤ j) → FunLike (T h) (F i) (F j)] [DirectedSystem F fun (x1 x2 : ι) (x3 : x1 ≤ x2) => ⇑(f x1 x2 x3)] [IsDirectedOrder ι] (c : Cardinal.{max u v}) (hc : Cardinal.aleph0 ≤ c) (hι : Cardinal.lift.{v, u} (Cardinal.mk ι) ≤ c) (hF : ∀ (i : ι), Cardinal.lift.{u, v} (Cardinal.mk (F i)) ≤ c) :
Cardinal.mk (DirectLimit F fun (x1 x2 : ι) (x3 : x1 ≤ x2) => f x1 x2 x3) ≤ c

An infinite cardinal that bounds the cardinality of the index type and all components also bounds the cardinality of the direct limit.

theorem DirectLimit.mk_eq_iSup_lift_mk {ι : Type u} [Preorder ι] {F : ι → Type v} {T : ⦃i j : ι⦄ → i ≤ j → Sort w} (f : (i j : ι) → (h : i ≤ j) → T h) [⦃i j : ι⦄ → (h : i ≤ j) → FunLike (T h) (F i) (F j)] [DirectedSystem F fun (x1 x2 : ι) (x3 : x1 ≤ x2) => ⇑(f x1 x2 x3)] [IsDirectedOrder ι] (hι : Cardinal.lift.{v, u} (Cardinal.mk ι) ≤ ⨆ (i : ι), Cardinal.lift.{u, v} (Cardinal.mk (F i))) (h : ∀ (i : ι), Function.Injective fun (x : F i) => ⟦⟨i, x⟩⟧) :
Cardinal.mk (DirectLimit F fun (x1 x2 : ι) (x3 : x1 ≤ x2) => f x1 x2 x3) = ⨆ (i : ι), Cardinal.lift.{u, v} (Cardinal.mk (F i))

If all canonical maps into a direct limit are injective and the supremum of the component cardinalities is greater than the cardinality of the index type, then it equals the cardinality of the direct limit.

theorem DirectLimit.mk_eq_of_forall_lift_mk_eq {ι : Type u} [Preorder ι] {F : ι → Type v} {T : ⦃i j : ι⦄ → i ≤ j → Sort w} (f : (i j : ι) → (h : i ≤ j) → T h) [⦃i j : ι⦄ → (h : i ≤ j) → FunLike (T h) (F i) (F j)] [DirectedSystem F fun (x1 x2 : ι) (x3 : x1 ≤ x2) => ⇑(f x1 x2 x3)] [IsDirectedOrder ι] [Nonempty ι] (c : Cardinal.{max u v}) (hι : Cardinal.lift.{v, u} (Cardinal.mk ι) ≤ c) (hF : ∀ (i : ι), Cardinal.lift.{u, v} (Cardinal.mk (F i)) = c) (h : ∀ (i : ι), Function.Injective fun (x : F i) => ⟦⟨i, x⟩⟧) :
Cardinal.mk (DirectLimit F fun (x1 x2 : ι) (x3 : x1 ≤ x2) => f x1 x2 x3) = c

If all components have the same cardinality c, the cardinality of the index type is at most c, and all canonical maps are injective, then the direct limit also has cardinality c.