Alphabeta Math
ExampleConstruction: AI-adaptedVerification: 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.

The trivial-defect-group and identity-normalizer boundaries

Example

For D=1, one has NG(D)=G, and Brauer's First Main Theorem is the identity bijection on defect-zero blocks. More generally, if NG(D)=G, its defect-D bijection is the identity, including when the relevant set is empty. No AC is required.

Facts & Assumptions

Given: A finite group and splitting residue field of characteristic p, with a fixed p-subgroup D.

[F1]

Brauer's First Main Theorem specifies the fixed-defect bijection by induction.

[F2]

Defect zero blocks are simple algebras identifies trivial-defect blocks with full matrix blocks, each having one projective simple module.

[F3]

A block induced from a subgroup uses the unique block containing the block-bimodule restriction summand.

Proof

1.1

If NG(D)=G, restriction from G×G to itself changes no module. A block bimodule B occurs in itself. It cannot occur in another block B: the central idempotent of B acts as identity on B and as zero on B, hence on all its summands. Thus F3 gives BG=B, and F1's map and inverse are the identity on the set of blocks with defect group D. This proves both directions of the correspondence directly.

F1F3algebra
2.1

For D=1, every group element normalizes D, so step 1.1 applies. The numerical defect is logpD=0, and F2 says exactly these blocks are full matrix algebras with one projective simple module. If there are no such blocks, the identity has empty domain and codomain: its injectivity condition and the assertion that every codomain element has a preimage are both vacuous. The same reasoning handles an empty defect-D set whenever D is normal. The zero algebra is not inserted as a block. All these identity and idempotent calculations are choice-free.

F2step 1.1algebra

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

15 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