Alphabeta Math
CorollaryStatement: 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.

Every block contains a module whose vertex is a full defect group

Statement

Assume AC. Every block B of kG with defect group D contains a nonzero indecomposable finite-dimensional module whose vertex is the actual subgroup D.

Facts & Assumptions

Given: A finite group, splitting residue field and block with fixed defect group.

[A1]

The Axiom of Choice is used only through the Green correspondence below.

[F1]

The Brauer correspondent of a block supplies the defect-D block b in N=NG(D).

[F2]

Brauer–Green block compatibility identifies blocks of matching-vertex restriction summands.

[F3]

Every finite-dimensional module has a projective cover, unique up to isomorphism over the target constructs finite-dimensional projective covers as summands of finite free modules.

[F4]

Indecomposable projective kG-modules correspond to simple modules through taking the head makes the projective cover of a simple module indecomposable.

[F6]

Block defect groups are p radical gives D=Op(N).

[F7]

Green correspondence for modules of vertex exactly p supplies the inverse fixed-vertex Green correspondence under AC.

[F8]

Restriction to a containing p subgroup retains a vertex retains a vertex on restriction to a containing p-subgroup.

[F9]

p-blocks from primitive central idempotents supplies the block-idempotent decompositions.

[F12]

Relative projectivity mackey intersections for finite modules gives vertex containment for relatively projective modules.

Proof

1.1

Take b from F1. It is nonzero, so a proper left ideal of largest dimension in b gives a nonzero simple quotient S. Extending by zero on the other blocks makes it a simple kN-module. By F6, D=Op(N), in particular DN, and F5 makes D act trivially on S. Thus S is a simple module of the finite-dimensional quotient group algebra k[N/D].

F1F5F6F9algebra
2.1

Take its projective cover PS over k[N/D] using F3; it is finite dimensional, nonzero and indecomposable by F4. Inflate to N. The action factors through the quotient, so its submodules and endomorphisms are unchanged and it stays indecomposable. The central idempotents in F9 decompose P into block pieces. The piece for b maps onto S, since the idempotent of b acts as identity on S. It is therefore nonzero, and indecomposability forces that piece to be all of P. Thus P lies in b.

F3F4F9step 1.1algebra
3.1

F3 realizes P as a summand of a finite free k[N/D]-module. Inflating k[N/D] gives the permutation module IndDNk: the map n1nD identifies their bases and actions. Hence P is relatively D-projective. By F11 and F12 it has a vertex RD, after conjugating in N (normality of D retains this containment). On restriction to D, P is a nonzero direct sum of trivial one-dimensional modules, since all of D acts trivially. The trivial kD-module has vertex D: for E<D, every scalar endomorphism has relative trace [D:E]a=0 in characteristic p, whereas the identity is nonzero, so F10 excludes relative E-projectivity. F8 applied to RD says the restriction of P has a summand with vertex R. All its indecomposable summands are trivial and have vertex D, forcing R=D.

F3F8F10F11F12step 1.1step 2.1algebra
4.1

Apply F7 under A1 to P for N=NG(D). Its inverse correspondent V is a nonzero indecomposable kG-module with vertex D, and PResNGV. F2 applies with Q=D, since DCG(D)N, and identifies the block of V as bG=B. This is the desired module. If D=1, the correspondence is identity and the cover already provides the module in B. The nonzero simple quotient guarantees no zero object enters. The finite ideal, cover and trace calculations are choice-free; AC is inherited only from F7's declared finite-length chain and selection argument.

A1F1F2F7step 2.1step 3.1algebra

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

38 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