The generic constancy conjecture for causal stochastic solutions
Statement
Let be the space of input probability laws and the space of state–input probability laws, with projection
Let and denote, respectively, the numbers of causal stochastic solutions and causal stochastic outputs associated with an input law . Assume that the state-space system measurably distinguishes reachable states when the relevant reachable-state relation is Borel measurable and admits a measurable readout of the next output.
Generic constancy conjecture. Suppose that and are Polish and that is proper. Then, is generically constant, and so is if the state-space system measurably distinguishes reachable states.
This is posed as an open problem because the paper does not know whether the causal stochastic FMP holds generically; the conjecture would yield generic control of bifurcations of causal stochastic solutions and outputs.
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.