1.3. Normed vector space over a non-archimedean field [025A]
Original official author HTML, exact retained edition. Historical TeX conversion verdicts remain unchanged. Cited-edition alignment and mathematical self-containment are not assessed.
Complete original source context · Original author HTML
1.3. Normed vector space over a non-archimedean field
In this subsection, we recall several facts on (ultrametric) norms over a non-archimedean field. Throughout this paper, a norm is always assumed to be ultrametric. Let be a finite-dimensional vector space over and a norm of over .
1.3.1. Orthogonality of norms
For , a basis of is called an -orthogonal basis of with respect to if
If (resp. and ), then the above basis is called an orthogonal basis of (resp. an orthonormal basis of ). Let be another basis of . We say that is compatible with if for .
Proposition 1.3.
Fix a basis of . For any , there exists an -orthogonal basis of with respect to such that is compatible with . Moreover, if the absolute value is discrete, then there exists an orthogonal basis of compatible with .
Proof.
We prove it by induction on . If , then the assertion is obvious. By the hypothesis of induction, there is a -orthogonal basis of with respect to such that
for . Choose . As
there is such that . We set . Clearly forms a basis of . It is sufficient to see that
for all . Indeed, as , we have
If , then
Otherwise,
as required.
For the second assertion, it is sufficient to show the following lemma because it implies that the set has the minimal value. ∎
Lemma 1.4.
If is discrete, then the set is discrete in .
Proof.
Let us consider a map given by
It is sufficient to see that is finite. Let be distinct elements of . We choose with for . If , then for all . Therefore, we obtain
for all . In particular, are linearly independent. Therefore, we have . ∎
1.3.2. Scalar extension of norms
Let be a vector space over and a norm of .
Lemma 1.5.
For , the set is bounded from above.
Proof.
By the above lemma, we define to be
Note that yields a norm on . We denote by (i.e. the case where and ).
Lemma 1.6.
Let be a subspace of and . For any , there is such that and
Proof.
Let be an -orthogonal basis of such that (cf. Proposition 1.3). We define to be
for . Then . Moreover, note that
so that
for all with . Thus the assertion follows. ∎
Corollary 1.7.
The natural homomorphism is an isometry.
Proof.
We denote the norm of by , that is,
Note that for all and . In particular, . For , we set and choose with . Then . For any , by Lemma 1.6, there is such that and . As , we have . Thus we obtain by taking . ∎
Definition 1.8.
Let be an extension field of , and let be a complete absolute value of which is an extension of . We set . Identifying with
we can give a norm of , that is,
The norm is called the scalar extension of . Note that for . Indeed, by Corollary 1.7,
Proposition 1.9.
For , let be an -orthogonal basis of with respect to . Then also yields an -orthogonal basis of with respect to .
Proof.
Let be the dual basis of . For with ,
and hence . Therefore, for ,
Thus we have the assertion. ∎
Lemma 1.10.
Let be an extension field of , and let be a complete absolute value of as an extension of . We set . Note that . Let (resp. ) be a norm of obtained by the scalar extension of on (resp. the scalar extension of on ). Then .
Proof.
For , let be an -orthogonal basis of with respect to . Then, by Proposition 1.9, forms an -orthogonal basis of and with respect to and , respectively, so that is also an -orthogonal basis of with respect to . Note that for all . Thus, for ,
and
Thus, we have the assertion by taking . ∎
Lemma 1.11.
Let be a surjective homomorphism of finite-dimensional vector spaces over . Let and be norms of and , respectively. We assume that and is the quotient norm of in terms of the surjection . We set and . Let and be the norms of and obtained by the scalar extensions of and , respectively. Then is the quotient norm of in terms of the surjection .
Proof.
Let be the quotient norm of with respect to the surjection . Let be an non-zero element of . As , it is sufficient to show that . Note that
so that we have . Let us consider an inequality . For , let be an -orthogonal basis of such that forms a basis of . Clearly we may assume that . Then
Therefore, we have by taking . ∎
Lemma 1.12.
We assume that the absolute value of is trivial. Let be a finite-dimensional normed vector space over . Then we have the following:
- (1)
The set is a finite set.
- (2)
Let be a field and a complete and non-trivial absolute value of such that and is an extension of . Let be the valuation ring of and the maximal ideal of . We assume the following:
- (i)
The natural map induces an isomorphism .
- (ii)
If an equation holds for some and , then .
Let be a norm of over such that for all . If is an orthogonal basis of , then forms an orthogonal basis of . In particular, .
- (i)
Proof.
(2) First we assume that
Then, for any ,
Let us see that
for . Clearly we may assume that
We set . We fix with . By the assumption (i), for each , we can find and such that
Note that
Moreover, as , we have
| and | ||||
Therefore,
In general, we take positive numbers and non-empty subsets of such that for and . Note that for . Let us consider
where . Note that forms an orthogonal basis of and for all . Therefore, by the above observation,
so that it is sufficient to see that
Clearly we may assume that . We set
For with , we have . Indeed, we choose and with and . If , then
so that, by the assumption (ii), , which is a contradiction. Therefore,
as required. ∎
Remark 1.13.
We assume that is discrete and
for . If
then the assumption (ii) holds. Indeed, we suppose that for some and . Then
so that , and hence , as required.
1.3.3. Lattices and norms
From now on and until the end of the subsection , we assume that is non-trivial. Let be an -submodule of . We say that is a lattice of if and
for some norm of . Note that the condition does not depend on the choice of the norm since all norms on are equivalent. For a lattice of , we define to be
Note that forms a norm of . Moreover, for a norm of ,
is a lattice of .
Proposition 1.14.
Let be a lattice of . We assume that, as an -module, admits a free basis . Then is an orthonormal basis of with respect to .
Proof.
For and ,
so that . ∎
Let us consider the following lemmas.
Lemma 1.15.
A subgroup of is either discrete or dense in .
Proof.
Clearly we may assume that , so that . We set . If , then . Indeed, for , let be an integer such that . Thus , and hence . Therefore, is discrete.
Next we assume that . Then there is a sequence in such that for all and . If we set , then and . For an open interval of (), we choose and an integer such that and . Then we have and
so that . Thus is dense. ∎
Lemma 1.16.
Let be a norm of and . Then
Moreover, and for all with .
Proof.
The first assertion is obvious because, for , if and only if .
For , let with . Then , that is, , and hence .
Finally we consider the second inequality, that is, for . Clearly we may assume that . As , there is with . By the first assertion, we can choose such that . If , then
Thus . This is a contradiction, so that . Therefore,
as required. ∎
Proposition 1.17.
We assume that is discrete. Then we have the following:
- (1)
Every lattice of is a finitely generated -module.
- (2)
If we set for a norm of of , then .
Proof.
(1) Let be an orthogonal basis of with respect to (cf. Proposition 1.3). As is discrete, there is with . If we set for , then forms an orthonormal basis of with respect to . Therefore,
Thus we have (1) because is noetherian.
(2) follows from Lemma 1.16. ∎
Proposition 1.18.
We assume that is not discrete. If we set for a norm of of , then .
Proof.
Proposition 1.19.
We assume that the absolute value is not discrete. Let be a norm of and . For any , there is a sub-lattice of such that is finitely generated over and .