Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-sol)audited 2026-09-27
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 a homomorphism

Statement

Let G be a finite group, H≤G, A an abelian group written multiplicatively, φ:H→A a homomorphism, and Vφ:G→A the transfer of Transfer homomorphism for a finite index subgroup, formed with a transversal {tα} of the right cosets H\G (the result is independent of the transversal by Transfer is independent of the transversal). Then

Vφ(xy)=Vφ(x) Vφ(y)for all x,y∈G;

that is, the transfer is a group homomorphism G→A.

Facts & Assumptions

Given: A finite group G, a subgroup H≤G, an abelian group A, a homomorphism φ:H→A, a transversal {tα}α∈H\G and the transfer V(x)=∏α∈H\Gφ(tαxtαx−1) of Transfer homomorphism for a finite index subgroup.

[F1]

The assignment α↦αx=Htαx is a right action of G on the finite set H\G, so α(xy)=(αx)y and α↦αx is a permutation of H\G with inverse α↦αx−1; furthermore tαxtαx−1∈H (Transfer homomorphism for a finite index subgroup).

[F2]

The transfer does not depend on the transversal (Transfer is independent of the transversal).

[F4]

The product of finitely many elements of the abelian group A is independent of the order of the factors, and H\G is finite (Transfer homomorphism for a finite index subgroup, Left and right cosets gH and Hg of a subgroup).

Proof

technique · direct
1.1

For x,y∈G and α∈H\G, the identity tαxy tαxy−1=(tαxtαx−1)(tαxytαxy−1) holds: the middle factor tαx−1tαx cancels, and (αx)y=α(xy) by [F1].

F1algebra
2.1

Both bracketed factors of step 1.1 lie in H by [F1], so applying φ gives φ(tαxy tαxy−1)=φ(tαxtαx−1) φ(tαxytαxy−1) by [F3].

F3step 1.1
3.1

Hence V(xy)=∏αφ(tαxtαx−1) φ(tαxytαxy−1), the product of the two factors over α; since A is abelian this equals (∏αφ(tαxtαx−1))(∏αφ(tαxytαxy−1)) by [F4].

F4step 2.1
4.1

The reindexing β:=αx runs over H\G as α does, by the permutation property in [F1], so ∏αφ(tαxytαxy−1)=∏βφ(tβytβy−1)=V(y).

F1step 3.1
5.1

Since V does not depend on the chosen transversal by [F2], the value V(x) is well defined for every x∈G; combining steps 3.1 and 4.1, V(xy)=V(x) V(y) for all x,y∈G, so V is a homomorphism. ∎

F2step 3.1step 4.1

Depends on

Used by

Dependency tree · two levels

24 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