Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-28
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.

Generalized Pell solutions fall into finitely many Pell orbits

Statement

Let D be a positive nonsquare integer, let N∈Z∖{0}, and let εD>1 be the fundamental Pell solution. Every integral solution x2−Dy2=N is Pell-equivalent to a solution x0+y0D satisfying ∣x0∣≤∣N∣2(εD+εD−1/2),∣y0∣≤∣N∣2D(εD+εD−1/2). Consequently the generalized Pell equation has only finitely many Pell-equivalence classes.

Facts & Assumptions

Given: A nonzero integer N, the fundamental Pell solution εD>1, and a solution α=x+yD of ND(α)=N.

[F1]

Two norm-N solutions are Pell-equivalent exactly when one is obtained from the other by multiplication by a power of εD (Pell-equivalence for generalized solutions).

[F2]

The Pell norm is multiplicative (The Pell norm is multiplicative).

[F3]

The fundamental solution satisfies εD>1 (The fundamental Pell solution).

Proof

technique · direct
1.1F1F2F3givenalgebra

Put t:=∣α∣∣N∣>0. Because εD>1, the half-open intervals (εDm−1/2,εDm+1/2](m∈Z) partition (0,∞): their endpoints are strictly ordered, they tend to 0 as m→−∞, and they tend to +∞ as m→+∞. Hence there is a unique integer k with εD−1/2<tεD−k≤εD1/2. Put α0:=αεD−k=x0+y0D. By [F1] and [F2], α0 is Pell-equivalent to α and still satisfies ND(α0)=N.

2.1F2step 1.1algebra

Let β:=∣α0∣. Step 1.1 gives ∣N∣ εD−1/2<β≤∣N∣ εD1/2. Since α0‾=x0−y0D=Nα0, one has ∣α0‾∣=∣N∣β≤∣N∣ εD1/2 and also ∣α0‾∣>∣N∣ εD−1/2. Therefore 2∣x0∣=∣α0+α0‾∣≤β+∣α0‾∣≤∣N∣(εD+εD−1/2), and similarly 2D ∣y0∣=∣α0−α0‾∣≤β+∣α0‾∣≤∣N∣(εD+εD−1/2). This is exactly the stated bound.

3.1step 1.1step 2.1∎

The bounds of step 2.1 leave only finitely many integer pairs (x0,y0). Every solution is Pell-equivalent to one of them by step 1.1, so only finitely many Pell-equivalence classes occur.

Depends on

Used by

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