A fully supported local information maximum on the full two-shift
Let be the full two-shift, let be the partition used to define information, and consider the space of one-step Markov measures on . A measure is fully supported when every allowed cylinder has positive measure, and a local maximum is understood relative to this space. Fully supported local-maximum conjecture. There is a fully supported one-step Markov measure that is a local maximum of among all one-step Markov measures. The assertion is suggested by numerical computations in the source; no proof or resolution is supplied.
References
2 papers in this index state this conjecture (2015–2016). The statement above is taken from the most recent of them; the others are arXiv:1512.01143.
Source: Karl Petersen, “Measuring Complexity in Cantor Dynamics”, arXiv:1607.02425 (2016).
Progress summary
A submitted preprint claims a proof, but no independent verification was found and the conjecture remains unsettled.
The conjecture asserts that a fully supported one-step Markov measure locally maximizes the specified information quantity among such measures on the full two-shift. The indexed sources from 2015–2016 report numerical motivation but no proof or resolution as of July 2016.
Community submission (unverified) — November 7, 2026
A submitted preprint argues that the conjecture holds, claiming a complete proof for stationary binary one-step Markov laws and asserting convergence for the witness and nearby comparison laws. This is an unverified community submission, with no independent mathematical assessment found.
Current status (as of November 2026): The conjecture has no independently verified resolution; a November 7, 2026 community submission claims a proof, but that claim remains unverified.
Solutions 1
A fully supported local intricacy maximum among stationary binary one-step Markov lawsSee full solution
Result and 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
Complete proof: A fully supported local intricacy maximum among stationary binary one-step Markov laws · PDF.
The paper page contains the supplementary proof-source JSON and extract_sources.py. The linked paper supplies the complete argument and states the precise scope of the Lean certificate, ordinary proofs, supporting computations, and source interpretation. Those qualifications are retained here; a supporting computation is not a proof of a broader statement.
This is an AI-assisted research preprint. Internal review is not external journal peer review. Bounded prior-art searches do not establish worldwide priority. See the paper for formalization and trust limits.