slug: baek-jo-nha-2026-maximal-coherence-monotonicity bibkey: baekjonha2026maximalcoherence doi: null url: https://arxiv.org/abs/2607.05847v1 triage: theorem motivation_gids:
- D5/S3/Quantum/Measurement/MaximalCoherenceAncillaNonmonotone.result
Problem
Baek, Jo and Nha, Maximal coherence of quantum measurement and the resource theory of sharpness, arXiv:2607.05847v1, asks whether remains monotone under general CP unital maps for non-dichotomic POVMs. Table I marks the corresponding entry under any fuzzifying operations as open.
Motivation
The question concerns the spectral distance and the tetrahedral SIC qubit POVM. The settling declaration is D5/S3/Quantum/Measurement/MaximalCoherenceAncillaNonmonotone.result.
Gap
The source leaves the general CP-unital, dimension-changing case unresolved. The settlement supplies a four-outcome counterexample using the discarding dual .
Route
The module defines POVMs, incoherent POVMs, , fixed-basis coherence, maximal coherence, CP-unital duals and the source claim. It constructs the tetrahedral SIC effects, proves the simultaneous-basis upper bound , proves the Bell-basis lower bound , and derives result : ¬ claim.
The coordinates choose Fin 4 through finProdFinEquiv, , in the order . The module uses open scoped ComplexOrder for the complex positive-semidefinite calculations; these are Lean elaboration choices preserving the source meaning.
Falsifier
The claim is falsified by the instance , , , , , the tetrahedral SIC POVM and . The strict inequality is the final contradiction.
Evidence
The SIC upper bound sic_cmax_upper, SIC ancilla lower bound sic_ancilla_cmax_lower, and refutation result are kernel-checked in Lean; the axiom closure of every public declaration is contained in {propext, Classical.choice, Quot.sound}. The general ancilla mechanism is proved in prose below. The stabilization statement and the characterization for jointly convex distances are paper arguments from the preregistration’s Consequences. The uniform bounds and full-rank statement have the prose proof below; they are not Lean declarations in this module.
The public result is the designated refutation result (basis=refutes) and is exempt from four-slot escape registration (CLAUDE.md §3.9).
Computed evidence: check.py, run as python3 check.py, exit 0, SHA-256 b0d07f99a84ffde3e5a0285f79184a2e0dfe8cf0dcf4ad2c8c151bc7d971d96c, reports bad= 0. Its family calculations evaluate only : POVM and Kraus checks, the sharpness value , 20,000 random qubit unitaries (sampled maximum dephasing distance , bound ), and 20,000 random Bell-diagonal POVMs (sampled minimum distance , with the trivial POVM attaining ). Separately, it samples stabilization on 200 random qubit POVMs, using 3,000 trivial competitors and 300 Bell-diagonal competitors per POVM, with tolerance . These finite samples do not compute the uniform family.
Triage
| item | status | evidence |
|---|---|---|
| For a POVM on , tensoring and choosing a maximally entangled Bell basis forces every incoherent competitor to a trivial POVM under normalized partial trace; the coherence in that basis is at least sharpness. | proved | Proved in prose: the general ancilla derivation below, assuming unitary invariance and CP-unital contractivity of . |
| For every unitarily invariant, CP-unital-contractive distance, . | proved | Proved in prose: stabilization derivation below, with unitary invariance and CP-unital contractivity. |
| For jointly convex such , monotonicity under all fuzzifying operations iff on every POVM. | proved | Proved in prose: characterization derivation below; sharpness monotonicity gives sufficiency, and stabilization gives necessity. |
| For , , . | proved | Proved in prose: the family upper-bound and attainment derivation below. |
| For , . | proved | Proved in prose: the family lower-bound derivation below, using both Rayleigh signs and eigenvalues . |
| For , the increase equals ; every effect is full rank for . | proved | Proved in prose: attainment of both bounds and positive eigenvalues, as derived below. |
| The family instance refutes general CP-unital monotonicity. | proved | Kernel-checked result : ¬ claim, with sic_cmax_upper and sic_ancilla_cmax_lower on its proof path. |
| Numerical checks of the family instance . | computed | The pinned experiment entry above: python3 check.py, exit 0, SHA-256 b0d07f99a84ffde3e5a0285f79184a2e0dfe8cf0dcf4ad2c8c151bc7d971d96c, bad= 0, over exactly the stated finite samples. |
| Whether . | open | No Lean declaration or computation in this delivery addresses the diamond distance. |
| Whether monotonicity also fails for dimension-preserving fuzzifying operations. | open | Unresolved: the counterexample changes dimension from to ; no dimension-preserving counterexample is established here. |
General ancilla mechanism, stabilization and characterization: prose proof
Let be a POVM on , , and let be unitarily invariant and contractive under CP-unital maps. Set and . For the embeddings , with , and with . These Kraus forms make both maps CP unital, and . For , choose the Bell vectors
Their inner products are , where primes distinguish the second vector, so the vectors form an orthonormal basis. Taking the partial trace kills the terms with different second coordinates, giving . If has these columns and is any incoherent POVM on , write . Each is a nonnegative combination of Bell projectors, so
Unitary invariance and contractivity therefore give, for every such competitor,
Taking the incoherent infimum proves the general mechanism: Bell-basis coherence is at least sharpness. This is a prose proof for general , and . Lean’s R_bell_diag checks the scalar partial-trace identity only on ; sic_bell_distance_lower and sic_ancilla_cmax_lower check the spectral-distance lower bound only for the SIC instance.
For stabilization, trivial POVMs are incoherent in every basis, so unitary invariance gives . For each probability vector , contractivity of and in opposite directions gives
Taking infima gives . Combined with the Bell lower bound, this proves in prose
For characterization, assume additionally that is jointly convex. A fuzzifying operation takes a trivial competitor to the trivial POVM . Joint convexity, contractivity and imply
Taking infima proves sharpness monotonicity. Hence on every POVM is sufficient for monotonicity under all fuzzifying operations. Conversely, monotonicity applied to and stabilization gives
which proves necessity. This equivalence is proved in prose with the stated distance hypotheses.
The -family: prose proof
Use the tetrahedral vectors of #15378 and put , where
Since , the Hermitian matrix has eigenvalues . Thus has eigenvalues , is positive semidefinite, and is positive definite for . Also , so . This is a four-outcome POVM throughout the stated interval, with full-rank effects for .
Upper bound. Fix one unitary common to all four effects and let be the diagonal part of . Positivity and completeness make an incoherent POVM. The identity term has zero off-diagonal entries, so
A Hermitian matrix with zero diagonal has spectral norm equal to the modulus of its off-diagonal entry. Route step 1 of #15378 gives . Cauchy–Schwarz therefore gives
The bound holds for every common , hence .
Lower bound. Let be the Bell-basis unitary and let be any incoherent four-outcome POVM on . Write , and . Bell projectors have normalized partial trace , so ; positivity and completeness give and . Since , for and every unit vector ,
This is the two-sided Rayleigh bound, obtained by applying the bound to both and , as in route step 2. Taking eigenvectors of and using unitary invariance of the norm yields
The last inequality follows because the two eigenvalues differ by , and their distances to any real sum to at least . Summing over all four effects with the factor in gives . Taking the infimum over and then including in the unitary supremum gives .
Attainment and increase. For a qubit basis with reference axis , all four tetrahedral effects have off-diagonal modulus . Every diagonal competitor leaves this entry unchanged, and the spectral norm of its difference from the effect is at least that modulus. The dephased competitor attains it for every effect, so the coherence in this basis is . This attains the uniform upper bound. For , the trivial competitor has effectwise distance , giving in every basis. This attains the Bell lower bound. Thus
Subtracting gives
because and . The operation is the same CP-unital dual as at , so every member of the family violates monotonicity, including the full-rank members with .
The conventions are the source’s Section II.A coherence, Section III.A common-unitary maximal coherence, Eq. (32) spectral distance and Eq. (12) fuzzifying operations, with the SIC of Section IV.A. They agree with Lean’s IsPOVM, IsIncoherent, dInf, coh, cmax and IsCPUnitalDual: the proof uses an incoherent POVM for the upper infimum, all incoherent competitors for the lower infimum, one common unitary for each basis choice, and the distance factor . The uniform argument is a prose proof; result and its live SIC/Bell bounds check only in Lean.
What the settlement shows
The general CP-unital monotonicity question is refuted for non-dichotomic POVMs when the fuzzifying map may change dimension. The stabilization and characterization statements remain prose derivations with the hypotheses stated above. The diamond-distance and dimension-preserving questions remain open.
ASSUMED-UNVERIFIED
The literature screen establishes the cited source and its open wording in the searched scope. Exhaustive worldwide novelty beyond the cited source and the recorded literature search is not claimed.