-
Notifications
You must be signed in to change notification settings - Fork 0
groups
jonasGajdosikas edited this page Oct 5, 2021
·
11 revisions
A Group ⟨G,∘⟩ is a set equipped with a binary operation ∘:G∘G↦G such that:
-
(a∘b)∘c=a∘(b∘c)∀a,b,c∈G(associative property) -
∃e|a∘e=e∘a=a∀a∈G(neutral element) -
∃ā∀a∈G|a∘ā=ā∘a=e(inverse element)
example groups are: ⟨ℤ,+⟩,⟨ℚ+,⋅⟩,⟨Sₙ,∘⟩
- if
a∘b=b∘athen the group is commutative(Abelian)
if
∘is denoted+, theneis usually denoted0andāas-a
if∘is denoted⋅, theneis usually denoted1andāasa⁻¹
given
E⊆G for ⟨G,∘⟩, thenEis a generator if and only if there exists a way to write any member ofGas a product (∘) of some members ofEand/or their inverses
given
U⊆G for ⟨G,∘⟩, then⟨U,∘⟩is a subgroup if
∀x,y∈U:x∘y∈U∀x∈U:x⁻¹∈U