ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let WW be the Cantor set D1\mathscr{D}_{1} and let R=Co⁡(W)R=\operatorname{Co}(W) be the countable atomless Boolean algebra. Let II be the set of finite binary strings, including the empty string, and let {Ai∈R∣i∈I}\{A_i\in R\mid i\in I\} be a binary tree of non-zero elements of RR generating RR, with A∅=RA_{\emptyset}=R and Ai=Ai0∔Ai1A_i=A_{i0}\dotplus A_{i1}. Define a measure σ ⁣:R→{0,1,o}\sigma\colon R\rightarrow\{0,1,o\} by σ(0)=o\sigma(0)=o, σ(R)=1\sigma(R)=1, by assigning 00 to both children of any AiA_i with σ(Ai)=0\sigma(A_i)=0, and by assigning 11 to Ai1A_{i1} and assigning 00 or 11 to Ai0A_{i0} with probability 0.50.5 whenever σ(Ai)=1\sigma(A_i)=1. Non-primitivity conjecture. For the measure σ\sigma constructed above, K(W)K(W) is σ\sigma-primitive with probability 00. This suggests that almost all countable Boolean algebras are non-primitive, whereas most easily constructed such algebras are primitive.

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.