Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6.1-sol)audited 2026-10-08
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.

Induction commutes with an external tensor factor

Statement

Let C≤P and D≤Q be subgroups of finite groups. Let X be a finite-dimensional complex C-module and Y a finite-dimensional complex D-module, and let X⊠Y be the external tensor product, a (C×D)-module (Subgroup, The external direct product G×H with componentwise multiplication, G×H is a group with identity (eG,eH), coordinatewise inverses, and homomorphic coordinate projections, A finite-dimensional representation ρ:G→GL⁡(V) over a field, and its degree, The tensor product of two complex representations). Then:

(i) There is a natural isomorphism of complex (P×Q)-modules

Ind⁡C×DP×Q(X⊠Y)≅(Ind⁡CPX)⊠(Ind⁡DQY).

On characters, Ind⁡C×DP×Q(χ⊠ψ)=(Ind⁡CPχ)⊠(Ind⁡DQψ) in R(P×Q) (The induced character Ind⁡HGχ of a complex character, Virtual characters and the character ring R(G) of a finite group).

(ii) If D=Q, this reads Ind⁡C×QP×Q(X⊠Y)≅(Ind⁡CPX)⊠Y. If also C=P, then Ind⁡PPX≅X. No choice principle is used.

Facts & Assumptions

Given: Finite groups P,Q, subgroups C≤P,D≤Q, and finite-dimensional complex modules X,Y for C,D.

[F1]

The componentwise product P×Q is a group; the product C×D is a subgroup, with identity, products, and inverses inherited coordinatewise (The external direct product G×H with componentwise multiplication, G×H is a group with identity (eG,eH), coordinatewise inverses, and homomorphic coordinate projections, Subgroup).

[F2]

For a finite-index inclusion H≤G and a commutative ring R, the covariant-function model of Ind⁡HGW is naturally isomorphic to R[G]⊗R[H]W (The induced R-linear G-module Ind⁡HGW as H-covariant functions on G, The function model of induction agrees with the tensor-product model k[G]⊗k[H]W).

[F3]

The group ring R[G] has basis [g] and multiplication [g][h]=[gh]. For a subgroup H≤G, the basis inclusion R[H]↪R[G] respects multiplication, so R[G] is an (R[G],R[H])-bimodule (The group ring R[G] of finitely supported formal R-linear combinations of group elements, The group ring R[G] is a unital R-algebra with basis G, and each g∈G is a unit of R[G], (S,R)-bimodules and commuting left and right scalar actions).

[F5]

The external tensor product has action (c,d)(x⊗y)=cx⊗dy (The tensor product of two complex representations).

[F6]

The character of a tensor product representation is the product of its characters (Characters add on direct sums, multiply on tensor products, and conjugate on duals).

[F7]

Ind⁡HGχW is the character of the induced representation (The induced character Ind⁡HGχ of a complex character).

[F8]

A finite-dimensional representation over a field is a finite-dimensional vector space with a group action (A finite-dimensional representation ρ:G→GL⁡(V) over a field, and its degree).

[F9]

The character ring R(G) is the integral span of honest complex characters (Virtual characters and the character ring R(G) of a finite group).

Proof

technique · direct
1.1F1F3givenalgebra

Since C≤P and D≤Q, the componentwise product C×D contains the identity and is closed under products and inverses in P×Q, so it is a subgroup. The basis inclusion C[C×D]↪C[P×Q] respects multiplication, giving the right subgroup-ring action used below. All three group indices are finite.

1.2F2F3F4F5givenconstruct

On group-basis and module generators define Φ([(p,q)]⊗(x⊗y)):=([p]⊗x)⊗([q]⊗y). For fixed (p,q), the formula is complex-bilinear in x,y, so it descends to X⊗CY. For (c,d)∈C×D, the images of [(pc,qd)]⊗(x⊗y) and [(p,q)]⊗(cx⊗dy) both equal ([p]⊗cx)⊗([q]⊗dy). Thus the pairing is balanced over C[C×D], and [F4] gives a well-defined map on the source tensor product.

1.3F2F3F4F5givenconstruct

Define Ψ(([p]⊗x)⊗([q]⊗y)):=[(p,q)]⊗(x⊗y). Moving c∈C across the first factor preserves its value because [(pc,q)]=[(p,q)(c,1)] and the balanced relation moves (c,1) to the action cx; the same check with d∈D uses [(p,qd)]=[(p,q)(1,d)]. The formula is complex-bilinear in the two outer factors, so [F4] gives a well-defined reverse map.

2.1F2F3F8step 1.1

The finite group rings in [F3] have finite bases, so their tensor models on the finite-dimensional inputs [F8] are finite-dimensional. Apply [F2] with R=C to the subgroup inclusions C×D≤P×Q, C≤P, and D≤Q; it identifies the induction terms with the group-ring tensor models used above.

2.2F3F4step 1.2step 1.3

The composites ΨΦ and ΦΨ fix every displayed group-basis and pure-tensor generator. These generators span their respective tensor products by [F3, F4], so the composites are identity maps and Φ is an isomorphism.

2.3F2F5step 1.2

Left multiplication by (p0,q0) sends [(p,q)] to [(p0p,q0q)], which Φ sends to the corresponding left actions on both target factors. The same formula commutes with C- and D-module homomorphisms on X,Y, so the isomorphism is (P×Q)-equivariant and natural.

3.1F1F2step 2.2step 2.3

The tensor-model identifications in step 2.1 turn Φ into the module isomorphism in (i). If D=Q, the canonical map C[Q]⊗C[Q]Y→Y, [q]⊗y↦qy, is an isomorphism with inverse y↦[eQ]⊗y; if also C=P, the same identity gives Ind⁡PPX≅X. Thus (ii) holds.

4.1F3F6F7F8F9step 3.1∎

Since X,Y are finite-dimensional [F8] and the finite group rings in [F3] have finite bases, the tensor models of step 2.1 are finite-dimensional and have characters. Taking characters of the isomorphism in step 3.1 and applying [F6] to the two representations pulled back along the coordinate projections of P×Q gives the stated identity in R(P×Q) by [F7] and [F9]. All maps were defined explicitly, so no choice principle is used.

Depends on

Used by

Dependency tree · two levels

45 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