The generic constancy conjecture for causal stochastic solutions
The generic constancy conjecture for causal stochastic solutions
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.
Sources & referencesView supporting material
Primary source
Juan-Pablo Ortega and Florian Rossmannek, “Stochastic dynamics learning with state-space systems”, arXiv:2508.07876 (2026).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.