Algebraic Independence Relations in Randomizations
Uri Andrews, Isaac Goldbring, and H. Jerome Keisler

TL;DR
This paper investigates algebraic independence in the randomizations of complete first-order theories, revealing how properties like extension and local character behave under different conditions.
Contribution
It characterizes algebraic and pointwise algebraic independence in randomizations, showing how these properties depend on the original theory T.
Findings
Algebraic independence in T^R satisfies extension and local character when algebraic and definable closures coincide in T.
Pointwise algebraic independence in T^R satisfies extension for countable sets and has finite character.
Certain properties like base monotonicity depend on whether algebraic independence in T holds.
Abstract
We study the properties of algebraic independence and pointwise algebraic independence in a class of continuous theories, the randomizations of complete first order theories . If algebraic and definable closure coincide in , then algebraic independence in satisfies extension and has local character with the smallest possible bound, but has neither finite character nor base monotonicity. For arbitrary , pointwise algebraic independence in satisfies extension for countable sets, has finite character, has local character with the smallest possible bound, and satisfies base monotonicity if and only if algebraic independence in does.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Topology and Set Theory · Advanced Algebra and Logic · Constraint Satisfaction and Optimization
