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.
Haar-average versus entanglement fidelity
Statement
Assume the Axiom of Choice. Let be an integer, , and a quantum channel, meaning a complex-linear, completely positive, trace-preserving map. Let , equipped with normalized Haar probability, and let for the first standard basis vector. Then
Here , where . Thus the integral is the average over the unitary-invariant distribution of pure-state projectors induced by .
Statement references
Facts & Assumptions
The finite operator conventions define the standard basis, adjoints, outer products, and matrix brackets used here. Finite operator and ket conventions
The entanglement-fidelity definition supplies the displayed normalized vector and tensor-map overlap. Entanglement fidelity on a finite logical space
A finite-dimensional quantum channel is complex-linear and preserves the trace of every operator. Finite-dimensional quantum channel
Under the Axiom of Choice, a compact Hausdorff group has a normalized left-invariant Haar probability measure. Normalized Haar probability on a compact group
A closed and bounded subset of finite-dimensional real Euclidean space is compact. 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
A measurable complex function is integrable when ; its integral is the integral of its real part plus times the integral of its imaginary part. Integrable real and complex functions, and their integrals
The Borel sigma-algebra of a topological space is generated by its open sets. The Borel sigma-algebra of a topological space
For nonnegative measurable , its integral is the supremum of the simple integrals of nonnegative simple minorants. For a simple representation with disjoint measurable and , the simple integral is . The nonnegative Lebesgue integral The integral of a nonnegative simple function
A measurable self-map preserves when for every measurable . For such a map and an integrable real or complex function , the function is integrable and . Measure-preserving transformations and systems Integral invariance under measure-preserving maps
Integrable complex functions form a complex vector space, and their integral is complex-linear. The Lebesgue integral is linear on L¹(μ)
For a measurable map from a probability space into a measurable space , its law or induced distribution is the set function for . Law or distribution of a random element
Assume the Axiom of Choice in the choice-function form required for the Haar measure. The Axiom of Choice
Proof
Given: The dimension, channel, and Axiom of Choice in the statement.
Goal: Evaluate the unitary average as the stated expression in entanglement fidelity.
Regard complex matrices as . The equations define a closed set, and each column has norm one, so the set is bounded. It is a group under matrix multiplication, with inverse ; multiplication and inversion are continuous. It is therefore a compact Hausdorff group by [F5]. By [F4] and [A1] it has normalized left-invariant Haar probability. Write for this probability on the Borel sigma-algebra , and write .
A continuous map between topological spaces is Borel measurable: the target sets whose inverse images are Borel form a sigma-algebra containing every open set, so they include the sigma-algebra in [F7]. Every integrand in the moment and fidelity calculations below is a finite sum of products of the coordinates of and their conjugates, with fixed coefficients. These functions and their moduli are continuous, and they are bounded since each coordinate has modulus at most one. For any such function , choose a finite with . A nonnegative simple minorant , after omitting empty fibers, has . Thus its simple integral satisfies . Taking the supremum in [F8] gives , proving integrability by [F6]. Applied to this bounds its integral above by one, while the admissible simple minorant gives the reverse inequality, so . Consequently every finite expansion integrated below is justified by [F10].
For fixed , the left translation is a homeomorphism with inverse , hence is Borel measurable by step 2.1. For every Borel , left invariance gives . Thus [F9] applies, giving for each integrable . In particular this applies to all functions in step 2.1 and all the phase, permutation and two-coordinate unitary substitutions below.
Let and carry the Borel sigma-algebras of their Euclidean subspace topologies. The maps , , and , , are continuous and hence measurable by step 2.1. For either map with target , define its law by as in [F11]. Inverse images preserve the empty set and disjoint countable unions, so and, for pairwise disjoint Borel , by countable additivity of . Also . Thus these laws are probabilities. For fixed , let on and on . Each is a homeomorphism and . Therefore by step 3.1. This proves unitary invariance of the vector law and conjugation invariance of the projector law.
Write and . Diagonal phase invariance forces unless the multiset equals . Permutation invariance makes all equal to and all , for , equal to . For , apply invariance under the unitary replacing the first two coordinates by and . Expanding the fourth power and using phase invariance to discard unbalanced monomials gives , so . Integrating gives . Consequently and . For the same resulting formula holds directly. Hence, for all indices, .
The definition of and the simple-integral formula in [F8] give for every nonnegative simple on , and for signed simple by [F6] and [F10]. For a bounded real Borel and any , partition a bounded interval containing its range into finitely many half-open intervals of width at most , with the final endpoint included, and choose the lower endpoint on each inverse image. This yields a simple with . The supremum definition in [F8] gives monotonicity for nonnegative functions; adding a common constant and using [F10] gives it for bounded real functions. The boundedness argument of step 2.1 applies on both probability spaces, so all these functions are integrable. Their two integrals lie between the common value of the two integrals and that value plus . Since is arbitrary, . Applying this to the real and imaginary parts proves the same identity for bounded complex Borel by [F6]. In particular is bounded and continuous on : its expression is a finite sum of products of matrix entries, and every entry of a unit-vector projector has modulus at most one. For , finite matrix multiplication gives . The Haar integral in the Statement is therefore precisely the average with respect to .
Put and . Expanding the projector and using complex linearity, the average is . Trace preservation gives . On the other hand, expanding the normalized maximally entangled projector in [F2] yields . Substitution proves the claimed formula.
Depends on
- Entanglement fidelity on a finite logical space
- Finite operator and ket conventions
- Finite-dimensional quantum channel
- Normalized Haar probability on a compact group
- 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
- The Axiom of Choice
- Integrable real and complex functions, and their integrals
- The Borel sigma-algebra of a topological space
- The nonnegative Lebesgue integral
- The integral of a nonnegative simple function
- Measure-preserving transformations and systems
- Integral invariance under measure-preserving maps
- The Lebesgue integral is linear on L¹(μ)
- Law or distribution of a random element
Dependency tree · 2 levels
Each result is drawn at its shortest distance from this item. Arrows run from prerequisites to the items that use them; this item has a heavier outline. External source nodes link directly to the cited text. The view shows up to two dependency steps; open a prerequisite to continue.