Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-12
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.

Block defect is an intersection of two sylow subgroups

Statement

If D is a defect group of a block b of kG and P is any Sylow p-subgroup containing D, there exists hCG(D) such that D=PhPh1.

Facts & Assumptions

Given: A finite group, field of characteristic p, block and subgroups as stated.

[F1]

By definition, saying that D is a defect group of b means that ΔD is a vertex of the indecomposable block bimodule B=kGb. (Defect group and numerical defect of a block)

[F2]

Finite restriction and induction splittings respect the double-coset decomposition. (Relative projectivity mackey intersections for finite modules)

[F3]

Restriction to P×P retains an indecomposable summand with vertex ΔD. (Restriction to a containing p subgroup retains a vertex)

[F4]

A transitive permutation module for a p-group is indecomposable with its stabilizer as a vertex. (Transitive p-group permutation modules have point-stabilizer vertices)

[F5]

An indecomposable direct summand occurs in any finite indecomposable decomposition. (Finite-dimensional kG-modules decompose as finite direct sums of indecomposables uniquely up to order and isomorphism)

[F6]

Vertices of an indecomposable module are conjugate within the ambient group. (Vertices exist for indecomposable modules, are conjugate in G, and sources are conjugate by the appropriate normalizer)

Proof

technique · direct
1.1

Put R=P×P. The source existence in [F6] and the vertex in [F1] allow [F3] with ambient group G×G. Thus ResRB has an indecomposable summand U with vertex ΔD. Multiplication by the central idempotent b splits B from kG as a bimodule; restriction preserves this splitting, as in [F2]. Hence UResRkG.

F1F2F3F6
2.1

The action on the basis G is (a,c)g=agc1, so its orbits are PgP and the stabilizer of g is Lg={(a,g1ag):aPgPg1}. Indeed agc1=g is equivalent to c=g1agP. Mapping a coset in R/Lg to its translate of g gives an equivariant bijection. Thus ResRkG=gP\G/Pk[R/Lg].

step 1.1
3.1

By [F4] each summand is indecomposable with vertex Lg. By [F5], U is isomorphic to one such summand. Vertex conjugacy in the group R, using [F6], gives r,sP with ΔD=(r,s)Lg(r,s)1. Projecting to the first coordinate gives D=r(PgPg1)r1.

F4F5F6step 1.1step 2.1
4.1

For dD, membership of (d,d) in this conjugate stabilizer says r1dr=g(s1ds)g1. Put h=rgs1. Rearranging gives d=hdh1 for every d, so hCG(D). Since r,sP, step 3.1 yields D=PrgPg1r1=PhPh1. This calculation explicitly handles the twisted diagonal stabilizer.

step 3.1

Sources

Webb, A Course in Finite Group Representation Theory, §§11.3, 11.6 and 12.3–12.5, especially pp.240–245. Local argument and conventions as displayed above.

Depends on

Used by

Dependency tree · two levels

13 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