The generic pair conjecture for dependent diagrams

At least 11 years old · documented by

Fix a dependent diagram DD and a strongly compact cardinal θ>∣T∣\theta>|T|. Let θ<λ=λ<λ\theta<\lambda=\lambda^{<\lambda} and λ+=2λ\lambda^{+}=2^{\lambda}. Let

Mˉ=⟨Mα:α<λ+⟩\bar{M}=\langle M_{\alpha}:\alpha<\lambda^{+}\rangle

be an increasing continuous sequence of elementary substructures of CD\mathfrak{C}_{D}, each of cardinality λ\lambda, such that

M=⋃α<λ+Mα{\bf M}=\bigcup_{\alpha<\lambda^{+}}M_{\alpha}

is DD-saturated of size λ+\lambda^{+}. The generic pair conjecture. There exists a club E⊆λ+E\subseteq\lambda^{+} such that whenever α1<β1\alpha_{1}<\beta_{1} and α2<β2\alpha_{2}<\beta_{2} are in EE and all four ordinals have cofinality λ\lambda, one has

(Mβ1,Mα1)≅(Mβ2,Mα2).(M_{\beta_{1}},M_{\alpha_{1}})\cong(M_{\beta_{2}},M_{\alpha_{2}}).

This is the finite-diagram generalization of the generic pair conjecture; the paper studies it for dependent diagrams using homogeneous models and strong compactness. Its status is not resolved in the supplied text.

References

Primary source

Itay Kaplan, Noa Lavi and Saharon Shelah, “The generic pair conjecture for dependent finite diagrams”, arXiv:1410.2516 (2014).

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.