A fully supported local intricacy maximum among stationary binary one-step Markov laws
Abstract
Existence of a fully supported integer-shift-invariant stationary one-step Markov probability law on the full two-sided binary shift locally maximizing rank-zero uniform-subset intricacy relative to all stationary one-step Markov laws in the weak topology, with actual finite-limit convergence at witness and nearby comparison laws
AI-assisted research preprint. The scoped main statement has a Lean certificate; internal AI review is not external journal peer review. Bounded prior-art searches do not certify worldwide priority. See the paper for qualifications and supplementary results not covered by Lean.
Supplementary files
Comments
Submitted by Myeongjin Kang. Original AI-assisted research draft and source proof package; draft preparation and internal campaign-status language in the PDF records its preparation stage. Related MathDB problem 333569. Scope: Existence of a fully supported integer-shift-invariant stationary one-step Markov probability law on the full two-sided binary shift locally maximizing rank-zero uniform-subset intricacy relative to all stationary one-step Markov laws in the weak topology, with actual finite-limit convergence at witness and nearby comparison laws Attachments: proof-sources.json preserves UTF-8 source files from the accepted proof archive; extract_sources.py reconstructs them. The original archive SHA-256 is recorded in the JSON.