slug: bluhm-2025-appendix-a1-feasibility bibkey: bluhm2025inclusion doi: 10.48550/arXiv.2512.17706 url: https://arxiv.org/abs/2512.17706v1 triage: theorem motivation_gids:
- D5/S3/Quantum/Measurement/FreeSpectrahedronFeasibilityWitness.result
A single-formula feasibility witness for the qubit simplex-and-interval inclusion
Problem
A. Bluhm, E. Evert, I. Klep, V. Magron and I. Nechita, Inclusion constants for free spectrahedra with applications to quantum incompatibility, arXiv:2512.17706v1, Appendix A.1, conjecture that the explicit tuple with , the displayed and from Eq. (47) is feasible for the SDP (37) at , , for every . The verbatim statements are in the literature note.
Issue #14338 reads “feasible” as membership in : all six matrices positive semidefinite in and the four affine equations of (37).
Motivation
The SDP (37) certifies that lies in
(the source’s prop:HKMFeasibilitySDP), which gives the inclusion constant of the qubit simplex-and-interval free
spectrahedron used for joint measurability. Theorem 5.6 proves feasibility with a construction
split at ; the conjectured tuple is a single closed formula on the whole interval.
Gap
The source reduces the conjecture to and states that it could not prove this.
Issue #14338 records the literature check before any Lean: only arXiv v1 exists; the citing paper
Evert–Graham arXiv:2608.24773 does not treat Appendix A.1; Zenodo has no record;
not-found-in-searched-scope.
Route
With , , , :
- the affine equations hold identically because Eq. (47) solves them;
- ;
- , so and ;
- with , , and , where ; hence , and ; has the trace and determinant of ;
- a real symmetric matrix with positive trace and nonnegative determinant is positive semidefinite as a complex matrix.
Falsifier
The statement concerns the exact tuple of Appendix A.1 and the SDP (37) with ; any other , or is outside the claim. The source’s word “positive” for is read as nonnegative: at .
Evidence
The canonical source is D5/S3/Quantum/Measurement/FreeSpectrahedronFeasibilityWitness.lean, with
public claim and result : claim. The axiom closure of result is exactly propext,
Classical.choice and Quot.sound; there is no sorry, native_decide or new axiom.
The module statement is sha256:8e3161385dc8a9084195f1349f00b18a416e9ae9482194ae863e202c258865ac,
the result statement sha256:1079b821c67bfe8e831790fb1d2ca362e7b9bff08ff07a9f3c949bcb05e2ac90 and the
claim statement sha256:888093d3ca035627875af0a6ca576c01c5f8fb2d4fab9dc2f6b2331646f6a2cf. The Freeze
event is sha256:115351b240dc71bb8eefa8f6aca18156a9f3b9c011aa80f0659d0db50da365b7; its project-level
prerequisite is D5/S3/Constants/Radicals/SqrtThreeThreshold (frozen node
sha256:eff322ff7062275040292c230faf45c194bb5d0cfc0f2d7a6aaa4cf65fc216c5, module statement
sha256:7772994aef5132c9610ed05ed595937b5ac5ac22b1cde9f80ba34f2c5f87a10b), whose
three_lt_two_mul_sqrt_three gives .
Triage
Tier 1 conjecture of a December 2025 paper, preregistered in issue #14338 before any Lean.
theorem; resolution proved.
| declaration | proof_shape | escape_witness | admission_basis |
|---|---|---|---|
| result | content | scalar_bounds: from | open-problem-resolution |
The private helpers posSemidef_of_trace_det (the criterion), scalar_bounds,
affine_eqs and matrix_forms are each used on the proof of result.
Utility is none: the statement holds for every in an interval and is proved by symbolic
identities. There is no digestion atom.
What the proof shows
Proved by result: the Appendix A.1 tuple is feasible for every , so a
single closed formula replaces the two-piece construction of Theorem 5.6.
Argued or computed, not formalized.
- Mechanism. is chosen so that and are rank one for every (): the tuple stays on the boundary of the positive cone in those two blocks, and the only remaining constraint is the sign of .
- Where it is tight. exactly when (the factor ), so the tuple is on the boundary of the feasible set at ; elsewhere in and are positive definite.
- How far the formula extends. Positivity of , the identity of the Route and the positivity of , and hold for every real : the radicand of has minimum over , because (); ; and . Hence the tuple is feasible exactly when , that is when , i.e. .
Open. The source’s conjectures on the optimal constant for larger simplices plus an interval
(conj:kSimplexPlusLineOptimum) and on four-line incompatibility (,
conj:fourlines) are not addressed; neither is whether witnesses of this rank-one-block shape exist
for them.
Effect on the paper. Theorem 5.6 now has a one-piece certificate; the inclusion constant is unchanged.
ASSUMED-UNVERIFIED
The bounded literature check does not establish exhaustive worldwide novelty, priority, or the absence of an independent proof.