Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-adaptedPipeline-generatedjudge 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 cyclic prime-to-p Brauer table

Example

Let Cm=⟨g⟩, m≥1, p∤m, in a splitting system. Choose a primitive mth root λ∈k and write ζ=λ^. The simple modules Si for 0≤i<m have g acting by λi; their Brauer table is (ζij)0≤i,j<m.

Facts & Assumptions

Given: The cyclic group, splitting system, and chosen primitive root in the Example.

[F1]

Brauer values are sums of unique multiplicative lifts of eigenvalues (Lifted modular trace on p-regular elements).

Verification

1.1F1givenalgebra

The eigenspace decomposition for g shows any simple module is one-dimensional with one of the m distinct eigenvalues; each scalar action g↦λi is a representation since (λi)m=1. Its value at gj is λij^=ζij. Distinct eigenvalues give nonisomorphic modules.

2.1step 1.1algebra∎

The determinant is ∏0≤i<l<m(ζl−ζi). To obtain the formula, regard the determinant of (xij) as a polynomial in the xi: it vanishes when two xi coincide, has total degree m(m−1)/2, and the coefficient of x1x22⋯xm−1m−1 is 1, as is that of the displayed product. Hence they agree. Its factors are nonzero and their reductions λl−λi are nonzero, so the determinant is a unit in O and is nonzero in both K and k. For m=1 the table is (1) and the product is empty, equal to 1.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

8 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