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.
In a finite group, the subgroup, every coset and the set of cosets are finite
Statement
Let be a finite group and . Then , every left and right coset of , and the coset set are finite. Moreover every coset has cardinality , and is a natural number.
Facts & Assumptions
Given: A finite group and a subgroup .
Every subset of a finite set is finite (A subset of a finite set is finite, with , and equality holds if and only if ).
The power set of a finite set is finite ( for finite ).
Every left or right coset of is equinumerous with (Every left or right coset of is equinumerous with ).
A bijection transports finiteness and finite cardinality (The cardinality of a finite set).
The coset set is , and its finite cardinality is the index (The coset set and the index of a subgroup, The left cosets of a subgroup partition the group).
Proof
Since and is finite, is finite by [L1].
Every coset is a subset of , so . The power set is finite by [L2], hence is finite by [L1].
Every coset is equinumerous with , so every coset is finite and has cardinality .
Therefore , and the finiteness and cardinality assertions are steps 1.1, 1.2 and 2.1.
Depends on
- The coset set $G/H$ and the index $[G:H]$ of a subgroup
- The left cosets of a subgroup partition the group
- Every left or right coset of $H$ is equinumerous with $H$
- The cardinality $\lvert A\rvert$ of a finite set
- A subset of a finite set is finite, with $\lvert B\rvert \le \lvert A\rvert$, and equality holds if and only if $B = A$
- $\lvert\mathcal{P}(A)\rvert = 2^{\lvert A\rvert}$ for finite $A$
Used by
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 71 results over 26 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)