ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let FtF^t be a semi-flow, and let Down⁡\operatorname{Down} and Down⁡∗\operatorname{Down}^* be stream structures with graphs GammaGamma and Gamma∗Gamma^*, respectively. Assume every node of Down⁡\operatorname{Down} is a subset of a node of Down⁡∗\operatorname{Down}^*. Let N1,N2N_1,N_2 be nodes of Down⁡\operatorname{Down} and let N1∗,N2∗N_1^*,N_2^* be nodes of Down⁡∗\operatorname{Down}^* such that N1asubseteqN1∗N_1 asubseteq N_1^* and N2asubseteqN2∗N_2 asubseteq N_2^*.

Monotonicity conjecture. If N1∼SN2N_1\thicksim_S N_2 in Down⁡\operatorname{Down}, then N1∗∼SN2∗N_1^*\thicksim_S N_2^* in Down⁡∗\operatorname{Down}^*; equivalently, GammaGamma maps into Gamma∗Gamma^*.

This conjecture asserts that enlarging the nodes preserves the graph relation. The supplied text gives no indication that it has been proved or refuted.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.