Alphabeta Math
LemmaStatement: 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 local full-defect block induces to a global block of defect D

Statement

Fix DG a p-subgroup and N=NG(D). For every block b=kNe with defect group D, bG is defined and has defect group D. Its idempotent f satisfies BrD(f)=e. This proof is choice-free.

Facts & Assumptions

Given: The finite groups, splitting residue field and nonzero local block.

[F2]

Centralizer containment makes block induction well-defined defines bG and gives its central character.

[F3]

Defect groups are maximal Brauer support identifies defect groups with maximal nonzero support.

[F4]

Idempotents lift through finite commutative quotients by Idempotents lift through finite commutative algebra quotients.

[F5]

Brauer homomorphism is multiplicative gives the algebra homomorphism on fixed elements.

[F6]

Brauer homomorphism for a p subgroup gives coefficient projection.

[F8]

Modular block central characters correspond to blocks supplies the finite block idempotents and their identifying scalar values.

Proof

1.1

We first record the elementary normalizer condition: if P<T are finite p-groups, let P act on T/P by left multiplication. Nonfixed orbit sizes are divisible by p, and [T:P] is divisible by p. The fixed points are NT(P)/P and include the identity coset, so their positive cardinality is divisible by p; hence NT(P)>P. Now if x has nonzero coefficient in e, F1 puts xCG(D). By F7 take a Sylow subgroup T of CG(x) containing D. If T>D, its subgroup R=NT(D)>D lies in N and centralizes x. The coefficient of x survives BrR(e) by F6, contradicting F3 for the local block. Thus D is Sylow in CG(x) for every support element x of e.

F1F3F6F7algebra
2.1

Suppose y=gxg1 also centralizes D, with x in that support. Both gDg1 and D are Sylow in CG(y): the first by step 1.1, and the second by equal order and DCG(y). F7 supplies cCG(y) with cgDg1c1=D. Then cgN and (cg)x(cg)1=y. Since e is central in kN, its coefficients at x and y agree. Therefore its coefficients are constant on every intersection of a G-conjugacy class with CG(D), with zero throughout intersections missing the support. Give each full G-class that common coefficient, zero for a class disjoint from CG(D). This finite class sum is aZ(kG) with BrD(a)=e by F6.

F6F7step 1.1algebra
3.1

By F5 the image of Z(kG) is a finite commutative quotient algebra. Its idempotent e, present by step 2.1, lifts by F4 to a central idempotent ukG. Write u as a sum of distinct global primitive block idempotents fj using F8. Their Brauer images are orthogonal idempotents, central in kN because N normalizes D, and sum to e. Since e is primitive in Z(kN), exactly one image equals e and all others are zero. Let f be that block idempotent and B=kGf. F2 applies because CG(D)N and gives λbG(f)=λb(e)=1. F8 forces bG=B.

F2F4F5F8step 2.1algebra
4.1

Its Brauer image at D is nonzero. If S>D had BrS(f)0, put R=NS(D)>D by step 1.1. Then DRN. Since CG(S)CG(R)CG(D), F6 gives BrR(e)=BrR(f)0: a nonzero coefficient retained at S is still retained at R. This contradicts F3 for the local block e. Thus no such S exists, and F3 proves D is a global defect group of B. For D=1 the normalizer is G, and the proof gives the original defect-zero block; when no local defect-D block exists the universal assertion has no inputs. All lifting and subgroup selections here concern finite sets, so no AC or stronger Green restriction theorem is used.

F3F6step 1.1step 3.1algebra

Depends on

Used by

Dependency tree · two levels

29 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