The symbolic extension conjecture for C^2 maps
Statement
A map is called a symbolic extension of a dynamical system if it is a subshift over a finite alphabet together with a continuous surjection satisfying . Symbolic extension conjecture. Every map has a symbolic extension. This concerns whether the entropy structure of every twice-differentiable map can be modeled by a finite-alphabet subshift. The statement is presented as a conjecture in the source, but the supplied evidence says it has been proven by Downarowicz and Maass for interval maps and by Burguet for surface maps; its status for general maps is therefore not established by the supplied evidence.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.