Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)
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.

A non-coprime phase gives a proper order divisor

Example

Let N=5 and x=2. The powers modulo 5 are 2,4,3,1, so the order is r=4. Here n=3, m=9, and Q=512. In the Fourier orbit, phase index k=2 gives phase 2/4=1/2, nearest label y=256, and reduced phase fraction 1/2. Its candidate denominator is q=2, but 22≡4≢1(mod5), so the order test rejects it. Phase index k=1 gives phase 1/4, label y=128, denominator q=4, and 24≡1(mod5), so this candidate is retained. The phase index is sampled from the order-four Fourier mixture, and the minimum rule never calls the rejected proper divisor the order.

Facts & Assumptions

Given: The order-finding instructions, the exact order criterion, and the Fourier phase law.

[F1]

The algorithm retains a reconstructed denominator q only after the exact test xq≡1(modN), and returns the smallest retained denominator (Modular order finding with rational reconstruction).

[F2]

A superposition of eigenspaces produces the eigenspace-weighted phase-estimation mixture, and exact grid phases are returned with probability one (Phase estimation on a superposition of eigenspaces, Phase-estimation nearest-grid and tail bounds).

[F3]

A nearest phase label for a reduced phase of denominator r≤N reconstructs that reduced fraction (Correctness of phase-sample rational reconstruction).

[F5]

For true order r, the repeated algorithm returns the minimum retained candidate; an exact denominator-r sample therefore suffices (Success probability and repetition for modular order finding).

Proof

1.1givenF1algebra

Direct multiplication gives 21≡2, 22≡4, 23≡3, and 24≡1(mod5), with no earlier power equal to 1; thus the order is exactly 4. The specified register size gives n=⌈log⁡25⌉=3, m=2n+3=9, and Q=29=512.

2.1F1F3step 1.1algebra

For k=2, the phase reduces to 1/2, so the exact grid label is y=512/2=256. Applying [F3] with reduced numerator 1, denominator 2, and N=5 gives reconstructed denominator q=2. The verification test is 22=4≢1(mod5), hence [F1] rejects this candidate.

2.2F1F2F3step 1.1algebra

The four vectors ∣ψk⟩=12∑s=03i−ks∣2s mod 5⟩ are eigenvectors with phases k/4: multiplication by 2 cycles 1,2,4,3, and shifting the sum multiplies it by ik. The four-term geometric sum gives ∣1⟩=12∑k=03∣ψk⟩, so [F2] assigns weight 1/4 to each phase and returns its exact grid label. For k=1, y=512/4=128; [F3] reconstructs denominator 4, and 24=16≡1(mod5), so [F1] retains it. Thus both the rejected k=2 outcome and a successful k=1 outcome have positive probability.

3.1F1F4F5step 2.1step 2.2∎

By [F4], every retained denominator is a multiple of 4. The bad denominator 2 is rejected by step 2.1, while the denominator-4 sample in step 2.2 is retained; [F5] then makes the minimum retained value 4. This example verifies that a reconstructed divisor is never silently reported as the exact order.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

89 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