2000 character limit reached
A non-archimedean definable Chow theorem
Published 14 Sep 2020 in math.AG and math.LO | (2009.06134v1)
Abstract: Peterzil and Starchenko have proved the following surprising generalization of Chow's theorem: A closed analytic subset of a complex algebraic variety that is definable in an o-minimal structure, is in fact an algebraic subset. In this paper, we prove a non-archimedean analogue of this result.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.