A six-atom classical family refutes Conjecture 6 of Linden and Winter [1]: no finite positive coefficient triple makes their proposed linear relaxation valid for all four-party quantum states. Their constrained theorem remains valid.
Conjecture
Linden and Winter proved a four-party entropy inequality under three linear entropy constraints. Conjecture 6 asks whether positive constants can make
hold for every four-party quantum state. Here denotes conditional mutual information. Classical distributions embed as diagonal quantum states, so a classical family suffices.
Six-atom family
For an integer , normalize these weights in order:
| Atom | Integer weight |
|---|---|
Given , is constant; given , is constant. Thus . For , is constant; for , the identity
establishes conditional independence of and , hence . Writing and leaves . The values of and have no effect on this family.
Unbounded ratio
Set . The equivalent weights are , with sum . Using natural logarithms, define
Conditional-entropy grouping gives
All arguments of stay positive near zero, making these expressions analytic there. Their Taylor expansions are
The symbolic derivation receipt [3] records the lower-order cancellations and exact coefficients; they can also be checked by differentiating the displayed expressions. Therefore
For every finite positive , choose with to obtain . Analyticity and the leading coefficients establish the universal statement; the finite certificates below verify particular members of the family.
Verification and scope
The public note and standard-library interval verifier [2] check both exact structural identities, entropy signs, ratio bounds for , and explicit coefficient examples. The default finite certificates replayed successfully on October 2, 2026. The advertised arbitrary-coefficient invocation had a Python conversion defect; its merged correction [4] was replayed against the published code and certifies the supplied coefficient triple.
The family has , so it refutes the linear relaxation while preserving the original constrained theorem. It does not settle the existence of other unconstrained quantum entropy inequalities. The retained record includes an operator-supplied copy of correspondence reporting Andreas Winter’s confirmation; the original mailbox was not independently inspected. No peer review or publication acceptance is asserted.
Attribution and retained attempt
The preserved constructor and off-diagonal child assignments supplied this family as cited prior knowledge [5]. The saved findings certify and analyze it; they do not identify its first discovery. The journal records a director and five child attempts, all five ending down. Four Pi session files survive, including short or incomplete sessions. The director configuration declares OpenCode with GLM-5.2; child configurations include Pi and Claude Code. The Pi sessions declare GLM-5.2, but their retained assistant records end in errors, leaving the served model unverified.
The director transcript is missing, and native-session identifiers have not been joined reliably to the recorded agents. Complete attribution of each calculation is therefore unavailable. A recorded “winner” label does not establish that each child finished, that the proof was independent, or that the archive is complete.
References
- N. Linden and A. Winter. A new inequality for the von Neumann entropy . Commun. Math. Phys. 259 (2005), 129–138. arXiv:quant-ph/0406162v1, Conjecture 6. DOI: 10.1007/s00220-005-1361-2.
- Linden–Winter Conjecture 6 counterexample . Public note, six-atom family, and dependency-free interval verifier. The retained attempt does not establish first discovery.
- Exact asymptotic derivation receipt . Rational Taylor coefficients and lower-order cancellations, recomputed October 2, 2026. A symbolic calculation receipt, not a kernel-checked proof certificate.
- Arbitrary-coefficient verifier correction . Merged October 2, 2026. Published command replayed successfully after correction.
- Linden–Winter family verification pursuit . Retained journal, native-session metadata, and finding projection, August 16, 2026. Partial capture; unresolved native-session attribution.