ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let κ\kappa be a regular uncountable cardinal. Write χ(κ)\chi(\kappa) for the C-sequence number of κ\kappa, and call a poset P\mathbb P κ\kappa-Knaster if every subset of P\mathbb P of cardinality κ\kappa contains a subset of cardinality κ\kappa whose distinct elements are pairwise compatible. Let Pω\mathbb P^\omega denote the countable product of P\mathbb P. The conjecture. The following are equivalent:

  • χ(κ)≤1\chi(\kappa) \leq 1;
  • for every κ\kappa-Knaster poset P\mathbb P, Pω\mathbb P^\omega is κ\kappa-Knaster as well.

This conjectures a connection between the C-sequence number and the infinite productivity of the κ\kappa-Knaster property. The statement is presented among questions that remain open.

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.