Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: Literature-sourcedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-05
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.

Artin induction is tautological for a cyclic group

Example

Let G=Cn be cyclic, and let xRQ(Cn). Then Artin induction can be realized with the single cyclic subgroup Cn itself:

x=IndCnCnx.

For the trivial character when n=1, this specializes to 1C1=IndC1C11C1.

Facts & Assumptions

Given: A cyclic group Cn=g and an element xRQ(Cn).

[F1]

Every rational character is a rational linear combination of characters induced from cyclic subgroups (Artin induction for rational characters).

[F2]

The notation g=Cn means that g generates the whole group (The subgroup S generated by a subset, the cyclic subgroup g, and cyclic groups).

Verification

technique · direct
1.1

By [F2], the whole group Cn is already a cyclic subgroup of itself. Induction from a subgroup to itself is the identity construction, so IndCnCnx=x. Thus the Artin expression can be taken to have one summand, namely the subgroup Cn itself.

F2givenalgebra
2.1

This realizes the conclusion of [F1] in the most degenerate possible way: no proper cyclic subgroup is needed. If n=1 and x=1C1, then step 1.1 gives the displayed trivial-character identity.

F1step 1.1algebra

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

10 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