slug: bhattacharya-2015-relaxed-hardy-no-signalling-optimum bibkey: bhattacharya2015hardy doi: 10.48550/arXiv.1507.07327 url: https://arxiv.org/abs/1507.07327v1 triage: theorem motivation_gids:
- D5/S3/Quantum/Entanglement/RelaxedHardyNoSignallingOptimum.result
The no-signalling optimum of the relaxed multipartite Hardy test
Problem
S. S. Bhattacharya, A. Roy, A. Mukherjee and R. Rahaman, Witnessing Genuine Mutipartite Non-locality, arXiv:1507.07327v1, Section 3, conjecture:
The optimal value of the probability of success, in(\ref{relH}) is for any arbitrary dimension for any number of parties in GNST.
Here (relH) are the relaxed Hardy conditions for parties with inputs , and outcomes : ; for every , with at only, every outcome string with elsewhere and a value other than at has probability ; and for a fixed and every , with at and , the string with at and and elsewhere has probability . GNST is the theory of no-signalling boxes. The paper’s Observation reports the value for and .
Motivation
The paper extends the qubit test of Chen, Yu, Zhang, Lai and Oh for genuine
multipartite nonlocality to arbitrary dimension and compares its optimal
paradoxical probability under no-signalling with the value of the
conventional multipartite Hardy argument. The frozen declaration
D5/S3/Quantum/Entanglement/RelaxedHardyNoSignallingOptimum.result refutes
the conjecture.
Gap
Issue #12033 classifies the conjecture as Tier 1 and records the bounded literature check before any Lean:
- arXiv v1 is the only version, with no journal version;
- INSPIRE lists no citations and Semantic Scholar returns an empty citation list;
- the 2016 experiment of Zhang et al. (Sci. Rep. 6, 39327) and arXiv:2505.10035 do not revisit the value;
- web searches return nothing that revisits the value .
These are orchestrator-reported literature readings,
not-found-in-searched-scope; they do not establish exhaustive worldwide
novelty or exclude an independent answer.
Route
Let be the input string with at only, the one with at and , and the probability of outcome at all parties other than under .
- No-signalling at and the second condition give the outcome at and elsewhere probability under .
- For , no-signalling at , the third condition and nonnegativity give the event probability at least under ; symmetrically the event has probability at least . These events are disjoint, so under the parties other than and all give with probability at least .
- No-signalling at and at moves this marginal back to . Since and likewise for , the event has probability at least under .
- These events and the all- event are disjoint, so .
The module carries out steps 1–4 for , and each fixed , so every admissible satisfies and none exceeds .
Falsifier
The kernel-checked result excludes success probabilities above for
four parties with two outcomes, hence the conjecture (read as a maximum or
a supremum) and the paper’s Observation for . Changing the
no-signalling condition, the normalization, or the third condition (for
example imposing it for all pairs, or for a single pair) changes the
question.
Evidence
An independent SciPy/HiGHS linear program over all no-signalling boxes, solved for every fixed , gives the optimum , , , , and for , , , , , ; the values at (Hardy) and (the paper) serve as positive controls. An exact rational box for , attains , and raising its success probability by breaks feasibility (issue #12033).
The canonical source is
D5/S3/Quantum/Entanglement/RelaxedHardyNoSignallingOptimum.lean. Its public
declarations are IsNSBox, RelaxedHardy, claim and result. The frozen
module state has statement identity sha256:8a58e4dbc53a7b468818763671b6499902ce328c4112413c29356d63d5917782. The result declaration has
statement identity sha256:03e1ccb3bd627872c77b76d062d918e9c60bae692cedd2dd1f13c1add54f2047. The Freeze event is sha256:439982eecd95b434385a6edf6abc6faac88b8f4f2197f929b1922b925ead94ed. It has no
project-level frozen prerequisites (pinned Mathlib only). The proof uses
only the standard axioms propext, Classical.choice and Quot.sound; no
sorry, native_decide, or new axiom.
Triage
Tier 1 published conjecture; resolution Refuted by
D5/S3/Quantum/Entanglement/RelaxedHardyNoSignallingOptimum.result.
proof_shape: bind-only (instantiation of the hypotheses and linear
arithmetic); admission_basis: open-problem-resolution (issue #12033).
Utility certified-instance, refuting claim.
What the refutation shows
- Proved in this module: for four parties with two outcomes each, every no-signalling box satisfying the relaxed Hardy conditions has success probability at most .
- Where the conjecture fails: the third condition is imposed only for pairs containing the fixed party , so each of the parties forces a separate event of probability at least under . These events and the all- string are disjoint, so the bound decreases like . At it equals , which is the value the paper computed and extrapolated.
- Model derivation, not formalized (steps 1–4 above): for every , every and every fixed ; the same argument works with different outcome numbers .
- Computed, not formalized (orchestrator): the optimum equals for , , , , , , and the optimal box puts on each of , , , under .
- Computed, not formalized (scout reading): optima at and at ; other readings of the third condition give (all pairs), (a single pair) and (none) at .
- Open here: whether the optimum equals for every and (attainability beyond the computed cases), and the optimal quantum success probability of the test.
- Unchanged: the paper’s theorem that every quantum state satisfying (relH) is genuinely nonlocal does not depend on the conjecture. Its comparison with the conventional argument (value ) holds more strongly, since the relaxed test’s no-signalling optimum is at most (model derivation above), a bound that decreases with .
ASSUMED-UNVERIFIED
The bounded literature check does not establish worldwide priority or absence of an independent answer. The Lean kernel verifies the encoded statement and its axiom closure; correspondence to the external paper, including the encoding of outcomes by , the reading of “the optimal value is ” through its consequence that success probabilities approach , and the restriction to and a common as a weakening, is checked by reading the source and the definitions.