On minimal flows of commutative $p$-adic groups
Ningyuan Yao, Zhentao Zhang

TL;DR
This paper investigates the relationship between weakly generic and almost periodic types in the definable topological dynamics of commutative $p$-adic groups, establishing conditions for their coincidence related to definable $f$-generics and stationarity.
Contribution
It extends previous work by characterizing when weakly generic types coincide with almost periodic types specifically for commutative $p$-adic groups, linking this to definable $f$-generics and stationarity.
Findings
Weakly generic types coincide with almost periodic types if and only if $G$ has definable $f$-generics or is stationary.
The results apply specifically to commutative groups definable over the $p$-adic numbers.
The work builds on and extends previous results in definable topological dynamics and $p$-adic groups.
Abstract
We study the definable topological dynamics of a definable group acting on its type space, where is a structure and is a group definable in . In \cite{Newelski-I}, Newelski raised a question of whether weakly generic types coincide with almost periodic types in definable topological dynamics. In \cite{YZ-Sta}, we introduced the notion of stationarity, showing the answer is positive when is a stationary definably amenable group definable over the field of -adic numbers or an -minimal expansion of real closed field. In this paper, we continue with the work of \cite{YZ-Sta}, focusing on the case where is a commutative group definable over the field of -adic numbers, and showing that weakly generic types coincide with almost periodic types if and only if either has definable -generics or is stationary.
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 · Computability, Logic, AI Algorithms
