Documentation

Mathlib.SetTheory.Cardinal.Free

Cardinalities of free constructions #

This file shows that all the free constructions over α have cardinality max #α ℵ₀, and are thus infinite, and specifically countable over countable generators.

Combined with the ring Fin n for the finite cases, this lets us show that there is a CommRing of any cardinality.

@[implicit_reducible]
instance instInfiniteFreeRing (α✝ : Type u_1) :
@[implicit_reducible]
instance instInfiniteFreeCommRing (α✝ : Type u_1) :
@[simp]
theorem Cardinal.mk_freeMonoid (α : Type u) [Nonempty α] :
mk (FreeMonoid α) = max (mk α) aleph0
@[simp]
theorem Cardinal.mk_freeAddMonoid (α : Type u) [Nonempty α] :
@[simp]
theorem Cardinal.mk_freeGroup (α : Type u) [Nonempty α] :
mk (FreeGroup α) = max (mk α) aleph0
@[simp]
theorem Cardinal.mk_freeAddGroup (α : Type u) [Nonempty α] :
@[simp]
theorem Cardinal.mk_freeAbelianGroup (α : Type u) [Nonempty α] :
@[simp]
theorem Cardinal.mk_freeRing (α : Type u) :
mk (FreeRing α) = max (mk α) aleph0
instance nonempty_commRing (α : Type u) [Nonempty α] :
Nonempty (CommRing α)

A commutative ring can be constructed on any non-empty type.

See also Infinite.nonempty_field.

@[simp]
theorem nonempty_commRing_iff (α : Type u) :
Nonempty (CommRing α) Nonempty α
@[simp]
theorem nonempty_ring_iff (α : Type u) :
Nonempty (Ring α) Nonempty α
@[simp]
theorem nonempty_commSemiring_iff (α : Type u) :
Nonempty (CommSemiring α) Nonempty α
@[simp]
theorem nonempty_semiring_iff (α : Type u) :
Nonempty (Semiring α) Nonempty α