LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck 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.

The Teichmuller lift is multiplicative and unique

Statement

In a fixed splitting $p$ -modular system, each element of $k^{\times}$ of order prime to $p$ has exactly one Teichmuller lift, and the lift satisfies

$τ (λ μ) = τ (λ) τ (μ)$

whenever $λ, μ \in k^{\times}$ have order prime to $p$ .

Facts & Assumptions

Given: A splitting $p$ -modular system $(K, O, k)$ and $λ, μ \in k^{\times}$ of order prime to $p$ .

[F1]

The Teichmuller lift of such an element is, by definition, the unique prime-to- $p$ root of unity in $O^{\times}$ reducing to it (Teichmuller lift in a splitting p-modular system).

Proof

technique · direct

1.1F1given

The uniqueness clause is already built into [F1]: if $u, v \in O^{\times}$ both have prime-to- $p$ order and reduce to $λ$ , then both satisfy the defining property of the Teichmuller lift of $λ$ , so $u = v$ .

2.1F1step 1.1algebra

The product $τ (λ) τ (μ)$ reduces to $λ μ$ in $k^{\times}$ . It is again a root of unity of order prime to $p$ , because it lies in the finite subgroup generated by two prime-to- $p$ roots of unity. By the uniqueness from step 1.1, it must equal the Teichmuller lift of $λ μ$ .

3.1step 1.1step 2.1∎

Steps 1.1 and 2.1 give the claimed uniqueness and multiplicativity.

Depends on

Teichmuller lift in a splitting p-modular system

Used by

The Brauer character is independent of basis and splitting-field realization Lemma

Dependency tree · two levels

2 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

J. Miquel Martinez, Modular Representation Theory of Finite Groups (standard reference, not scraped)
Tudor Ciurca, Representation Theory (standard reference, not scraped)