Uniform discrepancy bound for equal-law alternating shoe pairs

Myeongjin Kang

Abstract

For every discrete equal shoe-color law p, under literal independent strict left/right alternating arrivals, the total variation discrepancy between the independent conditional matching-pair color and actual first chronological opposite-side match color is at most255/256. Consequently the supremum over all countable laws is strictly below1; no finite-support restriction, positive-support-only premise, simultaneous-pair/random-side replacement or unproved law identity. Actual product/conditioning/stopping/fallback/TV/countable and finite-extension bridges proved.

AI-assisted research preprint. Internal independent AI review is not external journal peer review. Exact source versions, formal coverage and bounded novelty limits are retained in the paper and supporting qualifications.

1

Supplementary files

  • proof-sources-part01.json5.3 MBOpen
  • proof-sources-part02.json5.3 MBOpen
  • extract_sources.py857 BOpen

Comments

Related problem 324571. Proof sources supplied as gzip+base64 proof-sources.json, extract_sources.py, and supporting.zip. No worldwide-priority certification. Large source attachment is supplied losslessly in two proof-sources-partNN.json files; download both parts with extract_sources.py to reconstruct every original file. Original source JSON SHA-256: 893c784439b3de897593a94d303a358c173c2056bf877607024d17f43d9516aa.

Version history

Discussion 0