Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-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.

A block induced from a subgroup

Definition

Fix a splitting p-modular system for finite G, with residue field k, and HG. For a primitive central idempotent e of kH, write b=kHe as the indecomposable double-group module of Block bimodule for the double group. A block B of kG is induced from b, denoted bG=B, if it is the unique block for which bResH×HG×GB. Here XY means there are module maps i:XY, r:YX with ri=idX; equivalently YXkerr.

Blocks are the actual ideals belonging to p-blocks from primitive central idempotents, not a choice of isomorphic copies. Distinct blocks kGf,kGf are nonisomorphic as bimodules: left multiplication by f is the identity on the first and zero on the second, and every bimodule isomorphism would intertwine these operators. The finite multiplicities of indecomposable summands are well-defined by Finite-dimensional kG-modules decompose as finite direct sums of indecomposables uniquely up to order and isomorphism.

If no block, or more than one block, has the splitting property, bG is undefined. The definition never assigns a value in those cases. For H=G the indecomposable block b is its own unique such block, so bG=b. No infinite family of choices is required by this definition. A central-character formula is a further theorem under additional hypotheses, not part of this definition.

Depends on

Used by

Dependency tree · two levels

6 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