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.

Circular-distance tail bound in phase estimation

Statement

Let m≥1, Q=2m, θ∈[0,1), η∈R, and K=⌊Qη⌋≥2. With dT(θ−y/Q) as in Circular phase distance modulo one, Pr⁡y∼Pθ ⁣[dT(θ−y/Q)≥η]≤12(K−1).

Facts & Assumptions

Given: m≥1, Q=2m, θ∈[0,1), and η∈R with K=⌊Qη⌋≥2.

[F1]

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

[F2]

Circular distance satisfies 0≤dT(x)≤1/2 for x∈(−1,1) (Circular phase distance modulo one).

[F3]

The integer part K=⌊Qη⌋ satisfies K≤Qη<K+1, and the same floor property applies to QdT(θ−y/Q) (Integer part: for every real x there is exactly one integer m with m≤x<m+1).

[F4]

The geometric-sum identity gives ∑j<Qzj=(1−zQ)/(1−z) for z≠1 (Finite geometric sum for phase-estimation amplitudes).

[F5]

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

[F8]

Proof

1.1F1F4F5F6F7F8givenalgebra

For an outcome y, put x=θ−y/Q and d=dT(x). If d>0, then x∉Z; write x=ℓ+εd with ℓ∈{−1,0,1} and ε∈{−1,1}. By [F4] and [F1], Pθ(y)=Q−2∣1−exp⁡(2πiQx)∣2/∣1−exp⁡(2πix)∣2. By [F6], integer shifts do not change these exponentials. For d∈[0,1/2], 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 by [F5], the denominator modulus is at least 4d; 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] gives the same modulus. The numerator is at most 2 by [F6]–[F7]. Hence Pθ(y)≤1/(4Q2d2). If d=0, this outcome is not in the tail event because Qη≥K≥2.

1.2F2F3givenalgebra

For an outcome in the tail, let k=⌊Qd⌋. If k<K, then Qd<k+1≤K≤Qη≤Qd, a contradiction; hence k≥K. Also k≤Q/2 by [F2], since Qd≤Q/2. If K>Q/2, there are no tail outcomes.

1.3F2F3givenconstruct

Suppose K≤Q/2. For each label y, choose ℓy=0 if ∣x∣≤1/2, ℓy=1 if x>1/2, and ℓy=−1 if x<−1/2, where x=θ−y/Q. Then δy=Q(x−ℓy)∈Qθ+Z and ∣δy∣=Qd. Distinct labels give distinct lifts: equality would make their difference a multiple of Q, while their label difference has magnitude less than Q. For an annulus k≤Qd<k+1, the lift lies in [k,k+1) or (−(k+1),−k]. Each half-open interval of length 1 contains at most one element of the integer translate Qθ+Z, because distinct elements differ by a nonzero integer. Thus at most two labels lie in this annulus.

2.1F3step 1.1step 1.2step 1.3algebra∎

Every such label has d≥k/Q, so step 1.1 bounds its probability by 1/(4k2). The total tail probability is therefore at most 12∑k=KQ/2k−2. For k≥K≥2, k−2≤[k(k−1)]−1=(k−1)−1−k−1. The finite sum telescopes to at most 1/(K−1), so the tail is at most 1/(2(K−1)). Together with the empty-tail case in step 1.2 this proves the claim.

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