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.
A graph subgroup is a complement exactly for a crossed homomorphism
Statement
Let act on a group . A function is a crossed homomorphism if and only if its graph subset
is a complement to the canonical copy of in .
Facts & Assumptions
Given: A group action of on , and the semidirect product .
A crossed homomorphism satisfies (Crossed homomorphism for a G-group).
The graph subset is in the semidirect product (The graph subgroup attached to a map into a semidirect product).
The semidirect-product multiplication is and the canonical copy of is the kernel of the projection to ( The semidirect-product multiplication makes a group, The canonical copy of is normal, the canonical copy of is a complement, and conjugation induces the action).
Proof
Suppose is a crossed homomorphism. Then , so [L1] and [L3] show that is closed under products. The identity is , and inverses also stay in , so is a subgroup.
Conversely, suppose is a complement. Since it is a subgroup, the product of and again lies in . Comparing second coordinates gives , and then [L3] forces . So is a crossed homomorphism.
The projection restricts to a bijection by [L2], so intersects the kernel trivially and multiplies with that kernel to all of . Hence is a complement to the canonical copy of .
Steps 1.1-1.2 and 2.1 prove the equivalence.
Depends on
Used by
Dependency tree · two levels
10 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
- David A. Craven, Finite Group Theory (standard reference, not scraped)