How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced — the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted — a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated — a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
is a group under composition, and it is non-abelian whenever has at least three distinct elements
Statement
For every set , the triple of The symmetric group : the bijections of a set under composition is a group (Group and abelian group); the inverse of a permutation is its inverse function .
If contains three distinct elements , , , then is not abelian: the transpositions and satisfy .
Facts & Assumptions
Given: A set ; the set of bijections with the operation defined by and the element (The symmetric group : the bijections of a set under composition); and, for the second claim, three distinct elements together with the transpositions and of The symmetric group : the bijections of a set under composition.
A composite of two bijections is a bijection , so is a binary operation on ; is a bijection; and a bijection has a two-sided inverse function , which is itself a bijection (Injection, surjection, bijection, The symmetric group : the bijections of a set under composition).
Two functions are equal exactly when they agree at every point of .
A group is a monoid in which every element is invertible; a monoid is an associative operation with a two-sided identity (Group and abelian group, Semigroup and monoid, Left inverse, right inverse, and invertible element of a monoid).
Proof
Composition is associative: for and , both and evaluate to , so the two composites agree at every point and are equal.
is a two-sided identity: for and , and , so .
Every is invertible in : the inverse function is again a bijection , hence lies in , and it satisfies and for every , that is .
The transposition satisfies , and for ; the transposition satisfies , and for . Both are bijections of , being their own inverses.
By steps 1.1 and 1.2 the pair with the element is a monoid; by step 1.3 every element of it is invertible; hence it is a group, and the inverse of is the inverse function .
Evaluate the two composites at . Since and , , so . And , so .
The two composites take different values at , because ; hence and is not abelian.
is a group under composition, and it fails to be abelian as soon as has three distinct elements.
Remarks
-
"Three distinct elements", not a cardinality hypothesis. The second claim is stated and proved with three named, pairwise distinct points of . No notion of the size of is used, so the statement is available for any whatever, finite or not, and needs nothing about counting.
-
For with at most two elements is abelian: it has at most two elements itself, and any group with at most two elements is abelian, since one of any two of its elements is then the identity.
-
The witness pair is reused on the companion page to show that the exponent law genuinely needs its commuting hypothesis.
Depends on
Used by
- (gh)ⁿ = gⁿhⁿ fails without commutativity: two transpositions in Sym({1,2,3}) with (gh)² ≠ g²h² Counterexample
- A left coset that is not the corresponding right coset in Sym({1,2,3}) Counterexample
- A nonnormal two-element subgroup of Sym({1,2,3}) makes coset multiplication depend on representatives Counterexample
- The natural action of S₃ on three points is faithful and transitive but not free Counterexample
- The product set HK of two subgroups need not be a subgroup Counterexample
- The subgroup ⟨(1 2 3),(1 2)(3 4)⟩≤ S₄ has order 12 but no subgroup of order 6, so Cauchy's theorem does not extend to composite divisors Counterexample
- Conjugation by (1 2) in Sym({1,2,3}) exchanges the transpositions (1 3) and (2 3) Example
- Dₙ≅⟨ r,s∣ rⁿ, s², srs⁻¹r⟩ for the dihedral group Dₙ=⟨{ρ,σ}⟩leqSym(ℤ/n), n≥ 3 Example
- Sym({0,1,2})≅⟨ s,t∣ s², t², (st)³⟩ Example
- Sym({1,2,3}) has exactly six elements, is non-abelian, and its elements have orders 1, 2 and 3 Example
- The class equation of S₃ is 6=1+2+3 Example
- The eight vertex permutations of a square form a non-abelian subgroup of Sym({1,2,3,4}) of order 8, generated by a 4-cycle and one diagonal swap Example
- The Klein four-group as the subgroup {id, (12)(34), (13)(24), (14)(23)} of Sym({1,2,3,4}): abelian of order 4, non-cyclic, every non-identity element of order 2 Example
- The square-symmetry group has class equation 8=2+2+2+2 Example
- The subgroup orders in Sym({1,2,3}) are 1,2,3 and 6 Example
- The three subgroups of order 2 in S₃ are conjugate and each is self-normalizing Example
- The three-cycle subgroup of Sym({1,2,3}) is normal and its quotient has two elements Example
- FALSE: every finite group is a direct product of cyclic prime-power groups False statement
- Factor elements act by mutually inverse permutations on reduced syllable words Lemma
- Factor elements act consistently by permutations on amalgamated normal words Lemma
- Actions of G on X correspond exactly to homomorphisms GtoSym(X) Theorem
- Any two finite free bases of the same group have the same cardinality Theorem
- If [G:H]=n<∞, then Core_G(H) is normal in G, [G:Core_G(H)]∣ n!, and only finitely many subgroups contain H Theorem
- The automorphisms of a group form a group under composition Theorem
- The fundamental theorem of arithmetic: every integer n ≥ 1 is a product of primes, and the factorisation is unique up to order — if ∏_i<r pᵢ = ∏_j<s qⱼ with every pᵢ and qⱼ prime, then r = s and qᵢ = p_π(i) for some π ∈ Sym(r) Theorem
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 18 results over 11 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.
Sources
- Symmetric group (Wikipedia) (standard reference, not scraped)
- Function composition (Wikipedia) (standard reference, not scraped)