Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: 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.

Blocks and defect groups of s3

Example

For a splitting field k and G=S3, put a=(123). In characteristic 2 the two blocks are e=1+a+a2 and f=a+a2, with defect groups respectively the Sylow C2 subgroups and 1, and fkGM2(k). In characteristic 3 there is just one block, with Sylow defect C3.

Facts & Assumptions

Given: The group, splitting field and primes stated above.

[F1]

The block containing the trivial module has Sylow defect. (Principal block has sylow defect)

[F2]

Over a splitting field defect-zero blocks are matrix algebras, and conversely. (Defect zero blocks are simple algebras)

[F3]

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

Verification

technique · direct
1.1

In characteristic 2, put f=a+a2 and e=1+f. Since a3=1, one has f2=a2+a=f and e2=e, with ef=0 and e+f=1. A transposition t conjugates a to a1, so both idempotents are central. Also ae=e, and ekG has basis e,et, with (et)2=e. Thus it is kC2k[u]/((u1)2). An element is a unit exactly when its constant term in u1 is nonzero, by a two-term geometric inverse. This local algebra has no nontrivial idempotent, so e is primitive central.

given
2.1

Define matrices A=(0111) and T=(0110) over k. Direct multiplication gives A3=T2=I and TAT=A1. These are the relations of S3=a,ta3=t2=1, tat=a1: the relations reduce every word to one of aitj with 0i<3, 0j<2, and the actual permutations give six distinct forms. Hence aA,tT defines a representation and its linear extension ρ:kGM2(k) is an algebra map. One has ρ(f)=A+A2=I. The four matrices I,A,T,AT span M2(k): the standard matrix units are E22=A+T, E11=I+A+T, E21=AT+I, and E12=T+AT+I. They are the images of f,fa,ft,fat. These four group-algebra elements form a basis of fkG, since f,fa are independent in fka, span that ideal by fa2=f+fa, and the two cosets of a have disjoint supports. Thus the restriction of ρ is a surjective map between four-dimensional algebras, hence an isomorphism fkGM2(k). Its centre is kf, so f is primitive and e,f are all blocks. The augmentation of e is 3=1, so e acts as identity on the trivial module and is principal. This calculation uses no root of unity in k.

step 1.1
3.1

For P=t, direct commutation in S3 gives CG(P)=P. Neither a nor a2 centralizes t, hence BrP(e)=1 and BrP(f)=0. All nontrivial 2-subgroups are transposition subgroups. At 1, the image of f is f0. Thus [F3] gives Sylow defect for e and defect 1 for f, agreeing with [F1] for the principal block and [F2] for the explicitly computed matrix block.

F1F2F3step 2.1
4.1

In characteristic 3, let T be the sum of the three transpositions and C=a+a2. The centre has basis 1,T,C, because commuting with all group elements is equivalent to having constant coefficients on conjugacy classes. Direct multiplication gives T2=3(1+C)=0, C2=C+2, and TC=2T. Thus J=kT+k(1+C) satisfies J2=0, and the centre is k1J. For z=λ1+u with uJ, the equation z2=z is λ2=λ and (2λ1)u=0. The first equation gives λ=0 or 1; in both cases 2λ10 in characteristic 3, so u=0. Therefore the only central idempotents are 0,1. There is one block, necessarily principal; [F1] gives defect aC3.

F1

Sources

Webb, A Course in Finite Group Representation Theory, §§11.3, 11.6 and 12.3–12.5, especially pp.240–245. Local argument and conventions as displayed above.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

13 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