Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6.1-sol)audited 2026-10-02
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.

Product formula for a number field

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let K be a number field (Number field) with ring of integers OK (Ring of integers). Normalize the absolute values of x∈K× as follows:

  • at a nonzero prime ideal p of OK, set ∣x∣p=Np−vp(x), where vp is the prime-ideal valuation (Prime-ideal valuations on fractional ideals) and Np is the absolute norm (The absolute norm of an integral ideal);
  • at a real embedding σ, set ∣x∣σ=∣σ(x)∣;
  • at a complex embedding τ, one chosen from each complex conjugate pair, set ∣x∣τ=∣τ(x)∣2.

Then

∏v∣x∣v=1for every x∈K×,

the product being taken over the nonzero prime ideals and the chosen real and complex embeddings; only finitely many factors differ from 1.

Facts & Assumptions

Given: The Axiom of Choice, a number field K with embeddings σ1,…,σr1 and τ1,…,τr2 as in the statement (Archimedean embeddings and signature), and an element x∈K×.

[A1]

The Axiom of Choice is assumed for the whole argument; its single use is the Dedekind unique-factorisation route for fractional ideals (Unique factorization of nonzero fractional ideals into prime powers), whose statement assumes Choice, applied to ideals of OK (Rings of integers are Dedekind domains).

[F1]

Every nonzero fractional ideal of OK has a unique finite factorisation into prime ideals, and an integral ideal has only nonnegative exponents (Unique factorization of nonzero fractional ideals into prime powers); the valuation vp(I) is the exponent attached to p (Prime-ideal valuations on fractional ideals).

[F2]

For nonzero integral ideals, N(ab)=N(a)N(b), and for 0≠α∈OK one has N((α))=∣NK/Q(α)∣ (Ideal norm is multiplicative, The norm of a principal integral ideal).

[F3]

NK/Q(x)=∏ψψ(x), the product being over the [K:Q] embeddings K→C, and NK/Q(xy)=NK/Q(x)NK/Q(y) with NK/Q(1)=1 (Norm and trace from embeddings, with the inseparable exponent in the norm formula, Norm is multiplicative, trace is F-linear, and both are transitive in towers).

[F4]

The modulus satisfies ∣zw∣=∣z∣∣w∣ and zz‾=∣z∣2 for complex numbers (Conjugation is an involutive real-field automorphism, zz‾=∣z∣2, and modulus is definite, multiplicative, and subadditive); in particular ∣z‾∣=∣z∣, since ∣z‾∣2=z‾ z‾‾=z‾z=∣z∣2 and both sides are nonnegative.

Proof

technique · split the product into its finite and archimedean parts; the finite part is the reciprocal of $|N_{K/\mathbb Q}(x)|$ by unique factorisation and the ideal-norm formulas, and the archimedean part is $|N_{K/\mathbb Q}(x)|$ by the embedding formula for the norm
1.1givenalgebra

Write x=a/b with a,b∈OK∖{0}. Indeed, K/Q is finite so x is algebraic over Q and has a monic minimal polynomial m(X)=Xd+cd−1Xd−1+⋯+c0∈Q[X] (The evaluation kernel and the unique monic irreducible minimal polynomial of an algebraic element); choose M≥1 with all Mjcd−j∈Z, and set a=Mx. Then ad+Mcd−1ad−1+⋯+Mdc0=Mdm(x)=0, a monic integer polynomial relation, so a∈OK by the minimal-polynomial criterion (Minimal-polynomial criterion for algebraic integers); with b=M∈Z∖{0}⊆OK this gives x=a/b.

1.2F3F4given

For the archimedean factors, [F3] gives NK/Q(x)=∏ψψ(x) over all [K:Q] embeddings, and the embeddings consist of the r1 real embeddings together with the r2 conjugate pairs {τj,τj‾}; taking absolute values and using ∣zw∣=∣z∣∣w∣ and ∣z‾∣=∣z∣ from [F4], ∣NK/Q(x)∣=∏ψ∣ψ(x)∣=(∏i=1r1∣σix∣)(∏j=1r2∣τjx∣ ∣τjx‾∣)=(∏i=1r1∣σix∣)(∏j=1r2∣τjx∣2), which is exactly the product of the archimedean normalized absolute values.

2.1A1F1F2F3step 1.1

In the language of fractional ideals (Fractional ideals, The field of fractions Frac⁡(D)=(D∖{0})−1D of an integral domain) one has (x)=(a)(b)−1, hence vp(x)=vp((a))−vp((b)) for every prime p; by [F1] write (a)=∏ppep and (b)=∏ppfp with finite supports, so vp(x)=ep−fp vanishes outside the finite union of those supports and ∏pNp−vp(x)=(∏pNpfp)(∏pNpep)−1=N((b))/N((a))=∣NK/Q(b)∣/∣NK/Q(a)∣=1/∣NK/Q(x)∣, the third equality by [F2] applied to the two finite factorisations and the last by [F3], since NK/Q(a)=NK/Q(x)NK/Q(b).

3.1A1step 2.1step 1.2∎

Multiplying the finite product of step 2.1 and the archimedean product of step 1.2 gives ∏v∣x∣v=(∏i=1r1∣σix∣)(∏j=1r2∣τjx∣2)(∏pNp−vp(x))=∣NK/Q(x)∣⋅∣NK/Q(x)∣−1=1, and only the finitely many primes in the supports of (a) and (b) contribute a finite factor different from 1, so the product is over a finite set of places; the only Choice in the argument is [A1], the norms, moduli and logarithms being computed without further selection.

Depends on

Used by

Dependency tree · two levels

88 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