The monotonicity conjecture for Lascar equivalence of countable tuples

About 14 years old · traced to

Let a‾\overline a and b‾\overline b be countable tuples from a monster model, with b‾\overline b containing a‾\overline a. Let ELa‾E_L^{\overline a} and ELb‾E_L^{\overline b} be the corresponding Lascar-equivalence relations, and let FLa‾F_L^{\overline a} and FLb‾F_L^{\overline b} be their restrictions to the respective Kim--Pillay classes. Tuple monotonicity conjecture. One has

ELa‾≤BELb‾andFLa‾≤BFLb‾.E_L^{\overline a}\leq_B E_L^{\overline b}\qquad\text{and}\qquad F_L^{\overline a}\leq_B F_L^{\overline b}.

This is proposed as a generalization of the preceding upper-bound conjecture; no resolution is supplied in the paper.

References

Primary source

Krzysztof Krupinski, Anand Pillay and Slawomir Solecki, “Borel equivalence relations and Lascar strong types”, arXiv:1204.3485 (2012).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.