Searcharxiv⌕ Search

arXiv subjects

Pietro Ursino

Publications and source records attributed to Pietro Ursino.

11 recordsLinked to original sources

Extreme amenability and failure of the Lévy property for the trace-class special unitary group

We prove that the trace-class special unitary group, equipped with the trace-norm topology, is extremely amenable but is not a Lévy group, answering questions posed by Pestov. The failure of the Lévy property follows from a uniform non-concentration estimate for every nontrivial compact subgroup. Extreme amenability is established through a transverse spectral-gap estimate and trace-norm duality, yielding asymptotic invariance of Lipschitz observables under each fixed finite-dimensional special unitary subgroup. A limiting argument then gives fixed points for continuous actions on arbitrary compact Hausdorff spaces. We also formulate an abstract criterion for extreme amenability based on asymptotic quadratic invariance along a dense chain of compact subgroups. Neither argument uses concentration results for other Schatten exponents.

math.GR↗

Decidability of the satisfiability problem for Boolean set theory with the unordered Cartesian product operator

The satisfiability problem for multilevel syllogistic extended with the Cartesian product operator (MLSC) is a long-standing open problem in computable set theory. For long, it was not excluded that such a problem were undecidable, due to its remarkable resemblance with the well-celebrated Hilbert's tenth problem, as it was deemed reasonable that union of disjoint sets and Cartesian product might somehow play the roles of integer addition and multiplication. To dispense with nonessential technical difficulties, we report here about a positive solution to the satisfiability problem for a slight simplified variant of MLSC, yet fully representative of the combinatorial complications due to the presence of the Cartesian product, in which membership is not present and the Cartesian product operator is replaced with its unordered variant. We are very confident that such decidability result can be generalized to full MLSC, though at the cost of considerable technicalities.

math.LO↗

Two Dichotomy Theorems

We introduce the Dichotomy Property, a new property of some languages in Set Computable Theory, in order to explore the expressivity of some languages which are extensions of MLS. By-product we prove undecidability of MLS extended with not ordered cartesian product and disjoint unary union operators.

math.LO↗