$p$-adic boundary laws and Markov chains on trees
A. Le Ny, L. Liao, U. A. Rozikov

TL;DR
This paper investigates $p$-adic boundary laws and Markov chains on infinite trees, establishing conditions for uniqueness, existence of multiple chains, and boundedness properties using adapted boundary law methods in the $p$-adic setting.
Contribution
It introduces a systematic adaptation of boundary law techniques to the $p$-adic context, revealing new phenomena in Markov chains on trees.
Findings
Uniqueness of $p$-adic Markov chains under certain conditions.
Existence of multiple $p$-adic Markov chains for specific stochastic matrices.
Boundedness of chains depending on the $p$-adic norm relations.
Abstract
In this paper we consider -state potential on general infinite trees with a nearest-neighbor -adic interactions given by a stochastic matrix. {We show the uniqueness of the associated Markov chain ({\em splitting Gibbs measures}) under some sufficient conditions on the stochastic matrix.} Moreover, we find a family of stochastic matrices for which there are at least two -adic Markov chains on an infinite tree (in particular, on a Cayley tree). When the -adic norm of is greater ({{\em resp.}} less) than the norm of any element of the stochastic matrix then it is proved that the -adic Markov chain is bounded ({{\em resp.}} is not bounded). Our method {uses} a classical boundary law argument carefully adapted from the real case to the -adic case, by a systematic use of some nice peculiarities of the ultrametric (-adic) norms.
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 mathematical theories · Topological and Geometric Data Analysis
-adic boundary laws and Markov chains on trees
A. Le Ny, L. Liao, U. A. Rozikov
A. Le Ny
Université Paris-Est, Laboratoire d’Analyse et de Mathématiques Appliquées, LAMA UMR CNRS 8050, UPEC, 91 Avenue du Général de Gaulle, 94010 Créteil cedex, France.
L. Liao
Université Paris-Est, Laboratoire d’Analyse et de Mathématiques Appliquées, LAMA UMR CNRS 8050, UPEC, 91 Avenue du Général de Gaulle, 94010 Créteil cedex, France.
U. A. Rozikov
Institute of mathematics, 81, Mirzo Ulug’bek str., 100170, Tashkent, Uzbekistan.
Abstract.
In this paper we consider -state potential on general infinite trees with a nearest-neighbor -adic interactions given by a stochastic matrix. We show the uniqueness of the associated Markov chain (splitting Gibbs measures) under some sufficient conditions on the stochastic matrix. Moreover, we find a family of stochastic matrices for which there are at least two -adic Markov chains on an infinite tree (in particular, on a Cayley tree). When the -adic norm of is greater (resp. less) than the norm of any element of the stochastic matrix then it is proved that the -adic Markov chain is bounded (resp. is not bounded). Our method uses a classical boundary law argument carefully adapted from the real case to the -adic case, by a systematic use of some nice peculiarities of the ultrametric (-adic) norms.
Mathematics Subject Classifications (2010). 46S10, 82B26, 12J12 (primary); 60K35 (secondary)
Key words. Cayley trees, boundary laws, Gibbs measures, translation invariant measures, -adic numbers, -adic probability measures, -adic Markov chain, non-Archimedean probability.
1. Introduction
In this paper we develop a boundary law argument to study -adic Markov chains on general trees. In the real case Markov chains on trees are particular cases of Gibbs measures corresponding to a Hamiltonian with nearest-neighbor interactions. In the theory of Gibbs measures on trees (see [8, Chapter 12] and [23]) the main problem is to describe the set of limiting Gibbs measures corresponding to a given Hamiltonian. A complete analysis of this set is often a difficult problem, this is even not completely described for the Ising model (see [3, 4, 5, 25] for some recent results).
Parallel to the real valued Gibbs measures, the -adic Gibbs measures are studied using the -adic mathematical physics in [2, 12, 13, 24, 29]. A -adic distribution is an analogue of ordinary distributions that takes values in a ring of -adic numbers [11], [12]. Analogically to a measure on a measurable space, a -adic measure is a special case of a -adic distribution. A -adic distribution taking values in a normed space is called a -adic measure if the values on compact open subsets are bounded.
It is known that some -adic models in physics cannot be described using ordinary Kolmogorov’s probability theory [13, 15, 17, 29]. In [14] the -adic probability theory was developed using the theory of non-Archimedean measures [21]. In [6, 10, 18, 19, 20, 26] various models of statistical physics in the context of -adic fields are studied.
In probability theory Kolmogorov’s extension theorem (see, e.g., [28, Chapter II, § 3, Theorem 4, page 167]), says that a compatibility condition of a sequence of probability measures ensures that there exists a unique (limit) measure. This theorem is used to introduce (real-valued) Markov chains on trees (see [8, Chapter 12]) by notion of a boundary law. A -adic analogue of Kolmogorov’s theorem was proved in [7]. Such a -adic Kolmogorov theorem allows us to construct wide classes of stochastic processes and to develop statistical mechanics in the context of -adic theory [16]-[20].
In the present paper we introduce -adic Markov chains on general infinite trees. Such chains are constructed by -adic boundary laws (for the real case see [8, Chapter 12]). We also discuss the uniqueness and boundedness of the -adic Markov chain. The boundedness of the -adic measure is needed to integrate -adic valued functions [11, 12, 27], and also to consider conditional expectations [11, 16]. Note that -adic measures are also useful in -adic -functions following the works of B. Mazur (see [9, 15] for details).
The paper is organized as follows. Section 2 presents definitions and known results. Section 3 is devoted to an introduction of -adic Markov chains through boundary laws. Section 4 (resp. Section 5) is devoted to finding a sufficient condition of the uniqueness (resp. non-uniqueness) of -adic Markov chain. In Section 6 we give some conditions ensuring that the -adic Markov chain is (resp. not) bounded.
2. Preliminaries
2.1. -adic numbers and measures.
Let be the field of rational numbers. For a fixed prime number , every rational number can be represented in the form , where , is a positive integer, and and are relatively prime with : , . The -adic norm of is given by
[TABLE]
This norm is non-Archimedean and satisfies the so-called strong triangle inequality
[TABLE]
We will often use the following fact:
[TABLE]
The completion of with respect to the -adic norm defines the -adic field . Any -adic number can be uniquely represented in the canonical form
[TABLE]
where and the integers satisfy: , (see [15, 27, 29]). In this case .
Our analysis will strongly relies on nice properties of the -adic norm, and on the two following classical results in -adic algebra.
Theorem 1** ([15, 29]).**
The equation , , has a solution if and only if the following conditions are fulfilled:
i) is even;
ii) is a quadratic residue modulo if ; if .
The elements of the set are called -adic integers.
The following statement is known as Hensel’s lemma [1, Theorem 3.15].
Theorem 2**.**
Let be a polynomial whose coefficients are -adic integers. Let be the derivative of . Assume there exist and such that
[TABLE]
Then there exists such that and .
Given and put
[TABLE]
The -adic logarithm is defined by the series
[TABLE]
which converges for ; the -adic exponential is defined by
[TABLE]
which converges for .
Lemma 1** ([15]).**
Let , then
[TABLE]
[TABLE]
Let be a measurable space, where is an algebra of subsets of . A function is said to be a -adic measure if for any such that , , the following holds:
[TABLE]
A -adic measure is called a -adic probability measure if , see, e.g. [11, 21]. Let us warn that due to the different axiomatic and ring of values, some intuitive properties of sets of probability measures (like e.g. some convex properties) are not valid anymore [24].
2.2. Tree.
A tree is a connected graph without cycles (see [22] for more details). Let be a tree, where is the set of vertices and is the set of edges. Two vertices and are called nearest neighbors if there exists an edge connecting them. We will use the notation for the edge connecting the vertices and . A collection of nearest neighbor pairs is called a path from to . The distance on the tree is the number of edges of the shortest path from to .
For , we denote
[TABLE]
[TABLE]
Let . Denote
[TABLE]
3. -adic Markov chain and boundary laws
We consider a system with nearest neighbor interactions on a tree where the spins assigned to the vertices of the tree take values in the set .
A configuration on is then defined as a function . The set of all configurations is .
By -adic probability vector we mean a vector with -adic valued coordinates summing to 1. A -adic stochastic matrix is a matrix with each row being a -adic probability vector.
For each edge we consider a stochastic matrix . For each consider a probability vector .
For any edge we assume that
[TABLE]
Definition 1**.**
A -adic probability distribution (measure) is called a -adic Markov chain with transition matrices and marginal distribution at if for all finite, connected set , and all and the following holds
[TABLE]
Note that the reversibility condition (3.1) is equivalent to the statement that the expression on the right of (3.2) is independent of the choice of .
Consider for each edge a matrix . We always assume
[TABLE]
Let be a vector in .
Definition 2**.**
For satisfying (3.5), a -adic boundary law111Compare with real boundary law of [8, Definition (12.10)]. is such that for any , and for all , it holds
[TABLE]
where is an arbitrary constant (not depending on ).
Using (3.5) and proceeding as in the classical case of [8, Formula (12.13), page 243], one directly gets that each boundary law
[TABLE]
defines a -adic Markov chain : for any finite connected set (and ), one has
[TABLE]
where is the normalizing factor, x_{\mbox{;!!}\varLambda} denotes the unique neighbor of belonging to , and , for . We stress that the first condition in (3.5), which is [8, Formula (12.9)], is needed to check that is a well defined -adic Markov chain.
4. Criterion for uniqueness of the -adic Markov chain
A -adic Markov chain can be considered as a particular case of -adic Gibbs measure defined through the -adic exponential , with [18]. As it was mentioned above, the set of values of a -adic norm is , so the condition is equivalent to the condition . Consequently, we shall restrict part of the analysis to quantities belonging to the set:
[TABLE]
The following lemma will also be useful (see [18, Lemma 4.6]).
Lemma 2**.**
If for all are such that
[TABLE]
then
[TABLE]
Without loss of generality, we set hereafter (a normalization at ). Then the condition (3.6) for the stochastic matrix reads
[TABLE]
Here we have used
[TABLE]
In this section we examine the conditions on the parameters and on for the existence and the uniqueness of the solutions of the equation (4.1).
For the uniqueness, we ssume that the matrix satisfies the following conditions
[TABLE]
Theorem 3**.**
Assume each vertex of the tree has degree at least and that the matrix satisfies (3.5) and (4.2). Then the equation (4.1) has a unique solution , .
Proof.
Since
[TABLE]
it follows that is a solution to (4.1).
We show its uniqueness. For , we introduce the norm
[TABLE]
Let , be a solution. Denote
[TABLE]
Using (2.1), (4.2) and Lemma 2, we calculate :
[TABLE]
Let us now estimate using (4.2):
[TABLE]
where we have used the hypothesis
[TABLE]
and is defined by
[TABLE]
Thus satisfies the conditions of Lemma 2, and we have
[TABLE]
Consequently,
[TABLE]
Since this estimation is true for arbitrary edge , one can start from any edge and then iterate the estimation (4.5), to obtain the following
[TABLE]
which as gives ∎
Denote by the -adic Markov chain which corresponds to
Corollary 1**.**
Under the conditions of Theorem 3, there exists a unique -adic Markov chain, which satisfies that for any finite connected set (and ),
[TABLE]
where
[TABLE]
5. Criterion for non-uniqueness of the -adic Markov chains
5.1. On a regular tree.
Consider the Cayley tree of order . Suppose the matrix in the system of equations (4.1) satisfies the condition
[TABLE]
We assume further that and are independent on , that is
[TABLE]
Theorem 4**.**
If (5.1), (5.2) are satisfied, are -adic integers, and there exists such that
[TABLE]
then the equation (4.1) has at least two solutions.
Proof.
We shall prove that the equation (4.1) has two constant (translational-invariant) solution , . The first solution is already known: . We shall show that the system (4.1) has a solution of the following form
[TABLE]
Then from (4.1), for the Cayley tree of order , we get
[TABLE]
Independently on parameters, this equation has solution . We are going to find conditions on and on to have at least one solution .
The equation (5.7) can be written as with
[TABLE]
We are interested in the solution of , where
[TABLE]
Since are -adic integers, has only -adic integer coefficients. Now we shall check the other conditions of Hensel’s lemma (see Theorem 2). Take . Then we have and
[TABLE]
Therefore by (5.6), the conditions of Hensel’s lemma are satisfied for . Hence there exists a -adic integer such that and , i.e. has a solution . Since , we have . Thus . This proves the theorem. ∎
Remark 1**.**
Note that if divides then does not divide , therefore , i.e. the condition (4.2) is not satisfied.
Let us give some examples of parameters satisfying the conditions of Theorem 4:
Example 1**.**
The case :
- a)
Let . Then the equation has a unique solution . The condition (5.6) of Theorem 4 is equivalent to
[TABLE]
This implies , and , . Thus, the solution , other than the solution , is also in .
- b)
Take , , , . Then and . For these parameters the equation (5.7) has three solutions:
[TABLE]
Note (see Theorem 1) that exists in . Moreover, it can be calculated222http://www.numbertheory.org/php/p-adic.html*:*
[TABLE]
Then we get
[TABLE]
[TABLE]
Hence , and plays the role of mentioned in the proof of Theorem 4. On the other hand, we have . Consequently . Since , we obtain . Thus .
Example 2**.**
The case : Take , , , . Then
[TABLE]
In this case the equation (5.7) has three solutions:
[TABLE]
We have Thus . Similarly, one can see that .
As a corollary of Theorem 4, we have the following.
Theorem 5**.**
If the conditions of Theorem 4 are satisfied then for the matrix on the Cayley tree of order , there are at least two -adic Markov chains.
Remark 2**.**
Theorem 4 can be generalized as follows: fix and assume
[TABLE]
Suppose and are independent on , i.e.,
[TABLE]
Under the above mentioned conditions one can show that the system (4.1) has a solution of the following form
[TABLE]
Then from (4.1), for the Cayley tree of order , we get
[TABLE]
This equation is identical with (5.7) and it has non-unique solutions when and (replacing and ) satisy the conditions mentioned in Theorem 4.
5.2. Extension on a non-regular tree.
Consider now a general tree , with each vertex having at least two nearest neighbors. Recall that is the set of all edges of . Such a tree contains a Cayley tree (of some order ) as a subtree, which we denote by . Let be the set of all edges of , i.e., .
Assume on , the conditions of Theorem 4 are satisfied. Then we have a boundary law of the form
[TABLE]
Let Define on the edges of the general tree the following vector-valued function
[TABLE]
where
[TABLE]
and is defined in (5.11).
For , we assume
[TABLE]
and show that defined by (5.12) satisfies the equation (4.1).
For coordinates , , from (4.1) we have
[TABLE]
Therefore, by (5.1), (5.13) and (5.14), one can see that the right-hand side of (5.15) is always 1.
Now we show that also satisfies (4.1). Indeed, we note that , where and .
We thus have the following three possible cases:
Case: . In this case and has elements. Therefore, the equation (4.1) for is reduced to , which is satisfied by the conditions of Theorem 4.
Case: . Then and hence the equation (4.1) for is reduced to the identity .
Case: . In this case contains elements, and we have for all . Thus the equation (4.1) has the form . Using , we get as in the definition (5.12). Thus satisfies the equation (4.1).
Denote by the -adic Markov chain corresponding to given by (5.12).
We have proved the following theorem.
Theorem 6**.**
Let be a tree containing a Cayley tree of order , as a subtree. Suppose the conditions of Theorem 4 are satisfied on . If (5.14) is satisfied, then on the tree there are at least two -adic Markov chains (one is and the other is ).
6. Criterion for the (un-)boundedness of the -adic Markov chains
Now we are interested in finding out whether a -adic Markov chain is bounded.
Let be a boundary law for the matrix and be the corresponding -adic Markov chain.
Theorem 7**.**
The following hold
if for all , then the -adic Markov chain is bounded;
- 2)
if for all , then the -adic Markov chain is not bounded.
Proof.
It suffices to show that for any finite connected set (denote ), and any , one has |\mu^{\boldsymbol{z}}(\sigma_{\mbox{;!!}\bar{\varLambda}}\mbox{;!!}=\varsigma)|_{p}\leq M, for some . Using (3.7), we get
[TABLE]
Let us calculate
[TABLE]
The set can be decomposed as
[TABLE]
where . Since is stochastic for any we get
[TABLE]
- Under the conditions of the part 1), we have (note that )
[TABLE]
Thus
[TABLE]
- Suppose now the conditions of part 2) are satisfied. For a marginal on the two-site volume, i.e., an edge , corresponding to a boundary law , when is fixed we have
[TABLE]
Therefore,
[TABLE]
In order to show that the measure is not bounded, it is enough to show that its marginal measure is not bounded. Let be an arbitrary infinite path in the tree. The marginal measure has the form
[TABLE]
Here is a configuration on and is a coordinate of the invariant stochastic vector of the matrix .
To ensure that for some . We can choose the value (of the configuration on the vertex ) such that
[TABLE]
Then since is a probability vector we have
[TABLE]
Having , we choose the value of the configuration to satisfy
[TABLE]
By iterating, we define to have
[TABLE]
Then for the above constructed , by (6.3) we get
[TABLE]
Here, at the last step we have used the following (which is true by the condition of the part 2) of theorem)
[TABLE]
Consequently, for such a configuration , from (6.4) and (6.5), we find that
[TABLE]
i.e., is not bounded. ∎
Acknowledgements
UAR thanks the University Paris-Est Créteil (UPEC) for the hospitality during June 2019, where this work has been achieved, and Labex Bézout (Université Paris Est) for the financial and logistic support of this visit. The collaboration of the authors is realized within the project "Real/ -adic dynamical systems and Gibbs measures" funded by LabEx Bézout (ANR-10-LABX-58).
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] V.S. Anashin, A.Y. Khrennikov, Applied algebraic dynamics. de Gruyter expositions in mathematics, vol. 49. (Berlin, New York: Walter de Gruyter; 2009).
- 2[2] V.A Avetisov, A.H. Bikulov, S.V. Kozyrev, “Application of p 𝑝 p -adic Analysis to Models of Breaking of Replica Symmetry”, J. Phys. A: Math. Gen. 32 (50), 8785–8791 (1999).
- 3[3] D. Gandolfo, F.H. Haydarov, U.A. Rozikov, J. Ruiz, “New phase transitions of the Ising model on Cayley trees,” Jour. Stat. Phys. 153 (3), 400–411 (2013).
- 4[4] D. Gandolfo, C. Maes, J. Ruiz, S. Shlosman, “Glassy states: the free Ising model on a tree,” Archive HAL https://hal.archives-ouvertes.fr/hal-01648385/document. 2019, to appear.
- 5[5] D. Gandolfo, M.M. Rakhmatullaev, U.A. Rozikov, J. Ruiz, “On free energies of the Ising model on the Cayley tree,” Jour. Stat. Phys. 150 (6), 1201–1217 (2013).
- 6[6] D. Gandolfo, U.A. Rozikov, J. Ruiz, “On p 𝑝 p -adic Gibbs measures for hard core model on a Cayley tree,” Markov Processes Related Fields. 18 (4), 701–720 (2012).
- 7[7] N.N. Ganikhodjaev, F.M. Mukhamedov, U.A. Rozikov, “Phase Transitions in the Ising Model on Z 𝑍 Z over the p 𝑝 p -adic Number Field,” Uzb. Mat. Zh., 4 , 23–29 (1998).
- 8[8] H.-O. Georgii, Gibbs Measures and Phase Transitions , 2nd ed. De Gruyter Studies in Mathematics, 9 . (Walter De Gruyter, Berlin, 2011).
