Free abelian groups

The free abelian group on a type α, defined as the abelianisation of the free group on α.

The free abelian group on α can be abstractly defined as the left adjoint of the forgetful functor from abelian groups to types. Alternatively, one could define it as the functions α → ℤ which send all but finitely many (a : α) to 0, under pointwise addition. In this file, it is defined as the abelianisation of the free group on α. All the constructions and theorems required to show the adjointness of the construction and the forgetful functor are proved in this file, but the category-theoretic adjunction statement is in Algebra.Category.Group.Adjunctions.

Main definitions

Here we use the following variables: (α β : Type*) (A : Type*) [AddCommGroup A]

• FreeAbelianGroup α : the free abelian group on a type α. As an abelian group it is α →₀ ℤ, the functions from α to ℤ such that all but finitely many elements get mapped to zero, however this is not how it is implemented.

• lift f : FreeAbelianGroup α →+ A : the group homomorphism induced by the map f : α → A.

• map (f : α → β) : FreeAbelianGroup α →+ FreeAbelianGroup β : functoriality of FreeAbelianGroup.

• instance [Monoid α] : Semigroup (FreeAbelianGroup α)

• instance [CommMonoid α] : CommRing (FreeAbelianGroup α)

It has been suggested that we would be better off refactoring this file and using Finsupp instead.

Implementation issues

The definition is def FreeAbelianGroup : Type u := Additive <| Abelianization <| FreeGroup α.

Chris Hughes has suggested that this all be rewritten in terms of Finsupp. Johan Commelin has written all the API relating the definition to Finsupp in the lean-liquid repo.

The lemmas map_pure, map_of, map_zero, map_add, map_neg and map_sub are proved about the Functor.map <$> construction, and need α and β to be in the same universe. But FreeAbelianGroup.map (f : α → β) is defined to be the AddGroup homomorphism FreeAbelianGroup α →+ FreeAbelianGroup β (with α and β now allowed to be in different universes), so (map f).map_add etc can be used to prove that FreeAbelianGroup.map preserves addition. The functions map_id, map_id_apply, map_comp, map_comp_apply and map_of_apply are about FreeAbelianGroup.map.

def FreeAbelianGroup (α : Type u) : Type u

The free abelian group on a type.

Equations

• FreeAbelianGroup α = Additive (Abelianization (FreeGroup α))

instance FreeAbelianGroup.addCommGroup (α : Type u) : AddCommGroup (FreeAbelianGroup α)

Equations

• FreeAbelianGroup.addCommGroup α = Additive.addCommGroup

instance instInhabitedFreeAbelianGroup (α : Type u) : Inhabited (FreeAbelianGroup α)

Equations

• instInhabitedFreeAbelianGroup α = { default := 0 }

instance instUniqueFreeAbelianGroupOfIsEmpty (α : Type u) [IsEmpty α] : Unique (FreeAbelianGroup α)

Equations

• instUniqueFreeAbelianGroupOfIsEmpty α = id inferInstance

def FreeAbelianGroup.of {α : Type u} (x : α) : FreeAbelianGroup α

The canonical map from α to FreeAbelianGroup α.

Equations

• FreeAbelianGroup.of x = Additive.ofMul (Abelianization.of (FreeGroup.of x))

def FreeAbelianGroup.lift {α : Type u} {β : Type v} [AddCommGroup β] : (α → β) ≃ (FreeAbelianGroup α →+ β)

The map FreeAbelianGroup α →+ A induced by a map of types α → A.

Equations

• FreeAbelianGroup.lift = FreeGroup.lift.trans (Abelianization.lift.trans MonoidHom.toAdditive)

@[simp]

theorem FreeAbelianGroup.lift.of {α : Type u} {β : Type v} [AddCommGroup β] (f : α → β) (x : α) : (FreeAbelianGroup.lift f) (FreeAbelianGroup.of x) = f x

theorem FreeAbelianGroup.lift.unique {α : Type u} {β : Type v} [AddCommGroup β] (f : α → β) (g : FreeAbelianGroup α →+ β) (hg : ∀ (x : α), g (FreeAbelianGroup.of x) = f x) {x : FreeAbelianGroup α} : g x = (FreeAbelianGroup.lift f) x

theorem FreeAbelianGroup.lift.ext_iff {α : Type u} {β : Type v} [AddCommGroup β] {g : FreeAbelianGroup α →+ β} {h : FreeAbelianGroup α →+ β} : g = h ↔ ∀ (x : α), g (FreeAbelianGroup.of x) = h (FreeAbelianGroup.of x)

theorem FreeAbelianGroup.lift.ext {α : Type u} {β : Type v} [AddCommGroup β] (g : FreeAbelianGroup α →+ β) (h : FreeAbelianGroup α →+ β) (H : ∀ (x : α), g (FreeAbelianGroup.of x) = h (FreeAbelianGroup.of x)) : g = h

See note [partially-applied ext lemmas].

theorem FreeAbelianGroup.lift.map_hom {α : Type u_1} {β : Type u_2} {γ : Type u_3} [AddCommGroup β] [AddCommGroup γ] (a : FreeAbelianGroup α) (f : α → β) (g : β →+ γ) : g ((FreeAbelianGroup.lift f) a) = (FreeAbelianGroup.lift (⇑g ∘ f)) a

theorem FreeAbelianGroup.of_injective {α : Type u} : Function.Injective FreeAbelianGroup.of

@[simp]

theorem FreeAbelianGroup.of_ne_zero {α : Type u} (x : α) : FreeAbelianGroup.of x ≠ 0

@[simp]

theorem FreeAbelianGroup.zero_ne_of {α : Type u} (x : α) : 0 ≠ FreeAbelianGroup.of x

instance FreeAbelianGroup.instNontrivialOfNonempty {α : Type u} [Nonempty α] : Nontrivial (FreeAbelianGroup α)

Equations

• ⋯ = ⋯

theorem FreeAbelianGroup.induction_on {α : Type u} {C : FreeAbelianGroup α → Prop} (z : FreeAbelianGroup α) (C0 : C 0) (C1 : ∀ (x : α), C (FreeAbelianGroup.of x)) (Cn : ∀ (x : α), C (FreeAbelianGroup.of x) → C (-FreeAbelianGroup.of x)) (Cp : ∀ (x y : FreeAbelianGroup α), C x → C y → C (x + y)) : C z

theorem FreeAbelianGroup.lift.add' {α : Type u_1} {β : Type u_2} [AddCommGroup β] (a : FreeAbelianGroup α) (f : α → β) (g : α → β) : (FreeAbelianGroup.lift (f + g)) a = (FreeAbelianGroup.lift f) a + (FreeAbelianGroup.lift g) a

@[simp]

theorem FreeAbelianGroup.liftAddGroupHom_apply {α : Type u_1} (β : Type u_2) [AddCommGroup β] (a : FreeAbelianGroup α) (f : α → β) : (FreeAbelianGroup.liftAddGroupHom β a) f = (FreeAbelianGroup.lift f) a

def FreeAbelianGroup.liftAddGroupHom {α : Type u_1} (β : Type u_2) [AddCommGroup β] (a : FreeAbelianGroup α) : (α → β) →+ β

If g : FreeAbelianGroup X and A is an abelian group then liftAddGroupHom g is the additive group homomorphism sending a function X → A to the term of type A corresponding to the evaluation of the induced map FreeAbelianGroup X → A at g.

Equations

• FreeAbelianGroup.liftAddGroupHom β a = AddMonoidHom.mk' (fun (f : α → β) => (FreeAbelianGroup.lift f) a) ⋯

theorem FreeAbelianGroup.lift_neg' {α : Type u} {β : Type u_1} [AddCommGroup β] (f : α → β) : FreeAbelianGroup.lift (-f) = -FreeAbelianGroup.lift f

instance FreeAbelianGroup.instMonad : Monad FreeAbelianGroup

Equations

• FreeAbelianGroup.instMonad = Monad.mk

theorem FreeAbelianGroup.induction_on' {α : Type u} {C : FreeAbelianGroup α → Prop} (z : FreeAbelianGroup α) (C0 : C 0) (C1 : ∀ (x : α), C (pure x)) (Cn : ∀ (x : α), C (pure x) → C (-pure x)) (Cp : ∀ (x y : FreeAbelianGroup α), C x → C y → C (x + y)) : C z

@[simp]

theorem FreeAbelianGroup.map_pure {α : Type u} {β : Type u} (f : α → β) (x : α) : f <$> pure x = pure (f x)

@[simp]

theorem FreeAbelianGroup.map_zero {α : Type u} {β : Type u} (f : α → β) : f <$> 0 = 0

@[simp]

theorem FreeAbelianGroup.map_add {α : Type u} {β : Type u} (f : α → β) (x : FreeAbelianGroup α) (y : FreeAbelianGroup α) : f <$> (x + y) = f <$> x + f <$> y

@[simp]

theorem FreeAbelianGroup.map_neg {α : Type u} {β : Type u} (f : α → β) (x : FreeAbelianGroup α) : f <$> (-x) = -f <$> x

@[simp]

theorem FreeAbelianGroup.map_sub {α : Type u} {β : Type u} (f : α → β) (x : FreeAbelianGroup α) (y : FreeAbelianGroup α) : f <$> (x - y) = f <$> x - f <$> y

@[simp]

theorem FreeAbelianGroup.map_of {α : Type u} {β : Type u} (f : α → β) (y : α) : f <$> FreeAbelianGroup.of y = FreeAbelianGroup.of (f y)

theorem FreeAbelianGroup.pure_bind {α : Type u} {β : Type u} (f : α → FreeAbelianGroup β) (x : α) : pure x >>= f = f x

@[simp]

theorem FreeAbelianGroup.zero_bind {α : Type u} {β : Type u} (f : α → FreeAbelianGroup β) : 0 >>= f = 0

@[simp]

theorem FreeAbelianGroup.add_bind {α : Type u} {β : Type u} (f : α → FreeAbelianGroup β) (x : FreeAbelianGroup α) (y : FreeAbelianGroup α) : x + y >>= f = (x >>= f) + (y >>= f)

@[simp]

theorem FreeAbelianGroup.neg_bind {α : Type u} {β : Type u} (f : α → FreeAbelianGroup β) (x : FreeAbelianGroup α) : -x >>= f = -(x >>= f)

@[simp]

theorem FreeAbelianGroup.sub_bind {α : Type u} {β : Type u} (f : α → FreeAbelianGroup β) (x : FreeAbelianGroup α) (y : FreeAbelianGroup α) : x - y >>= f = (x >>= f) - (y >>= f)

@[simp]

theorem FreeAbelianGroup.pure_seq {α : Type u} {β : Type u} (f : α → β) (x : FreeAbelianGroup α) : (Seq.seq (pure f) fun (x_1 : Unit) => x) = f <$> x

@[simp]

theorem FreeAbelianGroup.zero_seq {α : Type u} {β : Type u} (x : FreeAbelianGroup α) : (Seq.seq 0 fun (x_1 : Unit) => x) = 0

@[simp]

theorem FreeAbelianGroup.add_seq {α : Type u} {β : Type u} (f : FreeAbelianGroup (α → β)) (g : FreeAbelianGroup (α → β)) (x : FreeAbelianGroup α) : (Seq.seq (f + g) fun (x_1 : Unit) => x) = (Seq.seq f fun (x_1 : Unit) => x) + Seq.seq g fun (x_1 : Unit) => x

@[simp]

theorem FreeAbelianGroup.neg_seq {α : Type u} {β : Type u} (f : FreeAbelianGroup (α → β)) (x : FreeAbelianGroup α) : (Seq.seq (-f) fun (x_1 : Unit) => x) = -Seq.seq f fun (x_1 : Unit) => x

@[simp]

theorem FreeAbelianGroup.sub_seq {α : Type u} {β : Type u} (f : FreeAbelianGroup (α → β)) (g : FreeAbelianGroup (α → β)) (x : FreeAbelianGroup α) : (Seq.seq (f - g) fun (x_1 : Unit) => x) = (Seq.seq f fun (x_1 : Unit) => x) - Seq.seq g fun (x_1 : Unit) => x

def FreeAbelianGroup.seqAddGroupHom {α : Type u} {β : Type u} (f : FreeAbelianGroup (α → β)) : FreeAbelianGroup α →+ FreeAbelianGroup β

If f : FreeAbelianGroup (α → β), then f <*> is an additive morphism FreeAbelianGroup α →+ FreeAbelianGroup β.

Equations

• f.seqAddGroupHom = AddMonoidHom.mk' (fun (x : FreeAbelianGroup α) => Seq.seq f fun (x_1 : Unit) => x) ⋯

@[simp]

theorem FreeAbelianGroup.seq_zero {α : Type u} {β : Type u} (f : FreeAbelianGroup (α → β)) : (Seq.seq f fun (x : Unit) => 0) = 0

@[simp]

theorem FreeAbelianGroup.seq_add {α : Type u} {β : Type u} (f : FreeAbelianGroup (α → β)) (x : FreeAbelianGroup α) (y : FreeAbelianGroup α) : (Seq.seq f fun (x_1 : Unit) => x + y) = (Seq.seq f fun (x_1 : Unit) => x) + Seq.seq f fun (x : Unit) => y

@[simp]

theorem FreeAbelianGroup.seq_neg {α : Type u} {β : Type u} (f : FreeAbelianGroup (α → β)) (x : FreeAbelianGroup α) : (Seq.seq f fun (x_1 : Unit) => -x) = -Seq.seq f fun (x_1 : Unit) => x

@[simp]

theorem FreeAbelianGroup.seq_sub {α : Type u} {β : Type u} (f : FreeAbelianGroup (α → β)) (x : FreeAbelianGroup α) (y : FreeAbelianGroup α) : (Seq.seq f fun (x_1 : Unit) => x - y) = (Seq.seq f fun (x_1 : Unit) => x) - Seq.seq f fun (x : Unit) => y

instance FreeAbelianGroup.instLawfulMonad : LawfulMonad FreeAbelianGroup

Equations

• FreeAbelianGroup.instLawfulMonad = ⋯

instance FreeAbelianGroup.instCommApplicative : CommApplicative FreeAbelianGroup

Equations

• FreeAbelianGroup.instCommApplicative = ⋯

def FreeAbelianGroup.map {α : Type u} {β : Type v} (f : α → β) : FreeAbelianGroup α →+ FreeAbelianGroup β

The additive group homomorphism FreeAbelianGroup α →+ FreeAbelianGroup β induced from a map α → β.

Equations

• FreeAbelianGroup.map f = FreeAbelianGroup.lift (FreeAbelianGroup.of ∘ f)

theorem FreeAbelianGroup.lift_comp {α : Type u_1} {β : Type u_2} {γ : Type u_3} [AddCommGroup γ] (f : α → β) (g : β → γ) (x : FreeAbelianGroup α) : (FreeAbelianGroup.lift (g ∘ f)) x = (FreeAbelianGroup.lift g) ((FreeAbelianGroup.map f) x)

theorem FreeAbelianGroup.map_id {α : Type u} : FreeAbelianGroup.map id = AddMonoidHom.id (FreeAbelianGroup α)

theorem FreeAbelianGroup.map_id_apply {α : Type u} (x : FreeAbelianGroup α) : (FreeAbelianGroup.map id) x = x

theorem FreeAbelianGroup.map_comp {α : Type u} {β : Type v} {γ : Type w} {f : α → β} {g : β → γ} : FreeAbelianGroup.map (g ∘ f) = (FreeAbelianGroup.map g).comp (FreeAbelianGroup.map f)

theorem FreeAbelianGroup.map_comp_apply {α : Type u} {β : Type v} {γ : Type w} {f : α → β} {g : β → γ} (x : FreeAbelianGroup α) : (FreeAbelianGroup.map (g ∘ f)) x = (FreeAbelianGroup.map g) ((FreeAbelianGroup.map f) x)

@[simp]

theorem FreeAbelianGroup.map_of_apply {α : Type u} {β : Type v} {f : α → β} (a : α) : (FreeAbelianGroup.map f) (FreeAbelianGroup.of a) = FreeAbelianGroup.of (f a)

instance FreeAbelianGroup.mul (α : Type u) [Mul α] : Mul (FreeAbelianGroup α)

Equations

• FreeAbelianGroup.mul α = { mul := fun (x : FreeAbelianGroup α) => ⇑(FreeAbelianGroup.lift fun (x₂ : α) => (FreeAbelianGroup.lift fun (x₁ : α) => FreeAbelianGroup.of (x₁ * x₂)) x) }

theorem FreeAbelianGroup.mul_def {α : Type u} [Mul α] (x : FreeAbelianGroup α) (y : FreeAbelianGroup α) : x * y = (FreeAbelianGroup.lift fun (x₂ : α) => (FreeAbelianGroup.lift fun (x₁ : α) => FreeAbelianGroup.of (x₁ * x₂)) x) y

@[simp]

theorem FreeAbelianGroup.of_mul_of {α : Type u} [Mul α] (x : α) (y : α) : FreeAbelianGroup.of x * FreeAbelianGroup.of y = FreeAbelianGroup.of (x * y)

theorem FreeAbelianGroup.of_mul {α : Type u} [Mul α] (x : α) (y : α) : FreeAbelianGroup.of (x * y) = FreeAbelianGroup.of x * FreeAbelianGroup.of y

instance FreeAbelianGroup.distrib {α : Type u} [Mul α] : Distrib (FreeAbelianGroup α)

Equations

• FreeAbelianGroup.distrib = Distrib.mk ⋯ ⋯

instance FreeAbelianGroup.nonUnitalNonAssocRing {α : Type u} [Mul α] : NonUnitalNonAssocRing (FreeAbelianGroup α)

Equations

• FreeAbelianGroup.nonUnitalNonAssocRing = NonUnitalNonAssocRing.mk ⋯ ⋯ ⋯ ⋯

instance FreeAbelianGroup.one (α : Type u) [One α] : One (FreeAbelianGroup α)

Equations

• FreeAbelianGroup.one α = { one := FreeAbelianGroup.of 1 }

instance FreeAbelianGroup.nonUnitalRing (α : Type u) [Semigroup α] : NonUnitalRing (FreeAbelianGroup α)

Equations

• FreeAbelianGroup.nonUnitalRing α = NonUnitalRing.mk ⋯

instance FreeAbelianGroup.ring (α : Type u) [Monoid α] : Ring (FreeAbelianGroup α)

Equations

• FreeAbelianGroup.ring α = Ring.mk ⋯ SubNegMonoid.zsmul ⋯ ⋯ ⋯ ⋯ ⋯ ⋯

def FreeAbelianGroup.ofMulHom {α : Type u} [Monoid α] : α →* FreeAbelianGroup α

FreeAbelianGroup.of is a MonoidHom when α is a Monoid.

Equations

• FreeAbelianGroup.ofMulHom = { toFun := FreeAbelianGroup.of, map_one' := ⋯, map_mul' := ⋯ }

@[simp]

theorem FreeAbelianGroup.ofMulHom_coe {α : Type u} [Monoid α] : ⇑FreeAbelianGroup.ofMulHom = FreeAbelianGroup.of

def FreeAbelianGroup.liftMonoid {α : Type u} {R : Type u_1} [Monoid α] [Ring R] : (α →* R) ≃ (FreeAbelianGroup α →+* R)

If f preserves multiplication, then so does lift f.

Equations

• One or more equations did not get rendered due to their size.

@[simp]

theorem FreeAbelianGroup.liftMonoid_coe_addMonoidHom {α : Type u} {R : Type u_1} [Monoid α] [Ring R] (f : α →* R) : ↑(FreeAbelianGroup.liftMonoid f) = FreeAbelianGroup.lift ⇑f

@[simp]

theorem FreeAbelianGroup.liftMonoid_coe {α : Type u} {R : Type u_1} [Monoid α] [Ring R] (f : α →* R) : ⇑(FreeAbelianGroup.liftMonoid f) = ⇑(FreeAbelianGroup.lift ⇑f)

@[simp]

theorem FreeAbelianGroup.liftMonoid_symm_coe {α : Type u} {R : Type u_1} [Monoid α] [Ring R] (f : FreeAbelianGroup α →+* R) : ⇑(FreeAbelianGroup.liftMonoid.symm f) = FreeAbelianGroup.lift.symm ↑f

theorem FreeAbelianGroup.one_def {α : Type u} [Monoid α] : 1 = FreeAbelianGroup.of 1

theorem FreeAbelianGroup.of_one {α : Type u} [Monoid α] : FreeAbelianGroup.of 1 = 1

instance FreeAbelianGroup.instCommRingOfCommMonoid (α : Type u) [CommMonoid α] : CommRing (FreeAbelianGroup α)

Equations

• FreeAbelianGroup.instCommRingOfCommMonoid α = CommRing.mk ⋯

instance FreeAbelianGroup.pemptyUnique : Unique (FreeAbelianGroup PEmpty.{u_1 + 1} )

Equations

• FreeAbelianGroup.pemptyUnique = { default := 0, uniq := FreeAbelianGroup.pemptyUnique.proof_1 }

def FreeAbelianGroup.punitEquiv (T : Type u_1) [Unique T] : FreeAbelianGroup T ≃+ ℤ

The free abelian group on a type with one term is isomorphic to ℤ.

Equations

• FreeAbelianGroup.punitEquiv T = { toFun := ⇑(FreeAbelianGroup.lift fun (x : T) => 1), invFun := fun (n : ℤ) => n • FreeAbelianGroup.of default, left_inv := ⋯, right_inv := ⋯, map_add' := ⋯ }

def FreeAbelianGroup.equivOfEquiv {α : Type u_1} {β : Type u_2} (f : α ≃ β) : FreeAbelianGroup α ≃+ FreeAbelianGroup β

Isomorphic types have isomorphic free abelian groups.

Equations

• FreeAbelianGroup.equivOfEquiv f = { toFun := ⇑(FreeAbelianGroup.map ⇑f), invFun := ⇑(FreeAbelianGroup.map ⇑f.symm), left_inv := ⋯, right_inv := ⋯, map_add' := ⋯ }