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.
Transfer is independent of the transversal
Statement
Let be a finite group, let be a subgroup, let be an abelian group written multiplicatively, and let be a homomorphism (Transfer homomorphism for a finite index subgroup). Let and be two choices of representatives of the right cosets of in , and let
be the two products formed from them, where . Then for every . In particular the transfer is a well-defined function depending only on .
Facts & Assumptions
Given: A finite group , a subgroup , an abelian group , a homomorphism , and two transversals , of the right cosets as in Transfer homomorphism for a finite index subgroup.
For every the coset is a right coset of , the assignment is a permutation of , each lies in , and the finite product of elements of the abelian group is independent of the order of its factors (Transfer homomorphism for a finite index subgroup).
If represent the same right coset of , that is , then ; conversely implies ( iff , and iff , Left and right cosets and of a subgroup).
For all the homomorphism satisfies , and (A group homomorphism automatically satisfies and , and for every ; for monoid homomorphisms preservation of the identity must be assumed, Monoid homomorphism and group homomorphism).
The map is a bijection of the finite set , so a product indexed by may be reindexed along it (The coset set and the index of a subgroup, Transfer homomorphism for a finite index subgroup).
Proof
For every one has for some : both and represent the coset , so by [F2], and is the desired element.
For and the product equals , because and by step 1.1; hence by [F3].
The reindexing is a bijection of by [F4], so by [F3].
Consequently : the product over of the three factors of step 2.1 may be rearranged because is abelian, by [F1].
Therefore , the two outer factors cancelling because multiplication in the abelian group commutes.
Since was arbitrary, ; the transfer is therefore independent of the choice of transversal. ∎
Depends on
- Transfer homomorphism for a finite index subgroup
- $x\in aH$ iff $a^{-1}x\in H$, and $aH=bH$ iff $a^{-1}b\in H$
- Left and right cosets $gH$ and $Hg$ of a subgroup
- A group homomorphism automatically satisfies $f(e) = e'$ and $f(g^{-1}) = f(g)^{-1}$, and $f(g^{n}) = f(g)^{n}$ for every $n \in \mathbb{Z}$; for monoid homomorphisms preservation of the identity must be assumed
- Monoid homomorphism and group homomorphism
- The coset set $G/H$ and the index $[G:H]$ of a subgroup
Used by
Dependency tree · two levels
26 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Paul Flavell, An Introduction to Transfer and Fusion in Finite Groups, §§2–5 (standard reference, not scraped)
- Hans Kurzweil and Bernd Stellmacher, The Theory of Finite Groups, §§7.1–7.2 (standard reference, not scraped)