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

One oracle call changes adversary progress by at most filtered spectral norm

Statement

In the unitary normal form of an ordinary oracle-only standard XOR bit-query algorithm, one oracle call changes the progress Wt of Adversary progress at initial and bounded-error final states by at most ∣Wt+1−Wt∣≤2max⁡i∈[N]∥Γ∘Δi∥.

Facts & Assumptions

Given: An admissible Γ, normalized principal eigenvector α, and the pre-query states of a unitary-normal-form algorithm.

[F1]

General adversary matrix and spectral bound: Γ is a finite real symmetric adversary matrix and Γ∘Δ_i is its i-th filtered block.

[F2]

Input-mismatch masks and entrywise filtering: Δ_i(x,y)=1 exactly when x_i≠y_i.

[F3]

Query-address projectors for bit-oracle algorithms: the address projectors are orthogonal and sum to identity.

[F4]

Standard bit-flip query convention: O_x applies X^{x_i} to the response bit at address i.

[F5]

Unitary normal form for finite bit-query algorithms without extra queries: input-independent unitaries separate standard XOR query calls.

[F7]

Adversary progress at initial and bounded-error final states: the progress quantity is Wt=∑x,yΓxyαxαy⟨ψxt∣ψyt⟩D for the pre/post-query states and the chosen normalized principal eigenvector α.

[F8]
[F9]

The basis-independent trace of an endomorphism of a finite-dimensional vector space: trace is basis-independent and is the sum of diagonal entries in any basis.

Proof

1.1givenF2F3F4F5algebra

An input-independent unitary between queries preserves every pairwise inner product, so only the oracle slot changes progress. For inputs x,y, the product O_x^*O_y acts at address i as X^{x_i⊕y_i}; in the response eigenstate |−⟩=(|0⟩−|1⟩)/√2 this is −1 exactly when x_i≠y_i, and it is +1 on |+⟩. Therefore O_x^*O_y−I=−2Σ_iΔ_i(x,y)P_i^-, where P_i^- is the address-i projector tensored with |−⟩⟨−| on response and identity on work.

2.1givenF1F2F7F8F9step 1.1algebra

Let ψ_x be the pre-query state and define Q_i:C^D→H by Q_i|x⟩=α_xP_i^-ψ_x. Substituting step 1.1 into W_{t+1}−W_t and collecting entries gives W_{t+1}−W_t=−2Σ_i tr((Γ∘Δ_i)Q_i^*Q_i) because Γ∘Δ_i is real symmetric and relabeling the two indices gives the trace exactly.

3.1givenF3F6F7F8F9step 2.1algebra∎

Fix i and write Ai=Γ∘Δi and Ri=Qi∗Qi. By [F6], Ai has a real orthonormal eigenbasis (ej) with eigenvalues λj, and ∥Ai∥=max⁡j∣λj∣. Evaluating the basis-independent trace [F9] in this basis and using [F8] gives tr⁡(AiRi)=∑jλj∥Qiej∥2, so ∣tr⁡(AiRi)∣≤∥Ai∥∑j∥Qiej∥2=∥Ai∥tr⁡(Ri). Evaluating tr⁡(Ri) in the standard input basis yields ∑x∥Qi∣x⟩∥2. Therefore ∑itr⁡(Ri)=∑xαx2∑i∥Pi−ψx∥2≤∑xαx2=1, since the Pi− are orthogonal subprojections of identity. Hence ∣Wt+1−Wt∣≤2max⁡i∥Γ∘Δi∥.

Depends on

Used by

Dependency tree · two levels

44 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