Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-07
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.

Clifford correspondence for A3 in S3

Example

Let G=S3, N=A3=⟨r⟩ with r=(123), and s=(23). Write ζ=e2πi/3 and λ(r)=ζ. Then Irr⁡(N)={1,λ,λ−1}, with conjugacy orbits {1} and {λ,λ−1} and respective inertia groups G and N. The trivial orbit gives the trivial and sign characters of S3. Inducing λ gives the standard irreducible representation of degree two, with ramification one and reducible restriction λ+λ−1.

Facts & Assumptions

Given: The groups, modules, characters, and hypotheses in the example. All representations here are finite-dimensional complex left representations.

[F1]

Induction from inertia gives a bijection on irreducibles above a chosen normal type, and distinct normal-type orbits partition the irreducibles of the group. (Clifford correspondence).

[F2]

Induction of an irreducible normal-subgroup character is irreducible precisely when its inertia group is the normal subgroup. (Normal subgroup induction criterion).

[F3]

A fixed extension of a normal type to inertia parametrizes the irreducibles above it by tensoring with inflated irreducibles of the inertia quotient. (Gallagher correspondence for an extendible type).

Verification

technique · direct
1.1givenalgebra

An operator representing r satisfies r3=1 and is diagonalizable, since x3−1 has three distinct roots over C. In an irreducible N-module an eigenline is invariant under r and hence under N, so the module is that line. This gives precisely the three displayed characters. The relation srs−1=r−1 interchanges λ and λ−1, while N fixes every type. Thus their inertia is N, while the trivial type has inertia G.

2.1F3step 1.1

The trivial character extends trivially to S3. The quotient S3/A3 is cyclic of order two. An irreducible representation of this quotient is an eigenline for its generator, with eigenvalue 1 or −1, so its two characters inflate to the trivial and sign characters. Gallagher gives exactly these characters above the trivial normal type.

2.2F1F2step 1.1algebra

The inertia criterion makes Ind⁡A3S3λ irreducible. To identify it, let P={(x1,x2,x3)∈C3:x1+x2+x3=0} with the left permutation action. The vectors v=(1,ζ2,ζ) and w=(1,ζ,ζ2) form a basis of P; rv=ζv, rw=ζ−1w, and sv=w, sw=v. Any invariant line would be one of the distinct r-eigenlines, but s swaps them, so P is irreducible. Since it lies over λ and inertia equals N, Clifford correspondence identifies it with the induced module.

3.1F1step 2.1step 2.2∎

The displayed eigenbasis gives P∣N≅λ⊕λ−1, each once, so its ramification is one and its normal restriction is reducible and not isotypical. The two normal-type orbits exhaust all types; the orbit partition therefore shows that the trivial, sign, and standard modules are the complete list of irreducible S3-modules.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

18 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