The non-primitivity conjecture for random countable Boolean algebras
Statement
Let be the Cantor set and let be the countable atomless Boolean algebra. Let be the set of finite binary strings, including the empty string, and let be a binary tree of non-zero elements of generating , with and . Define a measure by , , by assigning to both children of any with , and by assigning to and assigning or to with probability whenever . Non-primitivity conjecture. For the measure constructed above, is -primitive with probability . 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.