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.
Every left or right coset of is equinumerous with
Statement
If and , then the maps
and
are bijections. Thus every left and right coset of is equinumerous with .
Facts & Assumptions
Given: A group , a subgroup , and .
The cosets are and (Left and right cosets and of a subgroup).
A map is bijective when it is injective and surjective; two sets are equinumerous when a bijection between them exists (Injection, surjection, bijection, Equinumerous sets, and ).
Left and right cancellation hold in a group (Cancellation in a group: or forces ; equivalently left and right translation by are bijections of , so and each have exactly one solution).
Proof
The map , , is surjective by the definition of and injective because implies by left cancellation.
The map , , is surjective by the definition of and injective by right cancellation.
Both maps are bijections. Thus is equinumerous with each coset; moreover is a bijection, so , and are pairwise equinumerous.
Depends on
- Left and right cosets $gH$ and $Hg$ of a subgroup
- Cancellation in a group: $gx = gy$ or $xg = yg$ forces $x = y$; equivalently left and right translation by $g$ are bijections of $G$, so $gx = h$ and $xg = h$ each have exactly one solution
- Injection, surjection, bijection
- Equinumerous sets, $A \approx B$ and $A \preceq B$
Used by
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 21 results over 12 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
- Thomas W. Judson, Abstract Algebra: Theory and Applications, Cosets and Lagrange's Theorem (standard reference, not scraped)
- Thomas W. Judson, Abstract Algebra: Theory and Applications, §6.1: Cosets (standard reference, not scraped)
- Thomas W. Judson, Abstract Algebra: Theory and Applications, §6.2: Lagrange's Theorem (standard reference, not scraped)