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.
Cosets and Lagrange's Theorem: Examples and Counterexamples
1 · Prerequisites
- Binary Operations, Monoids, Groups and Subgroups
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Relations, Functions, and Quotients
- Roots, Rational Powers, and Classical Inequalities
- The ZFC Axioms and the Basic Set Constructions
2 · Summary
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
For , the cosets of are the congruence classes modulo
Example
Let be an integer. In the additive group , the subgroup has left cosets
There are exactly such cosets, represented uniquely by , and .
Facts & Assumptions
Given: A positive integer and the additive group .
The set is a subgroup of (Every subgroup of is for exactly one natural number , The integers form a commutative ring).
In additive notation, the coset represented by is (Left and right cosets and of a subgroup).
The congruence means (Congruence modulo an integer: when , including the moduli and ).
Every class modulo positive has exactly one representative with , and there are classes (For , every class in has one representative with , so ; while is in bijection with ).
The index is the finite cardinality of the coset set (The coset set and the index of a subgroup, The left cosets of a subgroup partition the group).
Verification
By [L1], is a subgroup of . For , one has exactly when for some integer , equivalently , equivalently .
By [L2], every such class has a unique representative in , and distinct representatives give distinct cosets by step 1.1.
Thus the coset set has cardinality , so .
and, for finite ,
Example
For every group , . If is finite with identity , then .
Facts & Assumptions
Given: A group with identity ; for the second assertion, assume is finite.
The cosets are , and the index is the cardinality of the coset set when finite (Left and right cosets and of a subgroup, The coset set and the index of a subgroup).
Lagrange's theorem gives for a subgroup of a finite group (Lagrange's theorem: for every subgroup of a finite group , The order of a finite group and the order of an element, with when no positive power of is the identity).
A subset containing and closed under products and inverses is a subgroup; moreover (Subgroup, In a group , and , the order of the last product being essential).
Verification
For , every coset equals , so the coset set is and .
The set is a subgroup: it contains , while and give closure under products and inverses by [L2]. Every coset is the singleton ; equivalently, [L1] gives . Hence .
Steps 1.1 and 1.2 establish the two index formulas.
The subgroup orders in are and
Example
Put . Its subgroup orders are exactly and .
Facts & Assumptions
Given: The symmetric group under composition.
is the group of bijections of , with cycle notation and composition acting rightmost first (The symmetric group : the bijections of a set under composition, is a group under composition, and it is non-abelian whenever has at least three distinct elements).
The generated set is a subgroup; a nonempty subset closed under products and inverses is a subgroup (The subgroup generated by a subset, the cyclic subgroup , and cyclic groups, Subgroup, One-step subgroup test: a nonempty is a subgroup iff for all ; the identity and the inverses of are then those of ).
The order of a subgroup of a finite group divides the order of the group (Lagrange's theorem: for every subgroup of a finite group , The order of a finite group and the order of an element, with when no positive power of is the identity).
Verification
The six bijections are , so .
The subgroups , , and have orders and , respectively.
If , then [L1] makes a positive divisor of , hence .
Step 1.2 realizes every value allowed by step 2.1, so these are exactly the subgroup orders.
A left coset that is not the corresponding right coset in
Statement refuted
For every subgroup and every , the corresponding cosets and are equal.
Facts & Assumptions
Given: The group , the subgroup , and .
Cycle products are composites with the rightmost permutation acting first (The symmetric group : the bijections of a set under composition, is a group under composition, and it is non-abelian whenever has at least three distinct elements).
The sets and are the left and right cosets (Left and right cosets and of a subgroup).
Under rightmost-first composition, if then , and ; hence , , and contains the identity and is closed under products and inverses, so it is a subgroup (The symmetric group : the bijections of a set under composition, is a group under composition, and it is non-abelian whenever has at least three distinct elements, Subgroup).
Counterexample
Direct composition gives and .
Therefore while .
Since , the left and right cosets are unequal, refuting the statement.
Every positive divisor of the order of a finite cyclic group occurs as the order of a subgroup
Example
Let be finite of order . If the positive integer divides , write with . Then
is a subgroup of order .
Facts & Assumptions
Given: A finite cyclic group of order , and positive integers satisfying .
The generated set is a subgroup, and its cardinality is the order of (The subgroup generated by a subset, the cyclic subgroup , and cyclic groups, , and every cyclic group is abelian, If then iff is an integer multiple of , the powers are distinct, and has exactly elements; if has infinite order then only for ).
The canonical embedding preserves products and order; is an ordered commutative ring and multiplication by a nonzero integer is cancellative (The naturals embed in the integers, The integers form a commutative ring, The integers form a totally ordered ring, The integers have no zero divisors; multiplicative cancellation, Divisibility in : when for some integer ).
If a positive natural exponent satisfies , then has finite order, and its order is the least such positive exponent and is at most ; if there is no such exponent, its order is (The order of a finite group and the order of an element, with when no positive power of is the identity).
Verification
Put . Then , so has finite order and .
If for a positive natural , then , so [L1] gives . Thus for some integer , and cancellation by the positive integer gives .
No positive satisfies : step 1.2 would give ; positivity forces , hence , a contradiction. Together with step 1.1, this gives .
Therefore is a subgroup with .
has index in and is nevertheless equinumerous with
Statement refuted
If a proper subgroup has finite index, then cannot be equinumerous with .
Facts & Assumptions
Given: The additive group and its subgroup .
The set is a subgroup of (Every subgroup of is for exactly one natural number , The integers form a commutative ring).
The index is the number of cosets, additive cosets have the form , and at modulus every congruence class has exactly one representative with , hence representative or (The coset set and the index of a subgroup, Left and right cosets and of a subgroup, For , every class in has one representative with , so ; while is in bijection with ).
Two sets are equinumerous when a bijection between them exists (Equinumerous sets, and , Injection, surjection, bijection).
Multiplication by a nonzero integer can be cancelled: if and , then (The integers have no zero divisors; multiplicative cancellation).
Counterexample
The two cosets are and . Indeed [F2] writes every integer as with ; then , since and, conversely, . Thus every coset is one of the displayed two, and they are distinct because one contains while the other does not. Hence .
The map given by is surjective by the definition of and injective because implies by cancellation at the nonzero factor . Hence it is a bijection.
Thus the proper subgroup has finite index and is equinumerous with , refuting the statement.
The product set of two subgroups need not be a subgroup
Statement refuted
For any two subgroups , the product set is a subgroup of .
Facts & Assumptions
Given: The group , and the subgroups and .
is a group under rightmost-first composition, and are subgroups because each transposition squares to (The symmetric group : the bijections of a set under composition, is a group under composition, and it is non-abelian whenever has at least three distinct elements, Subgroup).
If is a subgroup of a finite group , then under the canonical embedding one has (Lagrange's theorem: for every subgroup of a finite group , The order of a finite group and the order of an element, with when no positive power of is the identity).
Counterexample
The six elements of are , so .
Direct multiplication gives , a set of four distinct elements.
If were a subgroup, [L1] would force in , that is , which is false. Hence is not a subgroup.
Every left coset of a subgroup is itself a subgroup
Statement
Every left coset of every subgroup is a subgroup of .
Facts & Assumptions
Given: The group , the subgroup and the element from A left coset that is not the corresponding right coset in .
The left coset is (Left and right cosets and of a subgroup, A left coset that is not the corresponding right coset in ).
Every subgroup contains the identity element (Subgroup).
Refutation
Neither nor is the identity, so .
By [F2], the set cannot be a subgroup. This single coset refutes the statement.
Sources
Standard references
Recommended treatments; not extraction sources.
- UCL lecture notes, Cosets and Lagrange's theorem
- Thomas W. Judson, Abstract Algebra: Theory and Applications, §6.1: Cosets
- Thomas W. Judson, Abstract Algebra: Theory and Applications, Cosets and Lagrange's Theorem
- Thomas W. Judson, Abstract Algebra: Theory and Applications, §6.2: Lagrange's Theorem
- Thomas W. Judson, Abstract Algebra: Theory and Applications, Cyclic Groups
- Thomas W. Judson, Abstract Algebra: Theory and Applications, §4.1: Cyclic Subgroups