Skip to content

SC-39: card-game Bell boundary at Main §3.3's conditions (book ch01, ch03) - #977

Closed
amaybaum wants to merge 5 commits into
mainfrom
corpus/sc39-card-bell
Closed

amaybaum wants to merge 5 commits into
mainfrom
corpus/sc39-card-bell

Conversation

@amaybaum

Copy link
Copy Markdown
Owner

Source-correction unit for #946 (gate) and #918 (Introduction). It comes from the full-corpus audit of #918 at 60c976fe: R-32 / A-B3, the card-Bell sentence.

  • Base: main at 0d917665.
  • Head: 0e235c3c.
  • Review: the independent review returned ACCEPT on this exact head after five rounds. The owner required that:
    • the correction cover every post-deal operation, rule-driven shuffles included;
    • the reviewer's CHSH = 4 counterexample be shown to be excluded;
    • every admitted local strategy be shown to have CHSH ≤ 2.

Finding

Book ch01:286 and ch03:188, and their FULL mirrors, said that no arrangement of cards violates a Bell inequality, with no conditions. Several card games reach CHSH = 4:

  • setting-dependent reversible dynamics, or a dealer that reads both settings (a PR box);
  • a rule-prescribed shuffle that reads the other player's setting;
  • a schedule chosen by the other player's setting;
  • two coins that are each setting-independent but jointly encode ab;
  • a readout rule selected by the other player's setting.

Correction

Both sites now state the boundary at Main §3.3's hypotheses. Such a game violates no Bell inequality when all of the following hold:

  • once the deal is down, every operation (each shuffle the rules prescribe, each move and each setting choice) reads and writes one player's own cards only;
  • which operation is applied to a player's cards, and how that player's ±1 outcome is read from them, depends only on those cards, that player's own setting and on chance that, taken together with the deal, is independent of the settings;
  • an outcome is recorded in every run, and no run is set aside;
  • the settings are chosen independently of the deal.

The ch03 gloss states the joint condition. Each chapter line is byte-identical to its FULL mirror.

Evidence

  1. General claim: a paper reduction for any deck and any finite sequence, in the track README:
    • admitted operations are products f_A × id or id × g_B, closed under composition;
    • private or shared chance is dealt in advance as part of Ω′ = (deal, all chance), jointly independent of the settings;
    • responses are q_a(Ω′), r_b(Ω′);
    • Main §3.3 then gives |CHSH| ≤ 2.
  2. Finite instance: card_bell_check.py (25 checks, all exact), an exhaustive four-card instance, not the proof.
    • Countercontrols that must reach 4, and do: X1, X1′ (the reviewer's counterexample), X2, X3, L1, L2, P2, C1, C2, C3.
    • Admit controls that must stay ≤ 2 or admit, and do: P1, C4 (shared setting-independent chance), ADM2, E3, O3a.
    • A PIN check that both sentences appear in their chapters and in FULL.

Checks

These were re-run by the reviewer under python3 -I:

  • card_bell_check.py: 25 PASS, output byte-identical to the committed .out.
  • coverage_check and edge_rigidity_probe pass.
  • release_gate passes every step except lean-axioms, which runs in CI.
  • Book: 559 pages. The extra page is reflow from the longer sentences; the median characters per page are steady.

Cross-unit

The per-claim record is in verification/audits/manuscript/intro-corpus-audit-20261026/tracks/SC39-card-bell/README.md.

No merge is authorized. Merging needs owner approval at an exact SHA, as a normal merge commit.


Generated by Claude Code

- ch01:286 / FULL:630: "no arrangement of cards on a table violates a
  Bell inequality" restated with the ceiling's conditions: deterministic
  shuffles, own-card moves and setting choices after the deal, own-card
  +-1 outcome in every run, settings independent of the deal.
- ch03:188 / FULL:1064: the same restriction; setting independence added
  to "local through and through"; "no table can" -> "no such table can".
- Track check card_bell_check.py: K1 |CHSH| <= 2 over all local
  deterministic tables; countercontrols X1-X3 (post-setting global move,
  setting-dependent deal, discarded runs) each reach 4.
- Regenerated the book (.tex/.pdf).

Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
Claude-Session: https://claude.ai/code/session_01Y87wExth9RoUb3dtbumhTb
…ffles included

Independent review B1: the game-rule shuffle stayed unrestricted, so a
deterministic whole-deck shuffle after the settings could carry A's
setting card into B's hand (CHSH = 4). The card sentences at ch01:286 /
FULL:630 and ch03:188 / FULL:1064 now restrict every operation after the
deal, including each shuffle the rules prescribe, to one player's own
cards, and state the every-run and no-run-set-aside conditions; the
opening "local classical toy" is scoped (O4); $\pm1$ follows SC-33 (O5).

card_bell_check.py: X1' encodes the reviewer's counterexample (CHSH = 4);
an admissibility checker rejects it (ADM1) and admits a within-hand
shuffle (ADM2); E0-E2 enumerate every admitted post-deal operation
sequence on a four-card deck, check the reduction to response tables
(products closed under composition) and |CHSH| <= 2. K1 label fixed
(4 x 4 = 16 pairs). README updated. Book rebuilt.

Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
Claude-Session: https://claude.ai/code/session_01Y87wExth9RoUb3dtbumhTb
Delta review of ced30f6 (REVISE):
- B1: the card sentences (ch01:286 / FULL:630, ch03:188 / FULL:1064) now
  say every post-deal operation "reads and writes one player's own cards
  only" (closing L1, a write-only-B shuffle that reads A's setting card)
  and that which operation is applied to a player's cards depends on
  those cards alone (closing L2, a b-dependent schedule of two own-card
  operations). Both loopholes are must-fire countercontrols (CHSH = 4);
  the checker's read test is stated; E3 applies the product test to
  setting-indexed schedules.
- R1: determinism replaced by "any chance a shuffle or move uses is
  private to one player and drawn independently of the settings", at both
  sites; P1 (independent private coins, max |CHSH| = 2) and P2 (a shared
  setting-correlated coin, CHSH = 4) added.
- R2: README separates the paper argument (any deck, any finite sequence)
  from the exact finite instance E0-E3; the 65,536 reach count is marked
  as a bounded run. r32 note recorded. Book rebuilt.

Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
Claude-Session: https://claude.ai/code/session_01Y87wExth9RoUb3dtbumhTb
…rule

Review of f0e8e76 (REVISE):
- B1/B2: the private-chance clause is replaced by one clause covering
  both operation choice and readout: they depend only on the player's own
  cards and on chance drawn, together with the deal, independently of the
  settings (Omega' = (deal, all chance), jointly setting-independent).
  Countercontrols C1 (two marginally uniform one-player coins, jointly
  setting-dependent) and C2 (A's coin jointly encoding ab with the deal)
  give CHSH = 4; C4 (a shared coin independent of the settings) admits,
  max |CHSH| = 2.
- B3: the readout rule is covered; C3 (own-card readouts selected by b)
  gives CHSH = 4.
- B4: ch01 uses ch03's passive "is applied", covering player-chosen moves.
- ch03: "neither the deal nor any chance the game uses knows the settings".
- README: proof steps 3-5 restated (operation chosen from own cards and
  dealt chance is a map R_A -> R_A; Omega' jointly independent; readout
  fixed by own cards and dealt chance); condition map, site table and r32
  clause list updated. Book rebuilt.

Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
Claude-Session: https://claude.ai/code/session_01Y87wExth9RoUb3dtbumhTb
Optional edits from the round-5 review (ACCEPT on b468ca6), applied at
ch01:286 / FULL:630 and ch03:188 / FULL:1064:
- "chance that, taken together with the deal, is independent of the
  settings" (no temporal reading);
- "depends only on those cards, that player's own setting and on chance
  ..." (the setting choice depends on the player's own setting before it
  is written);
- ch03 gloss: "the deal, taken together with any chance the game uses,
  does not know the settings" (the joint condition C1/C2 need).

card_bell_check.py: O3a (every own-setting-selected readout rule, max
|CHSH| = 2), O3b (E3 still separates own- from other-setting schedules),
and a PIN check on the exact book sentences; 25 checks pass. README
condition map, site table, r32 note and K1 docstring updated. Book
rebuilt (559 pages).

Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
Claude-Session: https://claude.ai/code/session_01Y87wExth9RoUb3dtbumhTb

Copy link
Copy Markdown
Owner Author

Lean kernel check failed on 0e235c3c (run 40636786901) in its install step, before any check ran. elan could not download lean-4.35.0-linux.tar.zst from releases.lean-lang.org because of an SSL connect error. This PR changes no Lean file and no workflow file.

The same download error has now hit #974 (04:45 UTC), #976 (05:09) and this PR (05:14). The Lean checks on #973 (04:42) and #975 (04:52) passed. So the failure is intermittent and comes from the toolchain download, not from any PR content.

Once this run finishes I will re-run the failed job once. If it fails again, I'll report it as an infrastructure blocker; it won't be treated as passing.


Generated by Claude Code

Copy link
Copy Markdown
Owner Author

Closing without merge: fully absorbed into main. The owner approved this closure in the Workstream D survival audit, checked against main c596904a.

Both SC-39 card-game corrections are on main verbatim:

  • ch01:286 = FULL:630.
  • ch03:188 = FULL:1062.

No unrestricted card-game Bell claim remains in the corpus. The branch and history are kept.


Generated by Claude Code

@amaybaum amaybaum closed this Oct 31, 2026
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants