Alphabeta Math
CounterexampleConstruction: AI-adaptedVerification: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-09
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 Galois-stable character need not descend with multiplicity one

Statement refuted

If E/F is finite Galois and splits a finite group's algebra in characteristic zero, then every Galois-stable simple E-representation descends to an F-representation with multiplicity one. In particular, the asserted conclusion would make every such F-valued irreducible character realizable over F.

Facts & Assumptions

[F1]

The orbit theorem allows a common positive multiplicity, not necessarily one: Galois orbits classify simple modules after splitting base change.

[F2]

For F=Q, E=Q(i) and Q8, the simple E-module W has rational-valued character χ=(2,2,0,0,0) on the five classes, is Galois-stable, and the rational module D satisfies EQDWW. The extension is finite Galois and splits the whole group algebra: The rational simple quaternion block.

Counterexample

Given: The module W in F2, with matrices U=diag(i,i) and V=(0110) for the generators u,v.

1.1

F2 verifies every hypothesis: characteristic zero, finite Galois extension, whole-algebra splitting, simplicity and Galois stability. It also supplies a rational realization of 2χ, namely the four-dimensional simple rational module D. F1 identifies its descent multiplicity with two, in agreement with the explicit column decomposition. It remains to rule out a rational representation of character χ itself.

F1F2given
1.2

Any rational representation with character χ has dimension χ(1)=2. Let Z represent z, so Z2=I and tr(Z)=2. Every vector decomposes as (x+Zx)/2+(xZx)/2, in the +1 and 1 eigenspaces respectively, whose intersection is zero. If their dimensions are r,s, then r+s=2 and rs=2, giving r=0, s=2. Thus Z=I. Its generator matrices R,TM2(Q) would satisfy R2=T2=I and RT=TR, by the relations in F2.

F2algebra
2.1

For any nonzero rational vector x, the vectors x,Rx are independent. Otherwise Rx=rx with rQ, and R2x=r2x=x would force r2=1, impossible. In the basis (x,Rx), R is therefore J=(0110). Write T=(abcd) in this same rational basis. The equation JT+TJ=0 is (bcdaa+dbc)=0, so c=b and d=a.

step 1.2algebra
3.1

Consequently T2=(abba)2=(a2+b2)I. It cannot equal I, since a2+b20 in Q. This excludes every rational degree-two representation of character χ, and hence every rational model whose scalar extension is W (scalar extension preserves its matrices' traces). Since step 1.1 realizes 2χ and no positive integer lies strictly between 1 and 2, the least positive rational realization multiplicity is exactly two. The excluded conclusion is multiplicity one, not the common-positive-multiplicity conclusion of F1. [step 1.1, step 1.2, step 2.1, algebra] QED

Remarks

Wiese, Corollary 2.5.10, p.40, discusses the general realizability obstruction; the proof above establishes this witness directly and does not consume a later Schur-index theorem. If “Schur index” is expressed as the minimum degree of a realization field over the character field, the same example also has index two: its character field is Q, degree one is excluded above, and Q(i) is an explicit degree-two realization field.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

25 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