Torsion groups

This file defines torsion groups, i.e. groups where all elements have finite order.

Main definitions

• Monoid.IsTorsion a predicate asserting G is torsion, i.e. that all elements are of finite order.
• CommGroup.torsion G, the torsion subgroup of an abelian group G
• CommMonoid.torsion G, the above stated for commutative monoids
• Monoid.IsTorsionFree, asserting no nontrivial elements have finite order in G
• AddMonoid.IsTorsion and AddMonoid.IsTorsionFree the additive versions of the above

Implementation

All torsion monoids are really groups (which is proven here as Monoid.IsTorsion.group), but since the definition can be stated on monoids it is implemented on Monoid to match other declarations in the group theory library.

Tags

periodic group, aperiodic group, torsion subgroup, torsion abelian group

Future work

• generalize to π-torsion(-free) groups for a set of primes π
• free, free solvable and free abelian groups are torsion free
• complete direct and free products of torsion free groups are torsion free
• groups which are residually finite p-groups with respect to 2 distinct primes are torsion free

def AddMonoid.IsTorsion (G : Type u_1) [AddMonoid G] : Prop

A predicate on an additive monoid saying that all elements are of finite order.

Equations

• AddMonoid.IsTorsion G = ∀ (g : G), IsOfFinAddOrder g

def Monoid.IsTorsion (G : Type u_1) [Monoid G] : Prop

A predicate on a monoid saying that all elements are of finite order.

Equations

• Monoid.IsTorsion G = ∀ (g : G), IsOfFinOrder g

@[simp]

theorem AddMonoid.not_isTorsion_iff (G : Type u_1) [AddMonoid G] : ¬AddMonoid.IsTorsion G ↔ ∃ (g : G), ¬IsOfFinAddOrder g

An additive monoid is not a torsion monoid if it has an element of infinite order.

@[simp]

theorem Monoid.not_isTorsion_iff (G : Type u_1) [Monoid G] : ¬Monoid.IsTorsion G ↔ ∃ (g : G), ¬IsOfFinOrder g

A monoid is not a torsion monoid if it has an element of infinite order.

theorem IsTorsion.addGroup.proof_2 {G : Type u_1} [AddMonoid G] : ∀ (a : G), zsmulRec 0 a = zsmulRec 0 a

noncomputable def IsTorsion.addGroup {G : Type u_1} [AddMonoid G] (tG : AddMonoid.IsTorsion G) : AddGroup G

Torsion additive monoids are really additive groups

Equations

• IsTorsion.addGroup tG = let __src := inst; AddGroup.mk ⋯

theorem IsTorsion.addGroup.proof_5 {G : Type u_1} [AddMonoid G] (tG : AddMonoid.IsTorsion G) (g : G) : -g + g = 0

theorem IsTorsion.addGroup.proof_4 {G : Type u_1} [AddMonoid G] : ∀ (n : ℕ) (a : G), zsmulRec (Int.negSucc n) a = zsmulRec (Int.negSucc n) a

theorem IsTorsion.addGroup.proof_1 {G : Type u_1} [AddMonoid G] : ∀ (a b : G), a - b = a - b

theorem IsTorsion.addGroup.proof_3 {G : Type u_1} [AddMonoid G] : ∀ (n : ℕ) (a : G), zsmulRec (Int.ofNat n.succ) a = zsmulRec (Int.ofNat n.succ) a

noncomputable def IsTorsion.group {G : Type u_1} [Monoid G] (tG : Monoid.IsTorsion G) : Group G

Torsion monoids are really groups.

Equations

• IsTorsion.group tG = let __src := inst; Group.mk ⋯

theorem IsTorsion.addSubgroup {G : Type u_1} [AddGroup G] (tG : AddMonoid.IsTorsion G) (H : AddSubgroup G) : AddMonoid.IsTorsion ↥H

Subgroups of additive torsion groups are additive torsion groups.

theorem IsTorsion.subgroup {G : Type u_1} [Group G] (tG : Monoid.IsTorsion G) (H : Subgroup G) : Monoid.IsTorsion ↥H

Subgroups of torsion groups are torsion groups.

theorem AddIsTorsion.of_surjective {G : Type u_1} {H : Type u_2} [AddGroup G] [AddGroup H] {f : G →+ H} (hf : Function.Surjective ⇑f) (tG : AddMonoid.IsTorsion G) : AddMonoid.IsTorsion H

The image of a surjective additive torsion group homomorphism is torsion.

theorem IsTorsion.of_surjective {G : Type u_1} {H : Type u_2} [Group G] [Group H] {f : G →* H} (hf : Function.Surjective ⇑f) (tG : Monoid.IsTorsion G) : Monoid.IsTorsion H

The image of a surjective torsion group homomorphism is torsion.

theorem AddIsTorsion.extension_closed {G : Type u_1} {H : Type u_2} [AddGroup G] {N : AddSubgroup G} [AddGroup H] {f : G →+ H} (hN : N = f.ker) (tH : AddMonoid.IsTorsion H) (tN : AddMonoid.IsTorsion ↥N) : AddMonoid.IsTorsion G

Additive torsion groups are closed under extensions.

theorem IsTorsion.extension_closed {G : Type u_1} {H : Type u_2} [Group G] {N : Subgroup G} [Group H] {f : G →* H} (hN : N = f.ker) (tH : Monoid.IsTorsion H) (tN : Monoid.IsTorsion ↥N) : Monoid.IsTorsion G

Torsion groups are closed under extensions.

theorem AddIsTorsion.quotient_iff {G : Type u_1} {H : Type u_2} [AddGroup G] {N : AddSubgroup G} [AddGroup H] {f : G →+ H} (hf : Function.Surjective ⇑f) (hN : N = f.ker) (tN : AddMonoid.IsTorsion ↥N) : AddMonoid.IsTorsion H ↔ AddMonoid.IsTorsion G

The image of a quotient is additively torsion iff the group is torsion.

theorem IsTorsion.quotient_iff {G : Type u_1} {H : Type u_2} [Group G] {N : Subgroup G} [Group H] {f : G →* H} (hf : Function.Surjective ⇑f) (hN : N = f.ker) (tN : Monoid.IsTorsion ↥N) : Monoid.IsTorsion H ↔ Monoid.IsTorsion G

The image of a quotient is torsion iff the group is torsion.

theorem ExponentExists.is_add_torsion {G : Type u_1} [AddGroup G] (h : AddMonoid.ExponentExists G) : AddMonoid.IsTorsion G

If a group exponent exists, the group is additively torsion.

theorem ExponentExists.isTorsion {G : Type u_1} [Group G] (h : Monoid.ExponentExists G) : Monoid.IsTorsion G

If a group exponent exists, the group is torsion.

theorem IsAddTorsion.exponentExists {G : Type u_1} [AddGroup G] (tG : AddMonoid.IsTorsion G) (bounded : (Set.range fun (g : G) => addOrderOf g).Finite) : AddMonoid.ExponentExists G

The group exponent exists for any bounded additive torsion group.

theorem IsTorsion.exponentExists {G : Type u_1} [Group G] (tG : Monoid.IsTorsion G) (bounded : (Set.range fun (g : G) => orderOf g).Finite) : Monoid.ExponentExists G

The group exponent exists for any bounded torsion group.

theorem is_add_torsion_of_finite {G : Type u_1} [AddGroup G] [Finite G] : AddMonoid.IsTorsion G

Finite additive groups are additive torsion groups.

theorem isTorsion_of_finite {G : Type u_1} [Group G] [Finite G] : Monoid.IsTorsion G

Finite groups are torsion groups.

theorem AddMonoid.IsTorsion.module_of_torsion (R : Type u_3) (M : Type u_4) [AddCommMonoid M] [Semiring R] [Module R M] (tR : AddMonoid.IsTorsion R) : AddMonoid.IsTorsion M

A module whose scalars are additively torsion is additively torsion.

theorem AddMonoid.IsTorsion.module_of_finite (R : Type u_3) (M : Type u_4) [AddCommMonoid M] [Ring R] [Finite R] [Module R M] : AddMonoid.IsTorsion M

A module with a finite ring of scalars is additively torsion.

theorem AddCommMonoid.addTorsion.proof_1 (G : Type u_1) [AddCommMonoid G] : IsOfFinAddOrder 0

def AddCommMonoid.addTorsion (G : Type u_1) [AddCommMonoid G] : AddSubmonoid G

The torsion submonoid of an additive commutative monoid.

Equations

• AddCommMonoid.addTorsion G = { carrier := {x : G | IsOfFinAddOrder x}, add_mem' := ⋯, zero_mem' := ⋯ }

def CommMonoid.torsion (G : Type u_1) [CommMonoid G] : Submonoid G

The torsion submonoid of a commutative monoid.

(Note that by Monoid.IsTorsion.group torsion monoids are truthfully groups.)

Equations

• CommMonoid.torsion G = { carrier := {x : G | IsOfFinOrder x}, mul_mem' := ⋯, one_mem' := ⋯ }

abbrev AddCommMonoid.addTorsion.isTorsion.match_1 {G : Type u_1} [AddCommMonoid G] (motive : ↥(AddCommMonoid.addTorsion G) → Prop) : ∀ (x : ↥(AddCommMonoid.addTorsion G)), (∀ (x : G) (n : ℕ) (npos : n > 0) (hn : Function.IsPeriodicPt (fun (x_1 : G) => x + x_1) n 0), motive ⟨x, ⋯⟩) → motive x

Equations

• ⋯ = ⋯

theorem AddCommMonoid.addTorsion.isTorsion {G : Type u_1} [AddCommMonoid G] : AddMonoid.IsTorsion ↥(AddCommMonoid.addTorsion G)

Additive torsion submonoids are additively torsion.

theorem CommMonoid.torsion.isTorsion {G : Type u_1} [CommMonoid G] : Monoid.IsTorsion ↥(CommMonoid.torsion G)

Torsion submonoids are torsion.

theorem AddCommMonoid.primaryComponent.proof_2 (G : Type u_1) [AddCommMonoid G] (p : ℕ) : ∃ (n : ℕ), addOrderOf 0 = p ^ n

theorem AddCommMonoid.primaryComponent.proof_1 (G : Type u_1) [AddCommMonoid G] (p : ℕ) [hp : Fact (Nat.Prime p)] : ∀ {a b : G}, a ∈ {g : G | ∃ (n : ℕ), addOrderOf g = p ^ n} → b ∈ {g : G | ∃ (n : ℕ), addOrderOf g = p ^ n} → ∃ (k : ℕ), addOrderOf (a + b) = p ^ k

def AddCommMonoid.primaryComponent (G : Type u_1) [AddCommMonoid G] (p : ℕ) [hp : Fact (Nat.Prime p)] : AddSubmonoid G

The p-primary component is the submonoid of elements with additive order prime-power of p.

Equations

• AddCommMonoid.primaryComponent G p = { carrier := {g : G | ∃ (n : ℕ), addOrderOf g = p ^ n}, add_mem' := ⋯, zero_mem' := ⋯ }

@[simp]

theorem AddCommMonoid.primaryComponent_coe (G : Type u_1) [AddCommMonoid G] (p : ℕ) [hp : Fact (Nat.Prime p)] : ↑(AddCommMonoid.primaryComponent G p) = {g : G | ∃ (n : ℕ), addOrderOf g = p ^ n}

@[simp]

theorem CommMonoid.primaryComponent_coe (G : Type u_1) [CommMonoid G] (p : ℕ) [hp : Fact (Nat.Prime p)] : ↑(CommMonoid.primaryComponent G p) = {g : G | ∃ (n : ℕ), orderOf g = p ^ n}

def CommMonoid.primaryComponent (G : Type u_1) [CommMonoid G] (p : ℕ) [hp : Fact (Nat.Prime p)] : Submonoid G

The p-primary component is the submonoid of elements with order prime-power of p.

Equations

• CommMonoid.primaryComponent G p = { carrier := {g : G | ∃ (n : ℕ), orderOf g = p ^ n}, mul_mem' := ⋯, one_mem' := ⋯ }

theorem AddCommMonoid.primaryComponent.exists_orderOf_eq_prime_nsmul {G : Type u_1} [AddCommMonoid G] {p : ℕ} [hp : Fact (Nat.Prime p)] (g : ↥(AddCommMonoid.primaryComponent G p)) : ∃ (n : ℕ), addOrderOf g = p ^ n

Elements of the p-primary component have additive order p^n for some n

theorem CommMonoid.primaryComponent.exists_orderOf_eq_prime_pow {G : Type u_1} [CommMonoid G] {p : ℕ} [hp : Fact (Nat.Prime p)] (g : ↥(CommMonoid.primaryComponent G p)) : ∃ (n : ℕ), orderOf g = p ^ n

Elements of the p-primary component have order p^n for some n.

theorem AddCommMonoid.primaryComponent.disjoint {G : Type u_1} [AddCommMonoid G] {p : ℕ} [hp : Fact (Nat.Prime p)] {p' : ℕ} [hp' : Fact (Nat.Prime p')] (hne : p ≠ p') : Disjoint (AddCommMonoid.primaryComponent G p) (AddCommMonoid.primaryComponent G p')

The p- and q-primary components are disjoint for p ≠ q.

theorem CommMonoid.primaryComponent.disjoint {G : Type u_1} [CommMonoid G] {p : ℕ} [hp : Fact (Nat.Prime p)] {p' : ℕ} [hp' : Fact (Nat.Prime p')] (hne : p ≠ p') : Disjoint (CommMonoid.primaryComponent G p) (CommMonoid.primaryComponent G p')

The p- and q-primary components are disjoint for p ≠ q.

@[simp]

theorem AddMonoid.IsTorsion.torsion_eq_top {G : Type u_1} [AddCommMonoid G] (tG : AddMonoid.IsTorsion G) : AddCommMonoid.addTorsion G = ⊤

The additive torsion submonoid of an additive torsion monoid is ⊤.

@[simp]

theorem Monoid.IsTorsion.torsion_eq_top {G : Type u_1} [CommMonoid G] (tG : Monoid.IsTorsion G) : CommMonoid.torsion G = ⊤

The torsion submonoid of a torsion monoid is ⊤.

def AddMonoid.IsTorsion.torsionAddEquiv {G : Type u_1} [AddCommMonoid G] (tG : AddMonoid.IsTorsion G) : ↥(AddCommMonoid.addTorsion G) ≃+ G

An additive torsion monoid is isomorphic to its torsion submonoid.

Equations

• tG.torsionAddEquiv = (AddEquiv.addSubmonoidCongr ⋯).trans AddSubmonoid.topEquiv

def Monoid.IsTorsion.torsionMulEquiv {G : Type u_1} [CommMonoid G] (tG : Monoid.IsTorsion G) : ↥(CommMonoid.torsion G) ≃* G

A torsion monoid is isomorphic to its torsion submonoid.

Equations

• tG.torsionMulEquiv = (MulEquiv.submonoidCongr ⋯).trans Submonoid.topEquiv

theorem AddMonoid.IsTorsion.torsionAddEquiv_apply {G : Type u_1} [AddCommMonoid G] (tG : AddMonoid.IsTorsion G) (a : ↥(AddCommMonoid.addTorsion G)) : tG.torsionAddEquiv a = ↑((AddEquiv.addSubmonoidCongr ⋯) a)

theorem Monoid.IsTorsion.torsionMulEquiv_apply {G : Type u_1} [CommMonoid G] (tG : Monoid.IsTorsion G) (a : ↥(CommMonoid.torsion G)) : tG.torsionMulEquiv a = ↑((MulEquiv.submonoidCongr ⋯) a)

theorem AddMonoid.IsTorsion.torsionAddEquiv_symm_apply_coe {G : Type u_1} [AddCommMonoid G] (tG : AddMonoid.IsTorsion G) (a : G) : tG.torsionAddEquiv.symm a = ⟨↑(AddSubmonoid.topEquiv.symm a), ⋯⟩

theorem Monoid.IsTorsion.torsionMulEquiv_symm_apply_coe {G : Type u_1} [CommMonoid G] (tG : Monoid.IsTorsion G) (a : G) : tG.torsionMulEquiv.symm a = ⟨↑(Submonoid.topEquiv.symm a), ⋯⟩

def AddCommMonoid.Torsion.ofTorsion (G : Type u_1) [AddCommMonoid G] : ↥(AddCommMonoid.addTorsion ↥(AddCommMonoid.addTorsion G)) ≃+ ↥(AddCommMonoid.addTorsion G)

Additive torsion submonoids of an additive torsion submonoid are isomorphic to the submonoid.

Equations

• AddCommMonoid.Torsion.ofTorsion G = ⋯.torsionAddEquiv

def Torsion.ofTorsion (G : Type u_1) [CommMonoid G] : ↥(CommMonoid.torsion ↥(CommMonoid.torsion G)) ≃* ↥(CommMonoid.torsion G)

Torsion submonoids of a torsion submonoid are isomorphic to the submonoid.

Equations

• Torsion.ofTorsion G = ⋯.torsionMulEquiv

def AddCommGroup.torsion (G : Type u_1) [AddCommGroup G] : AddSubgroup G

The torsion subgroup of an additive abelian group.

Equations

• AddCommGroup.torsion G = let __src := AddCommMonoid.addTorsion G; { toAddSubmonoid := __src, neg_mem' := ⋯ }

theorem AddCommGroup.torsion.proof_1 (G : Type u_1) [AddCommGroup G] : ∀ {x : G}, x ∈ (AddCommMonoid.addTorsion G).carrier → IsOfFinAddOrder (-x)

def CommGroup.torsion (G : Type u_1) [CommGroup G] : Subgroup G

The torsion subgroup of an abelian group.

Equations

• CommGroup.torsion G = let __src := CommMonoid.torsion G; { toSubmonoid := __src, inv_mem' := ⋯ }

theorem AddCommGroup.add_torsion_eq_add_torsion_submonoid (G : Type u_1) [AddCommGroup G] : AddCommMonoid.addTorsion G = (AddCommGroup.torsion G).toAddSubmonoid

The additive torsion submonoid of an abelian group equals the torsion subgroup as a submonoid.

theorem CommGroup.torsion_eq_torsion_submonoid (G : Type u_1) [CommGroup G] : CommMonoid.torsion G = (CommGroup.torsion G).toSubmonoid

The torsion submonoid of an abelian group equals the torsion subgroup as a submonoid.

theorem AddCommGroup.mem_torsion (G : Type u_1) [AddCommGroup G] (g : G) : g ∈ AddCommGroup.torsion G ↔ IsOfFinAddOrder g

theorem CommGroup.mem_torsion (G : Type u_1) [CommGroup G] (g : G) : g ∈ CommGroup.torsion G ↔ IsOfFinOrder g

abbrev AddCommGroup.primaryComponent.match_1 (G : Type u_1) [AddCommGroup G] (p : ℕ) [hp : Fact (Nat.Prime p)] {g : G} : let __src := AddCommMonoid.primaryComponent G p; ∀ (motive : g ∈ __src.carrier → Prop) (x : g ∈ __src.carrier), (∀ (n : ℕ) (hn : addOrderOf g = p ^ n), motive ⋯) → motive x

Equations

• ⋯ = ⋯

theorem AddCommGroup.primaryComponent.proof_1 (G : Type u_1) [AddCommGroup G] (p : ℕ) [hp : Fact (Nat.Prime p)] {g : G} : g ∈ (AddCommMonoid.primaryComponent G p).carrier → -g ∈ (AddCommMonoid.primaryComponent G p).carrier

def AddCommGroup.primaryComponent (G : Type u_1) [AddCommGroup G] (p : ℕ) [hp : Fact (Nat.Prime p)] : AddSubgroup G

The p-primary component is the subgroup of elements with additive order prime-power of p.

Equations

• AddCommGroup.primaryComponent G p = let __src := AddCommMonoid.primaryComponent G p; { toAddSubmonoid := __src, neg_mem' := ⋯ }

@[simp]

theorem CommGroup.primaryComponent_coe (G : Type u_1) [CommGroup G] (p : ℕ) [hp : Fact (Nat.Prime p)] : ↑(CommGroup.primaryComponent G p) = {g : G | ∃ (n : ℕ), orderOf g = p ^ n}

@[simp]

theorem AddCommGroup.primaryComponent_coe (G : Type u_1) [AddCommGroup G] (p : ℕ) [hp : Fact (Nat.Prime p)] : ↑(AddCommGroup.primaryComponent G p) = {g : G | ∃ (n : ℕ), addOrderOf g = p ^ n}

def CommGroup.primaryComponent (G : Type u_1) [CommGroup G] (p : ℕ) [hp : Fact (Nat.Prime p)] : Subgroup G

The p-primary component is the subgroup of elements with order prime-power of p.

Equations

• CommGroup.primaryComponent G p = let __src := CommMonoid.primaryComponent G p; { toSubmonoid := __src, inv_mem' := ⋯ }

theorem CommGroup.primaryComponent.isPGroup {G : Type u_1} [CommGroup G] {p : ℕ} [hp : Fact (Nat.Prime p)] : IsPGroup p ↥(CommGroup.primaryComponent G p)

The p-primary component is a p group.

def AddMonoid.IsTorsionFree (G : Type u_1) [AddMonoid G] : Prop

A predicate on an additive monoid saying that only 0 is of finite order.

Equations

• AddMonoid.IsTorsionFree G = ∀ (g : G), g ≠ 0 → ¬IsOfFinAddOrder g

def Monoid.IsTorsionFree (G : Type u_1) [Monoid G] : Prop

A predicate on a monoid saying that only 1 is of finite order.

Equations

• Monoid.IsTorsionFree G = ∀ (g : G), g ≠ 1 → ¬IsOfFinOrder g

@[simp]

theorem AddMonoid.not_isTorsionFree_iff {G : Type u_1} [AddMonoid G] : ¬AddMonoid.IsTorsionFree G ↔ ∃ (g : G), g ≠ 0 ∧ IsOfFinAddOrder g

An additive monoid is not torsion free if any nontrivial element has finite order.

@[simp]

theorem Monoid.not_isTorsionFree_iff {G : Type u_1} [Monoid G] : ¬Monoid.IsTorsionFree G ↔ ∃ (g : G), g ≠ 1 ∧ IsOfFinOrder g

A nontrivial monoid is not torsion-free if any nontrivial element has finite order.

@[simp]

theorem AddMonoid.isTorsionFree_of_subsingleton {G : Type u_1} [AddMonoid G] [Subsingleton G] : AddMonoid.IsTorsionFree G

@[simp]

theorem Monoid.isTorsionFree_of_subsingleton {G : Type u_1} [Monoid G] [Subsingleton G] : Monoid.IsTorsionFree G

theorem AddMonoid.isTorsionFree_iff_torsion_eq_bot {G : Type u_3} [AddCommGroup G] : AddMonoid.IsTorsionFree G ↔ AddCommGroup.torsion G = ⊥

theorem Monoid.isTorsionFree_iff_torsion_eq_bot {G : Type u_3} [CommGroup G] : Monoid.IsTorsionFree G ↔ CommGroup.torsion G = ⊥

theorem AddMonoid.IsTorsion.not_torsion_free {G : Type u_1} [AddGroup G] [hN : Nontrivial G] : AddMonoid.IsTorsion G → ¬AddMonoid.IsTorsionFree G

A nontrivial additive torsion group is not torsion-free.

theorem IsTorsion.not_torsion_free {G : Type u_1} [Group G] [hN : Nontrivial G] : Monoid.IsTorsion G → ¬Monoid.IsTorsionFree G

A nontrivial torsion group is not torsion-free.

theorem AddMonoid.IsTorsionFree.not_torsion {G : Type u_1} [AddGroup G] [hN : Nontrivial G] : AddMonoid.IsTorsionFree G → ¬AddMonoid.IsTorsion G

A nontrivial torsion-free additive group is not torsion.

theorem IsTorsionFree.not_torsion {G : Type u_1} [Group G] [hN : Nontrivial G] : Monoid.IsTorsionFree G → ¬Monoid.IsTorsion G

A nontrivial torsion-free group is not torsion.

theorem IsTorsionFree.addSubgroup {G : Type u_1} [AddGroup G] (tG : AddMonoid.IsTorsionFree G) (H : AddSubgroup G) : AddMonoid.IsTorsionFree ↥H

Subgroups of additive torsion-free groups are additively torsion-free.

theorem IsTorsionFree.subgroup {G : Type u_1} [Group G] (tG : Monoid.IsTorsionFree G) (H : Subgroup G) : Monoid.IsTorsionFree ↥H

Subgroups of torsion-free groups are torsion-free.

theorem AddMonoid.IsTorsionFree.prod {η : Type u_3} {Gs : η → Type u_4} [(i : η) → AddGroup (Gs i)] (tfGs : ∀ (i : η), AddMonoid.IsTorsionFree (Gs i)) : AddMonoid.IsTorsionFree ((i : η) → Gs i)

Direct products of additive torsion free groups are torsion free.

theorem IsTorsionFree.prod {η : Type u_3} {Gs : η → Type u_4} [(i : η) → Group (Gs i)] (tfGs : ∀ (i : η), Monoid.IsTorsionFree (Gs i)) : Monoid.IsTorsionFree ((i : η) → Gs i)

Direct products of torsion free groups are torsion free.

theorem AddIsTorsionFree.quotient_torsion (G : Type u_1) [AddCommGroup G] : AddMonoid.IsTorsionFree (G ⧸ AddCommGroup.torsion G)

Quotienting a group by its additive torsion subgroup yields an additive torsion free group.

theorem IsTorsionFree.quotient_torsion (G : Type u_1) [CommGroup G] : Monoid.IsTorsionFree (G ⧸ CommGroup.torsion G)

Quotienting a group by its torsion subgroup yields a torsion free group.

theorem isTorsionFree_iff_noZeroSMulDivisors_nat {M : Type u_3} [AddMonoid M] : AddMonoid.IsTorsionFree M ↔ NoZeroSMulDivisors ℕ M

theorem isTorsionFree_iff_noZeroSMulDivisors_int {G : Type u_1} [AddGroup G] : AddMonoid.IsTorsionFree G ↔ NoZeroSMulDivisors ℤ G

@[deprecated isTorsionFree_iff_noZeroSMulDivisors_int]

theorem AddMonoid.IsTorsionFree_iff_noZeroSMulDivisors {G : Type u_1} [AddGroup G] : AddMonoid.IsTorsionFree G ↔ NoZeroSMulDivisors ℤ G

Alias of isTorsionFree_iff_noZeroSMulDivisors_int.

theorem IsTorsionFree.of_noZeroSMulDivisors {M : Type u_3} [AddMonoid M] [NoZeroSMulDivisors ℕ M] : AddMonoid.IsTorsionFree M