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.
If , then , , and only finitely many subgroups contain
Statement
Let have finite index , and put . Then , the index divides , and there are only finitely many subgroups with .
Facts & Assumptions
Given: A group , a subgroup of finite index , and .
The action on gives a homomorphism whose kernel is (Left multiplication on is transitive, has stabiliser at , and has kernel ).
The core is normal in , lies in , and contains every normal subgroup of lying in ( is the largest normal subgroup of contained in ).
First isomorphism gives (First isomorphism theorem for groups: ).
The symmetric group of a set is its group of bijections (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).
A set with elements has exactly bijections to itself (A finite set with has exactly bijections onto itself, and bijections onto any set of the same cardinality, The factorial and the falling factorial , defined by recursion in ).
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 canonical projection is a surjective homomorphism (The canonical projection , , is a surjective group homomorphism, The quotient group and coset product ).
The power set of a finite set is finite ( for finite ).
Every subset of a finite set is finite (A subset of a finite set is finite, with , and equality holds if and only if ).
For a finite-index subgroup, the index is the cardinality of its coset set (The coset set and the index of a subgroup, The cardinality of a finite set).
Proof
By [L1] and [L2], the coset action has kernel with , and its image is a subgroup of .
By [L3], . The set has elements by [L10], so [L5] gives ; [L6] therefore gives , that is, by [L10].
Every subgroup containing also contains by [L2]. If , then for some , so and hence ; thus . Therefore injects the set of such overgroups into the power set of the now known finite set , which is finite by [L8] and [L9].
Thus the core is normal and finite-index, its index divides , and the collection of subgroups containing is finite.
Depends on
- Left multiplication on $G/H$ is transitive, has stabiliser $H$ at $H$, and has kernel $\operatorname{Core}_G(H)$
- $\operatorname{Core}_G(H)$ is the largest normal subgroup of $G$ contained in $H$
- First isomorphism theorem for groups: $G/\ker f\cong\operatorname{im}f$
- The symmetric group $\operatorname{Sym}(X)$: the bijections of a set $X$ under composition
- $\operatorname{Sym}(X)$ is a group under composition, and it is non-abelian whenever $X$ has at least three distinct elements
- A finite set $A$ with $\lvert A\rvert = n$ has exactly $n!$ bijections onto itself, and $n!$ bijections onto any set of the same cardinality
- The factorial $n!$ and the falling factorial $n^{\underline{k}}$, defined by recursion in $\mathbb{N}$
- Lagrange's theorem: $|G|=[G:H]|H|$ for every subgroup $H$ of a finite group $G$
- The coset set $G/H$ and the index $[G:H]$ of a subgroup
- The cardinality $\lvert A\rvert$ of a finite set
- The quotient group $G/N$ and coset product $(gN)(hN)=ghN$
- The canonical projection $\pi:G\to G/N$, $\pi(g)=gN$, is a surjective group homomorphism
- $\lvert\mathcal{P}(A)\rvert = 2^{\lvert A\rvert}$ for finite $A$
- 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$
Used by
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 118 results over 25 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
- K. Conrad, Group Actions, Theorem 6.8 (standard reference, not scraped)