ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let a Specker order and the orders I,JI,J be as described immediately before the statement. Let TT be an Aronszajn tree, let c:T→2c:T\to 2, and write ≤T\leq_T for its tree order. Shelah's consistency conjecture. It is consistent that any Specker order contains a suborder as above, and that if I,JI,J are as above, then I,JI,J or J∗J^* have uncountable isomorphic suborders. Equivalently, for every Aronszajn tree TT and every coloring c:T→2c:T\to 2, there are an uncountable X⊆TX\subseteq T and ℓ∉0,1\ell\notin\\{0,1\\} such that for every distinct x,y∈Xx,y\in X, the maximal z≤Tx,yz\leq_T x,y satisfies c(z)=ℓc(z)=\ell.

The source says that the second consistency assertion is proved by a cited construction; the supplied status evidence says the associated claim is resolved by constructing a very special Aronszajn tree.

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.