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.
Finite, attained general adversary value for nonconstant Boolean functions
Statement
For a finite Boolean query problem (N,D,f), restrict to real symmetric Γ indexed by D with Γ∘F=0 and denominator d(Γ)=max_i||Γ∘Δ_i||. If f is nonconstant, every nonzero admissible Γ has d(Γ)>0, the ratio ||Γ||/d(Γ) is finite, and its supremum is a maximum. For constant f define Adv±(f)=0.
Facts & Assumptions
Given: A finite Boolean query problem (N,D,f).
Finite Boolean query problem and error model for adversary bounds: D is a finite subset of {0,1}^N and f labels each input 0 or 1.
Input-mismatch masks and entrywise filtering: Δ_i marks exactly the pairs that differ at coordinate i; F marks equal-output pairs.
The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||: the operator norm is continuous and dominates every matrix entry in absolute value.
Heine-Borel in : with the Euclidean metric a subset of is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line: closed bounded subsets of each positive finite-dimensional real Euclidean space are compact.
A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value: a continuous real function on a nonempty compact metric space attains its maximum.
Proof
Let x,y have opposite outputs. Then x≠y, so there is i with x_i≠y_i. The symmetric matrix with entries 1 at (x,y),(y,x) and zero elsewhere is an admissible nonzero Γ; at least one Γ∘Δ_i has norm 1, while all have norm at most 1. Thus every nonconstant f has a positive-denominator admissible matrix.
If Γ is admissible and nonzero, some Γ_xy≠0. By Γ∘F=0 its endpoints have opposite outputs, hence differ at some coordinate i. Then |Γ_xy|=|(Γ∘Δ_i)_{xy}|≤||Γ∘Δ_i||, so max_i||Γ∘Δ_i||>0. The same argument shows that the normalization max_i||Γ∘Δ_i||≤1 forces every entry |Γ_xy|≤1.
The normalized set of real symmetric Γ with Γ∘F=0 and max_i||Γ∘Δ_i||≤1 is closed and bounded in the finite-dimensional matrix space, hence compact by [F4]. It is nonempty by step 1.1. The norm is continuous since , so [F5] gives a finite attained maximum; by homogeneity this maximum is exactly the ratio supremum in the definition.
Depends on
- Input-mismatch masks and entrywise filtering
- The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||
- Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely
- Finite Boolean query problem and error model for adversary bounds
- Heine-Borel in $\mathbb{R}^n$: with the Euclidean metric a subset of $\mathbb{R}^n$ is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line
- A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value
Used by
- General adversary matrix and spectral bound Definition
- Nonnegative-weight adversary bound Definition
Dependency tree · two levels
53 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
- Andrew M. Childs, Lecture Notes on Quantum Algorithms (17 April 2025) (standard reference, not scraped)
- Ronald de Wolf, Quantum Computing: Lecture Notes, arXiv:1907.09415v6 (standard reference, not scraped)