WorksMathematics
Definably isometric cuboids over Hensel minimal fields
Abstract
We show that, over a valued field with -h-minimal theory , two Cartesian products of balls must be equal up to translation and coordinate permutation in order for there to exist a definable surjective isometry between them. For this purpose, we introduce a notion of relative dimension for cuboids in that is computed combinatorially and relates to the notion of dimension for definable sets in Hensel minimal theories when has infinite residue field.
Introduction
Let be a valued field with infinite residue field . Then any bijection from to lifts to an isometric bijection from to , where and denote the valuation ring and valuation ideal of , respectively. Precisely when such a map is first-order definable is not clear. In general, it is not clear when there exists a definable surjective isometry between two Cartesian products of balls in . We show that, when is 1-h-minimal, two Cartesian products of balls in must be equal up to translation and coordinate permutation in order to be definably isometric. This question was asked by Immanuel Halupczok and our presented answer will be used in an upcoming article by Cluckers, Halupczok and Vermeulen.
Main results
Let be a non-trivially valued field, viewed as a structure in a language that contains the language of valued fields . Let denote the valuation on , multiplicatively written, that is extended to by the sup norm. We call a subset of definable if it is definable with any parameters from . Our main result is the following.
Theorem 1.1 (Theorem 3.13). Assume that is 1-h-minimal and let be Cartesian products of balls in . If and are definably isometric, then and are equal up to translation and coordinate permutation.
In particular, this holds true regardless of the residue characteristic of . Our notion of 1-h-minimality therefore refers to the general case described in [2 Theorem 2.2.8]. Cartesian products of balls in are the main object of study in this article and will be called cuboids throughout. A precise definition of cuboids and isometries is given in § 2. For the purpose of proving Theorem 1.1, we introduce a notion of relative dimension for cuboids . This notion of dimension is defined purely combinatorially is consistent with the notion of dimension for definable subsets of in the sense of [1 Definition 5.3.1]. More precisely, for a cuboid around and a ball around , we have the following characterization.
Proposition 1.2 (Proposition 3.15). Assume that is 1-h-minimal and that has infinite residue field. Then is the minimal dimension of a definable set such that covers .
Here, denotes the natural projection from to . This map is essential for our proof of Theorem 1.1 and will be used all throughout § 3. The proof of Theorem 1.1 is divided into two parts. When has finite residue field, the claim of Theorem 1.1 applies to all isometric cuboids, regardless of definability. The techniques used in this part are elementary. When has infinite residue field, the key ingredient to the proof is the following result.
Proposition 1.3 (Proposition 3.9). Assume that is --minimal. For every definable set there exists some such that for every ball around and every finite subset , one has
Here, and denote the natural projections from to and from to , respectively. For a precise definition, see § 3.
Acknowledgements
The author would like to thank Immanuel Halupczok for giving them this question and for many helpful discussions throughout all stages of writing this article.
AI statement
During the creation of this article, the author used a free plan of ChatGPT for broad mathematical discussion. The proofs of Lemma 2.6 and Lemma 3.2 were suggested by ChatGPT. The entire article, including the aforementioned proofs, was written by the author.
Relative dimension of cuboids
Throughout, let denote the projection to the th coordinate for .
Definition 2.1. A ball in is a proper and infinite subset of such that for all and , implies .
Note that this definition includes balls derived from cuts in the value group. Further note that whether or not a given set is a ball depends on the ambient space. For example, if is an extension of valued fields and is a ball in , then is not necessarily a ball in . Since the ambient space will always be apparent, we often omit to mention it.
Definition 2.2. A cuboid in is a Cartesian product of balls in .
Clearly, every ball in is a cuboid in . Like balls, any cuboid in that contains is a subgroup of and the non-empty intersection of two cuboids is another cuboid.
Definition 2.3. An isometry between subsets is a bijection such that
We call and isometric if there exists an isometry between them. Moreover, we call and definably isometric if there exists a definable isometry between them.
As shown in the introduction, whenever has infinite residue field, there exists an isometry between and , where and denote the valuation ring and valuation ideal of , respectively. We will see that such an isometry cannot be definable. By showing that definable isometries between cuboids preserve a certain sense of size and shape. To make this precise, we introduce the following notion of relative dimension for cuboids.
Definition 2.4. Let be cuboids around .
(i) The dimension type of over is the tuple with entries if and only if for . We denote it by .
(ii) The dimension of over is the sum of entries of . We denote it by .
Clearly, translation does not affect whether two cuboids are definably isometric. Hence, we may assume without loss of generality that all cuboids in discussion contain .
We will see that definably isometric cuboids have the same dimension over certain balls in the sense of the above definition. In particular, it will follow from Proposition 3.12 that the cuboids and must have the same dimension over every ball in in order to be definably isometric. This fails over , as and .
Remark 2.5. Let be cuboids around . Then .
Lemma 2.6. Let be a cuboid around and let be strictly nested balls around . Then .
Proof. Fix some index . Clearly, the inclusion implies . Now suppose . Since and have non-empty intersection, the balls and are nested. Hence, equals or and in either case one has . □
:::
Definable isometries between cuboids
In this section, we go about proving Theorem 1.1. We treat having finite and infinite residue field separately. For a ball around , we often make use of the natural projection
The name is short for voxelization with voxels the size of .
Remark 3.1. Let be a cuboid and a ball, each around . Then is the unique tuple with the least sum of entries such that covers . Here, and .
Lemma 3.2. Let be isometric cuboids and a ball, each around $0. Then
(i) the cuboids and are isometric, and
(ii) there exists a bijection between and .
Proof. Let be an isometry. For (i), see that . Hence, the mapping gives an isometry from to . For (ii), all satisfy if and only if . Hence, descends to a well-defined bijection from to . □
Finite residue field
When has finite residue field, we can use Lemma 3.2 to find a finite bijection between and for suitable isometric cuboids and balls .
Remark 3.3. Assume that has finite residue field . Let be a cuboid around and let and for some in the value group of . If is contained in , then .
Lemma 3.4. Assume that has finite residue field . Let be isometric cuboids around and let for some in the value group of . Then .
Proof. Let . By Lemma 3.2, there exists a bijection between and . Hence, Remark 3.3 yields . Now apply Lemma 2.6. □
:::
Proposition 3.5. Assume that has finite residue field and let be cuboids. If and are isometric, then and are equal up to translation and coordinate permutation.
Proof. Assume that and are isometric. Since translation and coordinate permutation do not affect whether and are isometric, we may assume without loss of generality that and each contain and that and for . Suppose that and are not equal. Then there is a largest index such that and differ. Without loss, assume . By choice of , this implies . Pick some and let . Then , hence and . But this contradicts Lemma 3.4.
Infinite residue field
When has infinite residue field, the previous strategy fails, since is either a singleton or infinite for any cuboid and ball . To bypass this issue, we assume that the theory of is 1-h-minimal. This way, we are able to get finite approximations of for any definable set and ball in the form of Proposition 1.3.
Definition 3.6. A map on a subset is called 1-Lipschitz if
For the rest of this section, let denote the projection to the first coordinates for . The following theorem is a simple corollary of [2 Theorem 3.3.3, Addendum 4].
Theorem 3.7 (1-Lipschitz cell decomposition). Assume that is 1-h-minimal. Then for any definable set , there exists a finite partition of into definable subsets , together with coordinate permutations , such that each is the graph of a definable 1-Lipschitz map
Remark 3.8. Let be a subset for some integer . Then any 1-Lipschitz map satisfies
Hence, for any ball around , the projection descends to a well-defined bijection .
With this, we are able to prove Proposition 1.3.
Proposition 3.9 (Counting balls). Assume that is 1-h-minimal. For every definable set there exists some such that for every ball around and every finite subset , one has
Proof. Let and be as in Theorem 3.7 and fix some index . Let be a ball around and let be a finite subset. Since , one has
Since is the graph of a 1-Lipschitz map on , where , Remark 3.8 yields the upper bound
Since each is bounded by , we obtain
For the rest of this section, let , , be cuboids around and let , be balls around . For a subset and tuple , we write for , where and .
Lemma 3.10. If , then there exists a ball such that and .
Proof. Let and . Since is a proper subset of , is non-empty. Choose such that the projection is inclusion-minimal among for all . Set . Then clearly, is contained in . Choose some and consider the point with coordinates
Then and .
For a given sequence , we write for .
Lemma 3.11. Assume that has infinite residue field. If , then there is a sequence in , starting at , such that and for all .
Proof. If , then is not a subset of . In turn, the intersection is a proper subset of . Hence, Lemma 3.10 yields a ball such that and . In particular, there is some index such that and . Since , this leaves . Since is a ball, we have .
Since has infinite residue field, the quotient is infinite. Hence, there is a sequence in , starting at , such that each lies in a unique coset of . Since , the sequence satisfies the necessary conditions.
Proposition 3.12. Assume that is 1-h-minimal and that has infinite residue field. If and are definably isometric, then .
Proof. Without loss of generality, assume . Let be a definable isometry. By Remark 3.1, the definable set is of dimension and covers . Since is an isometry, the image is also of dimension , and by the proof of Lemma 3.2, covers .
If , then and we are done. If , then there exists a sequence in as described in Lemma 3.11. Then , hence applying Proposition 3.9 to yields an integer such that
By construction, the left-hand side is equal to and the right-hand side is bounded by . Since is equal to , we obtain
Hence, . This finishes the proof.
We can now prove our main result Theorem 1.1.
Theorem 3.13. Assume that is --minimal and let be Cartesian products of balls in . If and are definably isometric, then and are equal up to translation and coordinate permutation.
Proof. If has finite residue field, apply Proposition 3.5. Assume that has infinite residue field and that and are definably isometric. As in the proof of Proposition 3.5, we may assume without loss of generality that and each contain and satisfy and for . Now suppose and are not equal. Then there is a largest index such that and differ. Without loss, assume and let . Then and . But this contradicts Proposition 3.12. □
Since every ball in is the Cartesian product of its coordinate projections, we further obtain the following generalization of Theorem 1.1.
Corollary 3.14. Assume that is --minimal and let and be finitely many balls. If and are definably isometric, then and are equal up to translation and coordinate permutation.
Proof. The sets and are cuboids in . □
Lastly, with a similar method as the one used in the proof of Proposition 3.12, we obtain Proposition 1.2.
Proposition 3.15. Assume that is --minimal and that has infinite residue field. Then is the minimal dimension of a definable set such that covers .
Proof. The existence of follows from Remark 3.1. Now let be an arbitrary definable set such that covers . If , then clearly . If , then there is a sequence in as described in Lemma 3.11. Applying Proposition 3.9 to yields an integer such that
Since the left-hand side is equal to and the right-hand side is bounded by , we obtain
Hence, . This finishes the proof. □
References
References
- [1]Raf Cluckers, Immanuel Halupczok, and Silvain Rideau-Kikuchi. Hensel minimality I. Forum of Mathematics, Pi, 10:e11, 2022.
- [2]Raf Cluckers, Immanuel Halupczok, Silvain Rideau-Kikuchi, and Floris Vermeulen. Hensel minimality II: Mixed characteristic and a diophantine application. Forum of Mathematics, Sigma, 11:e89, 2023.arxiv.org/abs/2104.09475