Alphabeta Math
CorollaryStatement: AI-adaptedProof: AI-adaptedPipeline-generated
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.

Prime norm numerators congruent to one modulo eight are solvable

Statement

Let ξ∈Z[2,1/2] be positive at both real embeddings. If ξ∙ξ=p/2ℓ with ℓ≥0 and a rational prime p≡1(mod8), then t†t=ξ has a solution in Z[ω,1/2]. The complete finite-time norm solver returns a solution on every such input. The same conclusion holds when ξ∙ξ=1/2ℓ. No runtime bound is implied.

Facts & Assumptions

Given: p,ℓ,ξ as above; O=Z[ω], δ=1+ω, and λ=1+2.

[F1]

Constructive decision of the dyadic cyclotomic norm equation: after clearing a rational square denominator, solvability is equivalent to even exponents at all conjugation-fixed prime classes. Its proof gives δ prime, δ†∼δ, and δ4=2iλ2.

[F2]

Constructive cyclotomic factorization and real unit squares supplies unique factorization, effective associates and real unit correction.

[F3]

First supplement: (−1/p)=(−1)(p−1)/2 implies that −1 is a square modulo every prime congruent to one modulo four.

Proof

1.1F1F2givenalgebrachoose

Choose r large enough that η=4rξ∈Z[2] and a=4r−ℓ≥0. Then η∙η=2ap. Any prime π of O dividing η divides the rational integer 2ap, hence divides 2 or p by the prime-divisor property. The only prime class over 2 is that of δ, by [F1].

1.2F2F3givenalgebraconstruct

No prime π dividing p has a conjugation-fixed associate class. Indeed, choose an integer b with b2≡−1(modp) by [F3], so π∣(b+i)(b−i). Thus π divides at least one of b+i,b−i. If its conjugate were associate to itself, conjugating this divisibility would make it divide both factors, and hence 2i. Since i is a unit, π∣2i implies π∣2. As p is odd, 1=2((p+1)/2)−p with (p+1)/2∈Z. Thus π∣1, a contradiction. The required b can also be found by the finite search 0≤b<p.

1.3F1F2algebra

Every nonzero element of Z[2] has even δ-valuation in O. To prove this, direct multiplication gives δ2=2 ωλ, so vδ(2)=2 and vδ(2)=4. An odd integer c0 is not divisible by δ: since 1=2((c0+1)/2)−c0 and δ∣2, divisibility of c0 by the prime δ would imply δ∣1. Hence, for each nonzero integer c, writing c=2rc0 with c0 odd gives vδ(c)=4r=4v2(c). For nonzero integers c,d, the summands of c+d2 therefore have valuations 4v2(c) and 4v2(d)+2. Their residues modulo 4 are distinct, so the valuation of their sum is their minimum: after factoring out the lower power, the remaining lower-valuation term is nonzero modulo δ, whereas the other is zero. This minimum is even. When a coefficient is zero, the valuation of the remaining summand is even as well. Apply this to η to conclude that its δ-exponent is even.

2.1F1step 1.1step 1.2step 1.3

By steps 1.1 and 1.2, the only possible conjugation-fixed prime class in η is δ, and step 1.3 proves its exponent is even. The criterion of [F1] therefore constructs a solution, and its complete terminating solver returns one.

3.1F1F2step 1.1step 1.3algebra∎

If the norm numerator is 1, clear the denominator as in step 1.1; then η∙η=2a. Every prime divisor of η therefore lies in the sole class δ. Its exponent is even by step 1.3, so [F1] again constructs and returns a solution. This includes ℓ=0, where a positive real unit is corrected by the same unit-square step.

Depends on

Used by

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