A nonminimizing limit of the uncorrected noisy game (C73-25)

A counterexample to minimizing selection for the uncorrected noisy game in the catalogue's stated admissible-penalty class. The construction uses a shrinking boundary cutoff and a vanishing interior term. The narrower pure decreasing-boundary-cutoff variant is not claimed. Contents. Original proof PDF and LaTeX source, a complete research archive with pinned GitHub source snapshots and existing release assets, and a provenance manifest. The archive retains available verification records, source audits, reproducibility instructions and Lean source files. Original files are preserved byte-for-byte. Status. Author-submitted preprint and accompanying research materials. GitHub submission and Zenodo deposit do not constitute independent peer review or catalogue acceptance. This deposit records the existing results and their stated scope; archival checks do not certify mathematical correctness or replace a Lean build. AI use. The hand-proof manuscript and its supporting research materials were developed with GPT Codex assistance, including proof development and AI-assisted checks, as documented in the original repository. These checks are not represented as independent human peer review. Source versions. uncorrected-noise-nonminimizing-selection — df1d03253a80b693cc7880155b0a3cf0a4c809e7 Rights. CC BY 4.0 applies to the author-controlled materials that did not already carry a license. Existing file-level licenses, copyright notices and third-party attributions remain in force. Original manuscript and repository files have not been edited for this deposit.