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

Maximal Brauer pairs detect defect groups

Statement

A b-Brauer pair (D,e) is maximal if and only if D is a defect group of b.

Facts & Assumptions

Given: A b-Brauer pair (D,e) over a field of characteristic p.

[F1]

Every maximal pair has a defect subgroup. (Maximal Brauer pairs exist and are conjugate)

[F2]

Defect groups are exactly maximal nonzero support subgroups. (Defect groups are maximal Brauer support)

[F3]

Pair inclusion entails subgroup inclusion and is equality at equal subgroups. (Brauer pair order is independent of the normal chain)

Proof

technique · direct
1.1

If (D,e) is maximal, [F1] states and proves that D is a defect group. Its hypotheses hold because this is a b-pair.

F1
2.1

Conversely assume D is a defect group and (D,e)(P,f) for a b-pair. Then DP by [F3] and BrP(b)f=f0, so P has nonzero support. Maximality in [F2] forces P=D. Inclusion at equal subgroups in [F3] now forces f=e. Thus no strictly larger pair exists.

F2F3

Sources

Jacobsen, Block fusion systems and the center of the group ring, Lemma 2.32 and Theorem 2.33, pp.18–19; general-field lifting proved locally. Local argument and conventions as displayed above.

Depends on

Used by

Dependency tree · two levels

20 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