Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge 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.

Nearest-grid probability in phase estimation

Statement

For every m≥1, Q=2m, and θ∈[0,1), a nearest grid label y∈{0,…,Q−1}, minimizing dT(θ−y/Q), exists. Every nearest label satisfies Pθ(y)≥4π2. In particular, this holds at ties between adjacent labels and at the wrap-around between Q−1 and 0.

Facts & Assumptions

Given: m≥1, Q=2m, and θ∈[0,1).

[F1]

For every real t, there is an integer n=⌊t⌋ with n≤t<n+1 (Integer part: for every real x there is exactly one integer m with m≤x<m+1).

[F2]

For x∈(−1,1), dT(x)=min⁡(∣x∣,1−∣x∣)∈[0,1/2] (Circular phase distance modulo one).

[F3]

The phase-estimation probability is Pθ(y)=Q−2∣∑j<Qexp⁡(2πij(θ−y/Q))∣2 (Phase-estimation finite outcome law).

[F4]

If z≠1, then ∑j<Qzj=(1−zQ)/(1−z) (Finite geometric sum for phase-estimation amplitudes).

[F5]

For 0≤u≤1/2, sin⁡(πu)≥2u, and for v≥0, sin⁡v≤v (Sine chord and linear bounds).

[F7]

Complex conjugation preserves modulus and ∣z+w∣≤∣z∣+∣w∣ (Conjugation is an involutive real-field automorphism, zz‾=∣z∣2, and modulus is definite, multiplicative, and subadditive).

[F8]

Proof

1.1F1F2givenchoose

Put n=⌊Qθ⌋ and r=Qθ−n, so n∈{0,…,Q−1} and 0≤r<1 by [F1]. If r≤1/2, choose y=n; if r>1/2 and n+1<Q, choose y=n+1; if r>1/2 and n+1=Q, choose y=0. The resulting circular distance is respectively r/Q or (1−r)/Q, at most 1/(2Q).

2.1step 1.1F1F2algebra

Every integer k has a lift representation k=y+sQ with s∈Z and y∈{0,…,Q−1}: apply [F1] to k/Q and set s=⌊k/Q⌋, y=k−sQ, so 0≤y<Q. Thus grid labels and their lifts range over all integers, and minimizing circular phase distance is the same as choosing an integer nearest to Qθ=n+r. If r≤1/2, every integer k≤n is at distance at least r and every k≥n+1 is at distance at least 1−r≥r, so n is nearest; when r=1/2, n+1 is also nearest. If r>1/2, every integer k≤n is at distance at least r>1−r and every k≥n+1 is at distance at least 1−r, so n+1 is nearest. If a nearest integer is Q, its label is 0: this is the wrap-around choice in step 1.1 when r>1/2, and the tied wrap-around label when r=1/2. Thus every nearest label has distance d≤1/(2Q).

3.1F5F6F7F8step 2.1algebra

Fix a nearest label and set x=θ−y/Q, d=dT(x). Since x∈(−1,1), the definition of d gives an integer ℓ∈{−1,0,1} and sign ε∈{−1,1} with x=ℓ+εd. By [F6], exp⁡(2πix)=exp⁡(2πiεd). If ε=−1, Euler's formula and the evenness of cosine and oddness of sine in [F8] give exp⁡(−2πid)=exp⁡(2πid)‾, so [F7] shows its distance from 1 has the same modulus as for d. Euler's formula gives 1−exp⁡(2πid)=exp⁡(πid)(exp⁡(−πid)−exp⁡(πid))=−2iexp⁡(πid)sin⁡(πd). Since ∣exp⁡(πid)∣=1 and sin⁡(πd)≥2d≥0 by [F5], ∣1−exp⁡(2πix)∣=2sin⁡(πd). The same calculation with Qx=Qℓ+εQd gives ∣1−exp⁡(2πiQx)∣=2sin⁡(πQd) when d>0, because Qd≤1/2.

4.1F3F4step 3.1

When d>0, [F4] and step 3.1 yield Pθ(y)=Q−2(sin⁡(πQd)/sin⁡(πd))2. If d=0, then x=0 and [F3] gives Pθ(y)=1.

5.1F5step 4.1step 2.1algebra∎

If d>0, step 2.1 gives 0<Qd≤1/2. By [F5], sin⁡(πQd)≥2Qd and 0<sin⁡(πd)≤πd; hence step 4.1 gives Pθ(y)≥Q−2(2Qd/(πd))2=4/π2. If d=0, step 4.1 gives Pθ(y)=1≥4/π2. Thus every nearest label, including either label at a tie, has the claimed probability.

Depends on

Used by

Dependency tree · two levels

85 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