Alphabeta Math
Session-authored (Fable 5 assisted)
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.

8 results · all verified · 0 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 8 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Cosets and Lagrange's Theorem: Examples and Counterexamples

1 · Prerequisites

2 · Summary

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck passverified 2026-08-03 (gpt-5.6-sol-codex-subscription)Open item page →

For n1n\ge1, the cosets of nZn\mathbb{Z} are the nn congruence classes modulo nn

Example

Let n1n\ge1 be an integer. In the additive group (Z,+)(\mathbb Z,+), the subgroup nZn\mathbb Z has left cosets

a+nZ={xZ:xa(modn)}.a+n\mathbb Z=\{x\in\mathbb Z:x\equiv a\pmod n\}.

There are exactly nn such cosets, represented uniquely by 0,1,,n10,1,\ldots,n-1, and [Z:nZ]=n[\mathbb Z:n\mathbb Z]=n.

Facts & Assumptions

Given: A positive integer nn and the additive group Z\mathbb Z.

[L1]
[F1]

In additive notation, the coset represented by aa is a+nZa+n\mathbb Z (Left and right cosets gHgH and HgHg of a subgroup).

[F2]

The congruence xa(modn)x\equiv a\pmod n means n(xa)n\mid(x-a) (Congruence modulo an integer: ab(modn)a\equiv b\pmod n when n(ab)n\mid(a-b), including the moduli 00 and 11).

Verification

technique · direct
1.1

By [L1], nZn\mathbb Z is a subgroup of (Z,+)(\mathbb Z,+). For xZx\in\mathbb Z, one has xa+nZx\in a+n\mathbb Z exactly when x=a+nkx=a+nk for some integer kk, equivalently n(xa)n\mid(x-a), equivalently xa(modn)x\equiv a\pmod n.

L1F1F2
2.1

By [L2], every such class has a unique representative in {0,,n1}\{0,\ldots,n-1\}, and distinct representatives give distinct cosets by step 1.1.

step 1.1L2
3.1

Thus the coset set has cardinality nn, so [Z:nZ]=n[\mathbb Z:n\mathbb Z]=n.

step 2.1F3
ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck passverified 2026-08-03 (gpt-5.6-sol-codex-subscription)Open item page →

[G:G]=1[G:G]=1 and, for finite GG, [G:{e}]=G[G:\{e\}]=|G|

Example

For every group GG, [G:G]=1[G:G]=1. If GG is finite with identity ee, then [G:{e}]=G[G:\{e\}]=|G|.

Facts & Assumptions

Given: A group GG with identity ee; for the second assertion, assume GG is finite.

[F1]

The cosets are gH={gh:hH}gH=\{gh:h\in H\}, and the index is the cardinality of the coset set when finite (Left and right cosets gHgH and HgHg of a subgroup, The coset set G/HG/H and the index [G:H][G:H] of a subgroup).

Verification

technique · direct
1.1

For H=GH=G, every coset gGgG equals GG, so the coset set is {G}\{G\} and [G:G]=1[G:G]=1.

F1
1.2

The set H={e}H=\{e\} is a subgroup: it contains ee, while ee=eee=e and e1=ee^{-1}=e give closure under products and inverses by [L2]. Every coset is the singleton g{e}={g}g\{e\}=\{g\}; equivalently, [L1] gives G=[G:{e}]1|G|=[G:\{e\}]\cdot1. Hence [G:{e}]=G[G:\{e\}]=|G|.

F1L1L2
2.1

Steps 1.1 and 1.2 establish the two index formulas.

step 1.1step 1.2
ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck passaudited 2026-08-01Open item page →

The subgroup orders in Sym({1,2,3})\operatorname{Sym}(\{1,2,3\}) are 1,2,31,2,3 and 66

Example

Put S3=Sym({1,2,3})S_3=\operatorname{Sym}(\{1,2,3\}). Its subgroup orders are exactly 1,2,3,1,2,3, and 66.

Facts & Assumptions

Verification

technique · direct
1.1

The six bijections are e,(12),(13),(23),(123),(132)e,(12),(13),(23),(123),(132), so S3=6|S_3|=6.

F1
1.2

The subgroups {e}\{e\}, (12)={e,(12)}\langle(12)\rangle=\{e,(12)\}, (123)={e,(123),(132)}\langle(123)\rangle=\{e,(123),(132)\} and S3S_3 have orders 1,2,3,1,2,3, and 66, respectively.

F1F2
2.1

If HS3H\le S_3, then [L1] makes H|H| a positive divisor of 66, hence H{1,2,3,6}|H|\in\{1,2,3,6\}.

step 1.1L1F2
3.1

Step 1.2 realizes every value allowed by step 2.1, so these are exactly the subgroup orders.

step 1.2step 2.1
CounterexampleConstruction: AI-adaptedVerification: AI-generatedprecheck passaudited 2026-08-01Open item page →

A left coset that is not the corresponding right coset in Sym({1,2,3})\operatorname{Sym}(\{1,2,3\})

Statement refuted

For every subgroup HGH\le G and every gGg\in G, the corresponding cosets gHgH and HgHg are equal.

Facts & Assumptions

Given: The group S3=Sym({1,2,3})S_3=\operatorname{Sym}(\{1,2,3\}), the subgroup H={e,(12)}H=\{e,(12)\}, and g=(123)g=(123).

[F2]

The sets gH={gh:hH}gH=\{gh:h\in H\} and Hg={hg:hH}Hg=\{hg:h\in H\} are the left and right cosets (Left and right cosets gHgH and HgHg of a subgroup).

[F3]

Under rightmost-first composition, if τ=(12)\tau=(12) then ee=eee=e, eτ=τe=τe\tau=\tau e=\tau and τ2=e\tau^2=e; hence e1=ee^{-1}=e, τ1=τ\tau^{-1}=\tau, and H={e,τ}H=\{e,\tau\} contains the identity and is closed under products and inverses, so it is a subgroup (The symmetric group Sym(X)\operatorname{Sym}(X): the bijections of a set XX under composition, Sym(X)\operatorname{Sym}(X) is a group under composition, and it is non-abelian whenever XX has at least three distinct elements, Subgroup).

Counterexample

technique · direct
1.1

Direct composition gives (123)(12)=(13)(123)(12)=(13) and (12)(123)=(23)(12)(123)=(23).

F1
2.1

Therefore gH={(123),(13)}gH=\{(123),(13)\} while Hg={(123),(23)}Hg=\{(123),(23)\}.

step 1.1F2F3
3.1

Since (13)(23)(13)\ne(23), the left and right cosets are unequal, refuting the statement.

step 2.1
ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck passverified 2026-08-03 (gpt-5.6-sol-codex-subscription)Open item page →

Every positive divisor of the order of a finite cyclic group occurs as the order of a subgroup

Example

Let G=gG=\langle g\rangle be finite of order nn. If the positive integer dd divides nn, write n=dqn=dq with q>0q>0. Then

H=gqH=\langle g^q\rangle

is a subgroup of order dd.

Facts & Assumptions

Given: A finite cyclic group G=gG=\langle g\rangle of order nn, and positive integers d,qd,q satisfying n=dqn=dq.

[L4]

If a positive natural exponent rr satisfies xr=ex^r=e, then xx has finite order, and its order is the least such positive exponent and is at most rr; if there is no such exponent, its order is \infty (The order G|G| of a finite group and the order ord(g)\operatorname{ord}(g) of an element, with ord(g)=\operatorname{ord}(g) = \infty when no positive power of gg is the identity).

Verification

technique · direct
1.1

Put h=gqh=g^q. Then hd=gqd=gn=eh^d=g^{qd}=g^n=e, so hh has finite order and ord(h)d\operatorname{ord}(h)\le d.

givenL1L2L3L4
1.2

If hk=eh^k=e for a positive natural kk, then gqk=eg^{qk}=e, so [L1] gives nqkn\mid qk. Thus qk=nm=qdmqk=n m=qdm for some integer mm, and cancellation by the positive integer qq gives k=dmk=dm.

L1L2L3
2.1

No positive k<dk<d satisfies hk=eh^k=e: step 1.2 would give k=dmk=dm; positivity forces m1m\ge1, hence kdk\ge d, a contradiction. Together with step 1.1, this gives ord(h)=d\operatorname{ord}(h)=d.

step 1.1step 1.2L3
3.1

Therefore H=hH=\langle h\rangle is a subgroup with H=ord(h)=d|H|=\operatorname{ord}(h)=d.

step 2.1F1
CounterexampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passverified 2026-08-03 (gpt-5.6-sol-codex-subscription)Open item page →

2Z2\mathbb{Z} has index 22 in Z\mathbb{Z} and is nevertheless equinumerous with Z\mathbb{Z}

Statement refuted

If a proper subgroup H<GH<G has finite index, then HH cannot be equinumerous with GG.

Facts & Assumptions

Given: The additive group Z\mathbb Z and its subgroup 2Z2\mathbb Z.

[F2]

The index is the number of cosets, additive cosets have the form a+2Za+2\mathbb Z, and at modulus 22 every congruence class has exactly one representative rr with 0r<20\le r<2, hence representative 00 or 11 (The coset set G/HG/H and the index [G:H][G:H] of a subgroup, Left and right cosets gHgH and HgHg of a subgroup, For n1n\ge 1, every class in Z/n\mathbb{Z}/n has one representative rr with 0r<n0\le r<n, so Z/n=n\lvert\mathbb{Z}/n\rvert=n; while Z/0\mathbb{Z}/0 is in bijection with Z\mathbb{Z}).

[F3]

Two sets are equinumerous when a bijection between them exists (Equinumerous sets, ABA \approx B and ABA \preceq B, Injection, surjection, bijection).

[F4]

Multiplication by a nonzero integer can be cancelled: if xz=yzxz=yz and z0z\ne0, then x=yx=y (The integers have no zero divisors; multiplicative cancellation).

Counterexample

technique · direct
1.1

The two cosets are 2Z2\mathbb Z and 1+2Z1+2\mathbb Z. Indeed [F2] writes every integer as a=2q+ra=2q+r with r{0,1}r\in\{0,1\}; then a+2Z=r+2Za+2\mathbb Z=r+2\mathbb Z, since a+2k=r+2(q+k)a+2k=r+2(q+k) and, conversely, r+2t=a+2(tq)r+2t=a+2(t-q). Thus every coset is one of the displayed two, and they are distinct because one contains 00 while the other does not. Hence [Z:2Z]=2[\mathbb Z:2\mathbb Z]=2.

F1F2
1.2

The map f:Z2Zf:\mathbb Z\to2\mathbb Z given by f(k)=2kf(k)=2k is surjective by the definition of 2Z2\mathbb Z and injective because 2k=22k=2\ell implies k=k=\ell by cancellation at the nonzero factor 22. Hence it is a bijection.

F3F4construct
2.1

Thus the proper subgroup 2Z2\mathbb Z has finite index and is equinumerous with Z\mathbb Z, refuting the statement.

step 1.1step 1.2F1
CounterexampleConstruction: AI-adaptedVerification: AI-generatedprecheck passaudited 2026-08-01Open item page →

The product set HKHK of two subgroups need not be a subgroup

Statement refuted

For any two subgroups H,KGH,K\le G, the product set HK={hk:hH, kK}HK=\{hk:h\in H,\ k\in K\} is a subgroup of GG.

Facts & Assumptions

Given: The group S3=Sym({1,2,3})S_3=\operatorname{Sym}(\{1,2,3\}), and the subgroups H={e,(12)}H=\{e,(12)\} and K={e,(23)}K=\{e,(23)\}.

Counterexample

technique · direct
1.1

The six elements of S3S_3 are e,(12),(13),(23),(123),(132)e,(12),(13),(23),(123),(132), so S3=6|S_3|=6.

F1
1.2

Direct multiplication gives HK={e,(12),(23),(12)(23)}={e,(12),(23),(123)}HK=\{e,(12),(23),(12)(23)\}=\{e,(12),(23),(123)\}, a set of four distinct elements.

F1
2.1

If HKHK were a subgroup, [L1] would force ι(4)ι(6)\iota(4)\mid\iota(6) in Z\mathbb Z, that is 464\mid6, which is false. Hence HKHK is not a subgroup.

step 1.1step 1.2L1
False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passaudited 2026-08-01Open item page →

Every left coset of a subgroup is itself a subgroup

Statement

Every left coset gHgH of every subgroup HGH\le G is a subgroup of GG.

Facts & Assumptions

Given: The group S3S_3, the subgroup H={e,(12)}H=\{e,(12)\} and the element g=(123)g=(123) from A left coset that is not the corresponding right coset in Sym({1,2,3})\operatorname{Sym}(\{1,2,3\}).

[F2]

Every subgroup contains the identity element (Subgroup).

Refutation

technique · direct
1.1

Neither (123)(123) nor (13)(13) is the identity, so egHe\notin gH.

F1
2.1

By [F2], the set gHgH cannot be a subgroup. This single coset refutes the statement.

step 1.1F2

Sources