Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-13
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.

Brauer–Green block compatibility

Statement

Let QG be a p-subgroup, let HG contain QCG(Q), and let V be an indecomposable finite-dimensional kG-module with vertex Q. If UResHGV is indecomposable with vertex Q, and U,V belong to blocks b,B respectively, then bG is defined and equals B. This is choice-free over a splitting residue field.

Facts & Assumptions

Given: The stated modules, subgroups and blocks. Write b=kHe and B=kGf.

[F1]

A block induced from a subgroup defines the block summand condition.

[F2]

Centralizer containment makes block induction well-defined proves definedness under centralizer containment.

[F4]

Tensoring preserves relative projectivity for finite-group modules preserves exclusion of vertices containing conjugates of Q.

[F6]

Vertices of modules in a block lie in a defect group bounds the vertex of U by a defect group of b.

[F7]

The double action (x,y)v=xvy1 and diagonal notation are fixed by Block bimodule for the double group.

Proof

1.1

By F6 choose a defect group Db of b containing the literal Q, after conjugating inside H. Then CG(Db)CG(Q)H, so F2 defines bG. Suppose for contradiction bGB. F1 implies b is not a summand of ResH×HB.

F1F2F6algebra
2.1

Set M=HtHHk[HtH]. The double-coset decomposition gives kG=kHM as H×H-modules under F7's double action, and left multiplication by e gives ekG=beM. This multiplication is an H×H-linear idempotent because e is central in kH. Similarly eB is a direct summand of both B restricted and ekG. The first conclusion in step 1.1 excludes b from eB. By F5 every indecomposable summand of eB must therefore come from eM, so eB is a summand of eM, hence of M.

For an off-identity double coset HtH, its permutation module is induced from a point stabilizer. If one of its indecomposable summands had a vertex containing an (H×H)-conjugate of ΔQ, F3's vertex containment would put a conjugate of ΔQ inside a conjugate point stabilizer. Thus some point tHtH would be fixed by (a,b)ΔQ(a,b)1 for some a,bH. The fixed-point equation says that a1tb centralizes Q. But a1tb is still in HtH, while CG(Q)H; hence HtH=H, a contradiction. Therefore no indecomposable summand of M, and thus none of eB, has a vertex containing an (H×H)-conjugate of ΔQ. [F3, F5, F7, step 1.1, algebra]

3.1

Restrict eB to ΔH. For each of its indecomposable summands with vertex T, F3's Mackey decomposition puts every vertex of a restricted indecomposable inside a ΔH-conjugate of ΔHxTx1 for some xH×H. If such a vertex contained a conjugate of ΔQ, then T would contain an (H×H)-conjugate of ΔQ, contrary to step 2.1. Identifying H with ΔH gives the conjugation action h:ahah1 on eB. Thus this kH-module has no summand whose vertex contains an H-conjugate of Q. F4 gives the same exclusion for eBkeV with diagonal action.

F3F4step 2.1algebra
4.1

Define i:eVeBeV by i(v)=efv, and r:eBeVeV by r(av)=av. The first is H-linear because h(ef)h1=ef; the second is H-linear because (hah1)(hv)=h(av). Its image lies in eV since ea=a. Since fV=V and ev=v on eV, their composite is ri(v)=efv=v. Hence eV is a summand of this tensor. Also eU=U because U belongs to b, so the given splitting of U from the restriction of V, after applying e, splits U from eV. Consequently U is a summand of eBeV.

step 3.1algebra
5.1

This contradicts step 3.1, since U has vertex Q. Therefore bG=B. If Q=1, the centralizer condition forces H=G and the conclusion is the identity block assignment. If H=G directly, the same conclusion holds. The nonzero module U ensures the splittings in step 4.1 cannot be vacuous. All tensor maps and decompositions are finite and require no AC.

step 1.1step 3.1step 4.1algebra

Depends on

Used by

Dependency tree · two levels

21 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