# Gérard–Levelt membranes

- First Online:

- Received:
- Accepted:

DOI: 10.1007/s10801-012-0387-8

- Cite this article as:
- Corel, E. J Algebr Comb (2013) 37: 757. doi:10.1007/s10801-012-0387-8

- 1 Citations
- 263 Views

## Abstract

We present an unexpected application of tropical convexity to the determination of invariants for linear systems of differential equations. We show that the classical Gérard–Levelt lattice saturation procedure can be geometrically understood in terms of a projection on the tropical linear space attached to a subset of the local affine Bruhat–Tits building, which we call the *Gérard–Levelt membrane*. This provides a way to compute the true Poincaré rank, but also the Katz rank of a meromorphic connection without having to perform either gauge transforms or ramifications of the variable. We finally present an efficient algorithm to compute this tropical projection map, generalising Ardila’s method for Bergman fans to the case of the tight-span of a valuated matroid.

### Keywords

Meromorphic connectionsTropical convexityValuated matroids## 1 Introduction

*A*is a

*regular*or an

*irregular*singular point for the system (1). Unlike the case with scalar linear differential equations, for which there is a purely algebraic condition on the orders of the poles of the coefficients due to L. Fuchs [10], a system (1) can display arbitrarily high pole orders at a regular singularity.

*z*=0) under the following form, where we put \(\theta=z\frac{d}{dz}\):

*p*is known as the

*Poincaré rank*\(\mathfrak{p}(A)\) of the system. Finding the type of singularity involves knowing the minimum value

*m*(

*A*) of this rank, sometimes known as the

*true Poincaré rank*, under gauge transformations

*z*=0 is a

*regular*singularity of (1) if and only if

*m*(

*A*)=0.

Several lines of research have been opened to tackle this problem. The most classical tries to iteratively construct a suitable gauge transformation *P*, usually coefficient by coefficient in its series expansion. Featured methods rely on the linear algebra over ℂ involved by (4), like Moser and continuators [4, 15, 21], whose methods are widely used nowadays in computer algebra, or other researchers such as [3, 13], while [2] uses Lie group theoretic tools.

The nature of a singularity of *A* can also be considered from the point of view of meromorphic connections [7], and especially, as a question of stability of certain *lattices* under the differential operator induced by the connection [14, 20]. We focus here specifically on the approach of *saturating lattices* used by Gérard and Levelt [12]: the true Poincaré rank is the minimum integer *k* such that the sequence of *k*-saturated lattices (recalled in Sect. 2.1) eventually stabilises.

Recent work has shown close relations between the geometric framework of the Bruhat–Tits building of SL(*K*), for some discrete-valued field such as *K*=ℂ((*z*)), and tropical convexity [16, 17, 25]. In particular, any finite union of apartments in the Bruhat–Tits building (a so-called *membrane*) can be faithfully represented as the set of integer-valued points of the tropical linear space defined by a *tropical Plücker vector* (or *valuated matroid*). If a membrane \(\mathcal{M}\) is generated by vectors *v*_{1},…,*v*_{m}, a lattice *Λ* in \(\mathcal{M}\) admits as non-unique representative vector any *u*∈ℤ^{m} such that \(\varLambda=\sum_{i=1}^{m}\mathcal{O}z^{-u_{i}}v_{i}\), where \(\mathcal{O}\) is the valuation ring of *K*. Results of Keel and Tevelev [17] show that, when lattices are in a same membrane, they are *homothetic* if and only if their representative points are projected on the same point of the attached tropical linear space by an explicit nearest point projection map ([16], see also [5, 11]).

*n*-dimensional vector space

*V*over

*K*. We construct first the

*Gérard–Levelt membrane*\(\mathcal{M}_{\varLambda}\) that contains all the relevant

*k*-saturated lattices of a given lattice

*Λ*(Proposition 8). Our main result is the following tropical version of Gérard–Levelt’s lattice stabilisation criterion. Let

*Λ*be a lattice, let \(u^{\ell}_{k}\) represent the

*ℓ*th order

*k*-saturated lattice of

*Λ*, let

*π*

_{Λ}be the projection map onto the attached tropical linear space

*L*

_{Λ}, and

### Theorem 1

*The true Poincaré rank*

*m*

*and the Katz rank*

*κ*

*of a connection*∇

*acting on*

*V*

*satisfy*

It is remarkable that same formula holds for the computation of the true Poincaré rank of the connection, and for a more subtle invariant like the Katz rank, which can moreover be computed without having to either compute a single gauge transformation or perform the usually required ramification of the variable.

### Example 2

(Pflügel–Barkatou)

Finally, we give in Sect. 5 an efficient algorithm to compute this projection map. Indeed, the explicit algorithms given in [16] are too complex in practice. We generalise the algorithmic approach to tropical projection developed by Ardila [1], and further by Rincón [23], for ordinary matroids, to the case of *valuated matroids*, defined by Dress and collaborators [9]. Namely, if *p* is a valuated matroid of rank *n* on [*m*], and *L*_{p} is the tropical linear space [24] attached to it, then we have the following result.

### Theorem 2

*Let*

*x*∈ℝ

^{m}

*and let*

*B*

*be an*

*x*-

*minimal base of*

*p*.

*Then*\(\omega=\pi_{L_{p}}(x)\)

*can be computed in the following way*:

The algorithm based on this result,^{1} which computes the nearest *ℓ*_{∞}-projection on the tight-span of a valuated matroid, has a wider applicability than the differential computations explained in the previous parts, especially in phylogenetics [8].

## 2 Meromorphic connections

*meromorphic connection*is a map \(\nabla:V\simeq K^{n} \rightarrow\varOmega(V)=V\otimes_{K}\varOmega^{1}_{\mathbb{C}}(K)\) which is ℂ-linear and satisfies the Leibniz rule

*matrix*Mat(∇,(

*e*)) is given by \(\nabla e_{j}=-\sum^{n}_{i=1} e_{i}\otimes\varOmega_{ij}\) for a basis (

*e*). A basis change

*P*∈GL

_{n}(

*K*)

*gauge-transforms*the matrix of ∇ by

_{k}, and system (1) is the expression of ∇

_{−1}(

*v*)=0 in the basis (

*e*).

*lattice*

*Λ*in

*V*is a free sub-\(\mathcal{O}\)-module of rank

*n*, that is, a module of the form

*Λ*induces a valuation on

*V*, defined by

*be the set of all lattices in*

**Λ***V*. The

*Poincaré rank of*∇

*on the lattice*

*Λ*is defined as the integer and the

*true Poincaré rank*as \(m(\nabla)=\min_{\varLambda \in \boldsymbol{\varLambda}} \mathfrak{p}_{\varLambda }(\nabla)\).

### 2.1 Gérard–Levelt’s saturated lattices

*e*∈

*V*and any derivation

*τ*∈Der(

*K*/ℂ), define for

*ℓ*∈ℕ the family

*v*(

*τ*) of the derivation

*τ*. We can therefore restrict to the particular derivations \(\tau_{k}=z^{k+1}\frac{d}{dz}\) for

*k*∈ℕ. In this case, we put \(\nabla_{\tau_{k}}=\nabla_{k}\), and denote by \(Z^{\ell}_{k}(e)\) and \(\mathcal{O}^{\ell}_{k}(e)\) the corresponding objects. For

*k*≥1, Gérard and Levelt define the lattices (see also [19])

### Theorem 3

(Gérard, Levelt)

*The true Poincaré rank*

*m*(∇)

*of*∇

*is*

*k*≥

*m*(∇) if and only if, for some (equivalently, any) lattice

*Λ*in

*V*, the Poincaré rank on \(F^{n-1}_{k}(\varLambda)\) is at most

*k*. Stated otherwise, finding the true Poincaré rank is finding the largest lattice whose Poincaré rank is bounded by its index in the following sequence:

*ℓ*≥0, and let

*α*=(

*α*

_{1},…,

*α*

_{ℓ})∈ℤ

^{ℓ}be an integer multi-index of

*length*|

*α*|=

*ℓ*and

*weight*

*w*(

*α*)=

*α*

_{1}+⋯+

*α*

_{ℓ}. Let us define also the partial multi-indices

*α*

_{|j}=(

*α*

_{1},…,

*α*

_{j}) and

*α*

_{|0}=

*ϵ*and ∇

^{ϵ}=id

_{V}for the empty sequence

*ϵ*. Let finally \(\mathcal{O}^{\alpha}(e)\) be the \(\mathcal{O}\)-module spanned by the sequence

### Lemma 3

*For any*

*α*=(

*α*

_{1},…,

*α*

_{ℓ})∈ℤ

^{ℓ},

*one has*

### Proof

*α*. Let

*D*=∇

_{0}. The claim obviously holds for a multi-index of length 0, with

*P*

_{ϵ}=1, so assume that there exists

*P*

_{α}∈ℤ[

*X*] such that ∇

^{α}=

*z*

^{w(α)}

*P*

_{α}(

*D*) for

*α*≤

*ℓ*. Let

*β*∈ℤ

^{ℓ+1}. Then by definition, we have Indeed, \(P_{\beta_{\vert\ell}}(D)\) commutes with

*D*since it has by assumption constant coefficients. The result follows, since we have then \(P_{\beta}(X)=P_{\beta_{\vert\ell}}(X)(X+w(\beta_{\vert\ell}))\). □

### Lemma 4

*Let*

*Λ*

*be a lattice in*

*V*.

*For any*

*ℓ*∈ℕ

*and*

*α*∈ℕ

^{ℓ},

*the*\(\mathcal{O}\)-

*module*\(\mathcal{O}^{\alpha}(e)\)

*is spanned over*\(\mathcal{O}\)

*by the family*

### Proof

*A*is an upper triangular integer matrix with diagonal entries equal to 1, therefore \(A\in\mathrm{SL}_{\ell}(\mathbb{Z})\subset\mathrm {GL}_{\ell }(\mathcal{O})\). The families \(z^{W_{\alpha}}Z_{0}^{\ell-1}(e)\) and \(Z^{{\alpha}_{\vert\ell-1}}(e)\) are related by the matrix

*A*is upper triangular, and the partial sums

*α*

_{i}+⋯+

*α*

_{j}are non-negative, the matrix \(\tilde{P}\) is in \(\mathrm {GL}_{n}(\mathcal{O})\), and therefore both families span the same \(\mathcal{O}\)-module. □

## 3 Tropical convexity and lattices

*M*={

*d*

_{1},…,

*d*

_{m}} be lines in

*V*such that

*d*

_{1}+⋯+

*d*

_{m}=

*V*, and consider the subset of

*defined by*

**Λ***M*] modulo homothety a membrane, we call this the

*affine membrane spanned by*

*M*.

*d*

_{i}, any lattice in the membrane defined by

*M*={

*d*

_{1},…,

*d*

_{m}} can be represented (non uniquely) by an integer-valued point as follows: a lattice point

*u*∈ℤ

^{m}corresponds to the lattice

Membranes spanned by *m* lines in the Bruhat–Tits building have a faithful representation as tropical linear spaces in *m*-dimensional space.

_{∞}=ℝ∪{∞},⊕,⊙) be the tropical semialgebra, with the operations

*M*and a basis (

*e*) of

*V*determine a

*valuated matroid*

*M*indexed by

*ω*. To a valuated matroid

*p*of rank

*n*over [

*m*] there is a tropical linear space \(L_{p}\subset\mathbb{R}_{\infty}^{m}\) attached as follows:

*L*

_{p}is said to be a

*tropical convex cone*in \(\mathbb{R}_{\infty}^{m}\) [5] or a

*tropical polytope*[16] in \(\mathbb{R}_{\infty}^{m}/\mathbb{R} (1,\ldots,1)\). Both definitions mean that

### Example 5

*p*defined in (10) readily shows that

*L*

_{p}consists of four half-planes in \(\mathbb{R}_{\infty}^{4}\) defined by with

*P*=(0,−

*N*,−

*N*,−

*N*). These four half-planes intersect along the line

*P*+ℝ(1,1,1,1).

*nearest point projection map*\(\pi_{L_{p}}: \mathbb{R}_{\infty}^{m} \rightarrow L_{p}\) is defined by

**Blue Rule**:- \(\pi_{L_{p}}(x)=(w_{1},\ldots,w_{m})\) with$$w_i=\min_{\sigma\in{{[m]}\choose{n-1}}}\max_{j\neq \sigma} \bigl(p\bigl(\sigma\cup \{i\}\bigr)-p\bigl( \sigma\cup\{j\}\bigr)+x_j \bigr). $$
**Red Rule**:Starting with

*v*=(0,…,0)∈ℝ^{m}, for every \(\tau\in{{[m]}\choose{n+1}}\) such that \(\alpha=\min_{1\leq i\leq n+1}p(\tau\backslash\{\tau_{i}\})+x_{\tau_{i}}\) is only attained once, say at*τ*_{i}, compute*γ*=*β*−*α*where*β*is the second smallest number in that collection, and put \(v_{\tau_{i}}:=\max(v_{\tau_{i}},\gamma)\). Then \(\pi_{L_{p}}(x)=x+v\).

### Theorem 4

*The map*\(\pi_{L_{p}}:\mathbb{R}_{\infty}^{m} \rightarrow L_{p}\)

*induces a bijection*

*Ψ*

_{M}

*between*[

*M*]

*and the lattice points in*

*L*

_{p}

If we let \(z^{-u}v=(z^{-u_{1}}v_{1},\ldots,z^{-u_{m}}v_{m})\), then *z*^{−u}*v* and *z*^{−u′}*v* span the same lattice *Λ* if and only if \(\pi_{L_{p}}(u)=\pi_{L_{p}}(u^{\prime})\).

### Proof

*α*∈ℝ such that

*w*

_{i}=

*v*

_{Λ}(

*v*

_{i})+

*α*for all 1≤

*i*≤

*m*. By definition,

*v*

_{Λ}(

*x*)=max{

*k*∈ℤ |

*x*∈

*z*

^{k}

*Λ*}. Accordingly, we have \(z^{-w_{i}}v_{i}\in z^{-\alpha }\varLambda\), and thus

*α*≥0. By (12), we get

*α*=0 and thus

*u*′≥

*u*, then \(z^{-u_{i}}v_{i}=z^{(u'_{i}-u_{i})}z^{-u'_{i}}v_{i}\in\mathcal{O}z^{-u'_{i}}v_{i}\), for 1≤

*i*≤

*m*, hence

*Λ*⊂

*Λ*

_{u′}. Since in particular

*w*≥

*u*holds, we get

*Λ*⊂

*Λ*

_{w}. Conversely, we have \(\varLambda_{w}=\sum_{i=1}^{m} \mathcal{O}z^{-w_{i}}v_{i}\subset\varLambda\). Therefore, if \(\pi_{L_{p}}(u)=\pi_{L_{p}}(u')\) then

*Λ*

_{u}=

*Λ*

_{u′}. The converse follows directly from (13). □

As mentioned in [16], as soon as the projection \(\pi_{L_{p}}(u)\) is computed, one can also determine a basis of the lattice *Λ*_{u}.

### Lemma 6

*Let**M*={*v*_{1},…,*v*_{m}} *be a set of vectors of rank**n**in**V*, *and let**L*_{p}*be the associated tropical linear space*. *Let*\((w_{1},\ldots,w_{m})=\pi_{L_{p}}(u)\). *For any**n*-*subset**τ*⊂{1,…,*m*} *such that*\(p(\tau)-w_{\tau_{1}}-\cdots-w_{\tau_{n}}\)*is minimal*, *the subfamily*\((v_{\tau_{1}},\allowbreak \ldots,v_{\tau_{n}})\)*is an*\(\mathcal{O}\)-*basis of**Λ*_{u}.

### Proof

*e*) in

*V*. Let

*M*be the

*n*×

*m*matrix of coordinates of

*v*

_{1},…,

*v*

_{m}in (

*e*), and let

*M*

_{τ}denote the square submatrix obtained by selecting the columns having their index in

*τ*. The family

*Λ*

_{τ}of

*Λ*

_{w}. If the rank of the subfamily \(v_{\tau }=(v_{\tau_{1}},\ldots ,v_{\tau_{n}})\) is not

*n*, then we have \(v(\det_{(e)}(M_{\tau}z^{-u_{\tau}}))=\infty\). Let us therefore choose two

*n*-subsets

*τ*and

*τ*′ of [

*m*], and assume that both

*v*

_{τ}and

*v*

_{τ′}have full rank. The matrix of the basis change from \(z^{-u_{\tau}}v_{\tau}\) to \(z^{-u_{\tau^{\prime}}}v_{\tau^{\prime}}\) is given by \(P=z^{u_{\tau^{\prime}}}M_{\tau^{\prime}}^{-1}M_{\tau}z^{-u_{\tau }}\). Therefore, we have

*Λ*

_{τ}⊂

*Λ*

_{τ′}if and only if

*v*(

*P*)≥0, that is,

*τ*such that

*Λ*

_{τ}=

*Λ*

_{w}. Since

*Λ*

_{w}is the largest of all the submodules

*Λ*

_{τ}, the result follows. □

As a consequence, one can find a basis of the lattice *Λ*_{u} by computing the minimum of a valuated matroid, which can be performed efficiently by a greedy algorithm (see Algorithms 2 and 3 in Sect. 5).

### Example 7

*H*

_{0}={

*x*−

*y*=

*N*},

*H*

_{1}={

*x*−

*z*=

*N*},

*H*

_{2}={

*x*−

*t*=

*N*},

*H*

_{3}={

*y*−

*z*=0},

*H*

_{4}={

*y*−

*t*=0} and

*H*

_{5}={

*z*−

*t*=0}. Let \(H_{i}^{+}\) (resp. \(H_{i}^{-}\)) be the half-space defined by replacing equality by ≥ (resp. ≤) in the defining equations of hyperplane

*H*

_{i}. Then \(\mathbb{R}_{\infty}^{4}\) is subdivided into the fiber subsets \(R_{i}=\pi_{L_{p}}^{-1}(L_{i})\) defined by To get the explicit projection formulæ, one must subdivide further the regions

*R*

_{i}into three regions each. The following table sums up the properties of the projection map \(\pi_{L_{p}}\), with the convention that, e.g. for row one: if \(u=(x,y,z,t)\in H_{0}^{+}\cap H_{1}^{+}\cap H_{2}^{-}\cap H_{4}^{-} \cap H_{5}^{-}\), then \(\pi_{L_{p}}(u)=(x,x-N,x-N,t)\in\varDelta_{1}\). The underlined coordinates correspond to the

*u*-minimal base (as explained in Lemma 6).

## 4 The Gérard–Levelt membranes

### Proposition 8

*Fix a basis* (*e*) *of**Λ*, *and**ℓ*≥0. *Let* [*M*_{ℓ}] *be the membrane spanned by the vectors*\((\nabla_{0}^{j} e_{i})_{1\leq i \leq n,0\leq j \leq\ell}\). *Then*\(F^{\ell'}_{k}(\varLambda)\in[M_{\ell}]\)*for all**k*≥0 *and**ℓ*′≤*ℓ*.

### Proof

*e*), the lattice \(L=F^{\ell'}_{k}(\varLambda )\) satisfies

*L*can be represented in the membrane [

*M*

_{ℓ′}] by the lattice point

*v*∈

*V*, the module

*L*can also be represented as an element of the membrane [

*M*

_{ℓ}] by

The lattices \(F^{\ell}_{k}(\varLambda)\) for 0≤*ℓ*≤*n* can therefore all be seen as elements of the same membrane [*M*_{n}].

### Definition 9

*is called the*Gérard–Levelt membrane

*attached to*

*Λ*.

*For any basis*(

*e*),

*the lattice*\(F^{\ell}_{k}(\varLambda)\)

*is represented by the lattice point*

_{0},(

*e*))=

*A*for a basis (

*e*) of

*Λ*, then \(\mathcal{M}_{\varLambda}\) is described in (

*e*) by the

*n*×

*n*(

*n*+1)

*saturation matrix*

*π*

_{Λ}onto the tropical linear space

*L*

_{Λ}attached to the Gérard–Levelt membrane \(\mathcal{M}_{\varLambda}\) maps a point

*u*to a

*unique*representative. Checking if

*k*≥

*m*(∇) requires to know if the lattice points \(u^{n-1}_{k}\) and \(u^{n}_{k}\) represent the same lattice, that is,

### Corollary 10

*For any**Λ*, *we have*\(m(\nabla)=\min\{k\in\mathbb{N}\,|\,\pi_{\varLambda }(u^{n}_{k})=\pi_{\varLambda}(u^{n-1}_{k})\}\).

### Example 11

*m*(

*A*)=0. The lattices represented by the points correspond to \(\varLambda_{1}=\mathcal{O}^{2}\) in the case (15) and \(\varLambda_{2}=\mathcal{O} v_{2}\oplus z^{k} v_{3}\) in the case (16).

### 4.1 Tropical computation of the Katz rank

*z*=0 there exists a formal fundamental solution

*Y*of (1) of the form \(Y=\hat{F}(z)z^{J}Ue^{Q}\) where \(\hat{F}(z)\) is a formal (usually divergent) meromorphic matrix,

*U*,

*J*are constant matrices and

*z*

^{1/p}of the variable. However, this is not needed in the tropical setting.

### Theorem 5

*Let*\(\pi_{\varLambda}:\mathcal{M}_{\varLambda} \rightarrow L_{\varLambda}\)

*be the tropical nearest point projection map of the Gérard–Levelt membrane*\(\mathcal{M}_{\varLambda}\)

*of any lattice*

*Λ*

*onto its attached tropical linear space L*.

*Then the Katz rank*

*κ*(∇)

*of the connection*∇

*satisfies*

### Proof

_{H}induced on the pure algebraic extension

*H*=

*K*[

*T*]/(

*T*

^{N}−

*z*) of

*K*with

*N*=lcm(1,2,…,

*n*) (see e.g. [18] or [6]). If we put

*ζ*for the class of

*T*, then \(\mathrm{Mat}((\nabla_{H})_{\zeta\frac{d}{d\zeta}},(e\otimes 1))=N\mathrm{Mat}(\nabla_{z\frac{d}{dz}},(e))\). Thus if

*X*(

*z*) satisfies \(z\frac{d}{dz}X(z)=A(z)X(z)\) the system satisfied by

*Y*(

*ζ*)=

*X*(

*ζ*

^{N}) is

*q*be the valuated matroid defined by \(q(\omega)=w(\det\tilde{M}(\zeta)_{\omega})\), for any

*n*-subset

*ω*of indices of the columns of \(\tilde{M}(\zeta)\) with respect to the

*ζ*-adic valuation

*w*. By construction we have The lattice \(N_{H}=\sum_{i=1}^{m} \mathcal{O}_{H} \zeta^{-u_{i}}v_{i}\otimes1\) has tropical representation in

*L*

_{q}as the projection of the point

*u*∈ℤ

^{m}with respect to the matroid

*q*=

*Np*. By corollary 10, we have \(m(\nabla_{H})=\min\{k\in\mathbb{N}\,|\,\pi_{N_{H}}(u^{n}_{k})=\pi_{N_{H}}(u^{n-1}_{k})\}\). On the other hand, \(\kappa(\nabla)=\frac{1}{N}m(\nabla_{H})\) holds. Therefore, we get

*H*′ of degree divisible by the denominator

*s*of

*κ*(∇). Since the minimum is attained, the formula also holds in the limit, yielding the claimed result. □

### Example 12

**M**has size 4×20, and the lattice \(F^{4}_{k}(\mathcal{O}^{4})\) is therefore represented by the point

**M**is too long to be displayed entirely, so we show here only the principal parts of its entries. Accordingly the lattice \(F^{3}_{k}(\mathcal{O}^{4})\) is represented by

*m*=2 and \(\kappa=\frac{3}{2}\).

## 5 A projection algorithm on a tropical linear space

The Blue and Red rules from [16] recalled in Sect. 3 have unfortunately a high computational complexity, since they involve iterating over cardinality \(m\choose n\) sets. In our case, it is especially impractical since for the Gérard–Levelt membrane, we have *m*∼*n*^{2}. In this section, we present an efficient algorithm, inspired by Ardila’s work on ordinary matroids [1], to compute the projection of a point *x*∈ℝ^{m} onto the tropical linear space *L*_{p} attached to a valuated matroid *p*.

### 5.1 Valuated matroids

*E*be a finite set, and a map

*p*:2

^{E}→ℝ

_{∞}=ℝ∪{∞}. Let \(\mathcal{B}=\{ B\subset E \,|\, p(B)\neq\infty\}\). The pair (

*E*,

*p*) is a

*valuated matroid*if \(\mathcal{B}\neq \emptyset\) and for \(B,B'\in\mathcal{B}\) and

*u*∈

*B*∖

*B*′ there exists

*v*∈

*B*′∖

*B*such that

*base*of

*p*. In particular, \(\mathcal{B}\) is the set of bases of an ordinary matroid

*P*on

*E*that we call the

*matroid underlying*

*p*. A base

*B*is

*minimal*if

*p*(

*B*)≤

*p*(

*B*′) for any base \(B'\in\mathcal{B}\). Any vector of the form

*B*and

*v*∈

*E*∖

*B*is by definition a

*circuit*of

*p*. If

*X*is a circuit of

*p*, its

*support*

*P*. More precisely, it is the fundamental circuit of

*B*and

*v*, that is, the unique circuit of

*P*included in

*B*∪{

*v*}. Similarly, any vector of the form

*B*and

*v*∈

*B*is thus a

*cocircuit*of

*p*.

*p*are in fact encoded in the underlying matroid

*P*. For any circuit

*C*of

*P*, the set of circuits of

*p*that have

*C*as support is of the form

*X*of

*p*,

*X*+

*α*(1,…,1) for

*α*∈ℝ is a circuit of

*p*. The same result applies to cocircuits. Recall the following result.

### Lemma 13

*Any circuit* (*resp*. *cocircuit*) *of**P**containing**v*∈*E**can be represented as the fundamental circuit* (*resp*. *cocircuit*) *of a base**B**such that**v*∉*B* (*resp*. *v*∈*B*).

### Proof

Let *C* be a circuit of *P*. By definition, for any *v*∈*C*, the set *C*∖{*v*} is contained in some base *B*. Therefore *C*⊂*B*∪{*v*} holds. But there is a unique circuit satisfying this condition. Since the cocircuits are the circuits of the dual matroid, the same result holds. □

In what follows, we will speak by abuse of notation of the fundamental circuit or cocircuit of *B* and *v* for a valuated matroid *p*. This is harmless as long as the results that we state are invariant up to the addition of a constant. If we need to specify a representative, we will often use the only one with non-negative coordinates and with minimum coordinate equal to 0, or with some fixed value at some element of *E*.

*x*∈ℝ

^{m}, the map

^{E}by

*p*

_{x}(

*A*)=∞ for \(A\notin\mathcal{B}\) defines also, as is well known, a valuated matroid on

*E*.

### Lemma 14

*If**X**is any circuit of**p*, *then**X*+*x**is a circuit of**p*_{x}, *and if**X*^{∗}*is a cocircuit of**p*, *then**X*^{∗}−*x**is a cocircuit of**p*_{x}.

### Proof

*p*, circuits of

*p*

_{x}have coordinates Hence,

*X*

_{x}(

*B*,

*v*)=

*X*(

*B*,

*v*)+

*x*−

*x*

_{v}(1,…,1). Similarly, we have Hence, \(X^{*}_{x}(B,v)=X(B,v)-x+x_{v}(1,\ldots,1)\). By the projectivity property of circuits and cocircuits, the result is established. Since the sets of bases for

*p*and

*p*

_{x}coincide, these are indeed the only circuits and cocircuits of

*p*

_{x}. □

### 5.2 The projection algorithm

A valuated matroid \(p:{E\choose{n}} \rightarrow\mathbb{R}_{\infty}\) of rank *n* over a finite set *E*=[*m*] induces a tropical linear space *L*_{p} defined by (11). This subspace of \(\mathbb{R}_{\infty}^{m}\) corresponds (up to sign) to what Dress and Terhalle call the *tight span* of a valuated matroid, except for the fact that, while *L*_{p} is invariant by translation by (1,…,1), the tight-span consists of only one point in every orbit (see [24]). In this section, we present an efficient algorithmic method to compute the tropical projection from ℝ^{m} onto *L*_{p} that generalises results obtained by Ardila for ordinary matroids in [1].

### Proposition 15

*Let*

*p*

*be a valuated matroid of rank*

*n*

*on*[

*m*],

*and let*

*u*∈

*E*.

*The following conditions are equivalent*:

- (i)
*u**belongs to at least one minimal base of**p*. - (ii)
*u**is never the unique minimum in a circuit of**p*. - (iii)
*u**is minimal in some cocircuit of**p*.

### Proof

*B*is a minimal base containing

*u*. Let

*C*

^{∗}=

*X*

^{∗}(

*B*,

*u*) be the fundamental cocircuit of

*B*and

*u*. By definition, we have

*u*is minimal in the cocircuit of

*B*and

*u*.

*u*is the unique minimum for

*p*on a circuit

*C*. Assume that

*C*

^{∗}is a cocircuit of

*p*where

*u*is minimal. By assumption, we have

*C*+

*C*

^{∗}has a unique minimum at

*u*. By orthogonality of circuits and cocircuits ([22], Theorem 3.11, p. 204), the set of indices that minimise

*C*+

*C*

^{∗}cannot have cardinality one. Therefore, the contradiction is established.

*B*. If

*u*∉

*B*, let

*C*=

*X*(

*B*,

*u*) be the circuit generated by

*B*and

*u*. By assumption, the minimum in

*C*is attained at

*v*≠

*u*. The support of

*C*is equal to the fundamental circuit of

*B*and

*u*for the ordinary matroid underlying

*p*. Therefore,

*B*∪{

*u*}∖{

*v*} is a base of

*p*and

*v*=

*u*′ we get

*p*(

*B*∪{

*u*}∖{

*v*})≤

*p*(

*B*). Since we assumed that

*B*was minimal, we get (i). □

Therefore we get the following characterisation of the (finite part of the) tropical linear space *L*_{p}.

### Proposition 16

*Let*

*x*∈ℝ

^{m},

*and let*

*p*

*be a valuated matroid of rank*

*n*

*on*[

*m*].

*The following are equivalent*.

- (i)
*x*∈*L*_{p}. - (ii)
*Every element of**E**belongs at least to one**x*-*minimal base of**p*. - (iii)
*Every circuit of**p**contains at least two**x*-*minimal elements*. - (iv)
*Every element of**E**is**x*-*minimal in at least one cocircuit of**p*.

### Proof

(i) and (iii) are equivalent by the definition of *L*_{p} (cf. [16]). The remaining assertions are obtained by applying Proposition 15 to the valuated matroid *p*_{x}. □

Note that the previous characterisation does not apply when *x* has an infinite coordinate, since *p*_{x} is then no longer a valuated matroid. However, *x*_{u}=∞ happens only when *u* does not belong to any base. To deal with this case, one can either restrict to *loop-free* matroids (which means removing any 0 vectors in the membrane case), or put \(\pi_{L_{p}}(x)_{u}=\infty\).

The computation of \(\pi_{L_{p}}(x)\) can be performed independently for every coordinate of the vector *x*. For a given *u*∈*E*, there is a (unique) normalisation of a circuit *C* of *p* containing *u* such that \(C^{x}_{u}=x_{u}\).

### Proposition 17

*If*

*u*∈

*E*

*violates any one of the three conditions of Proposition*15

*for the valuated matroid*

*p*

_{x},

*then*

*u*

*satisfies them for the modified vector*\(x'=(x_{1},\ldots,x'_{u},\ldots,x_{m})\)

*with*

*where all the circuits are normalised so that*\(C^{x}_{u}=x_{u}\).

*Moreover*,

*the conditions of Proposition*15

*are not satisfied at*

*u*

*for*\(x''=(x_{1},\ldots,x'_{u}-\varepsilon,\ldots,x_{m})\)

*with*

*ε*>0.

### Proof

By assumption, *u* is the unique *x*-minimum over some circuit \(\widetilde{C}\) containing *u*. The support of such a circuit *C* can be defined as \(\overline{C}=X(B,u)\) the fundamental circuit of *u* and a base \(B\not\ni u\). The *x*-value at \(e\in\overline{C}\) of the circuit *C* is of the form \(C^{x}_{e}=p(B\cup\{u\}\backslash\{e\})-p(B)+x_{e}+ \alpha\) for some constant *α*∈ℝ, so we may choose as representative of any circuit *C* containing *u* the only one such that \(C^{x}_{u}=x_{u}\), namely the one defined by \(C^{x}_{e}=p(B\cup\{u\}\backslash\{e\})-p(B)+x_{e}\).

*C*∋

*u*, we have

*u*cannot be the unique

*x*′-minimum of any circuit containing

*u*. On the other hand, there exists a circuit

*C*containing

*u*such that \(\min_{e\in C\backslash\{u\}}C^{x}_{e}=x'_{u}\). Putting \(x''_{u}=x'_{u}-\varepsilon\) for any

*ε*>0, then

*u*will be the

*x*″-unique minimum over the circuit

*C*. Thus

*x*′ is the smallest vector that corrects the value of

*x*at

*u*. □

### Theorem 6

*Let*

*x*∈ℝ

^{m}

*and let*

*B*

*be an*

*x*-

*minimal base of*

*p*.

*Then*\(\omega=\pi_{L_{p}}(x)\)

*can be computed in the following way*:

*Moreover*,

*B*

*is also*

*ω*-

*minimal*.

### Proof

If *i*∈*B* holds, then *i* is *x*-minimal in the fundamental cocircuit *X*^{∗}(*B*,*i*). Therefore all conditions of Proposition 15 apply to *i*. Otherwise, let *X*(*B*,*i*) be the fundamental circuit of *B* and *i*, normalised so that *X*(*B*,*i*)_{i}=*x*_{i}. According to Proposition 17, we have to prove that \(\min_{e\neq i}(X(B,i)_{e}+x_{e})=\max_{C\ni i}\min_{e\in C\backslash\{ i\}} C^{x}_{e}\). By construction, ≤ holds. Moreover, it is sufficient to prove the result for *x*=0. So assume that *B* is minimum and *X*(*B*,*i*)_{i}=0. We want to show that min_{e≠i}(*X*(*B*,*i*)_{e})≥min_{e∈C∖{i}}*C*_{e} for any circuit *C* containing *i*.

*C*=

*X*(

*B*′,

*i*) be any circuit containing

*i*. Consider

*u*∈

*C*∖{

*i*} such that min

_{e≠i}

*X*(

*B*,

*i*)

_{e}=

*X*(

*B*,

*i*)

_{u}. By construction,

*B*

_{1}=

*B*∪{

*i*}∖{

*u*} is a base. Since

*i*∈

*B*

_{1}∖

*B*′, we apply axiom (17) and deduce that there exists

*j*∈

*B*′∖

*B*

_{1}, such that Reordering terms, and inserting

*p*(

*B*), we get

*B*is a minimal base, we have

*p*(

*B*)−

*p*(

*B*∪{

*j*}∖{

*u*})≤0, hence

*p*

_{x}-minimum base

*B*. Let

*B*′ be a base which is adjacent to

*B*, that is, such that there exist

*i*≠

*j*in

*E*with

*B*∖{

*i*}=

*B*′∖{

*j*}. Let Δ=

*p*

_{ω}(

*B*′)−

*p*

_{ω}(

*B*). Then we have Hence

*B*is locally

*ω*-minimum. According to [9], the global minimum of

*p*

_{ω}is obtained by choosing the local minimum at each step. Hence

*B*is also a global minimum of

*p*

_{ω}. □

### 5.3 The greedy algorithm for a realisable valuated matroid

*V*≃

*K*

^{n}, and consider a family of

*m*≥

*n*vectors

*M*=(

*v*

_{1},…,

*v*

_{m}) of rank

*n*. For any basis (

*e*) of

*V*, consider the valuated matroid

### Lemma 18

*A base**B**is minimal for**p*_{(e)}*if and only if it is minimal for**p*_{(ε)}*for any other basis* (*ε*) *of**V*.

### Proof

*F*of

*n*vectors, one has det

_{(ε)}(

*F*)=det

_{(e)}(

*F*)det

_{(ε)}(

*e*). Therefore

*p*

_{(ε)}−

*p*

_{(e)}is a constant map, and the claim is established. □

*n*vectors form a base

*B*, in which we express all other vectors. Namely, we consider the matrix

*B*to be the starting point of the greedy algorithm, except that we will reorder successively the vectors of

*B*in another order than 1,2,…,

*n*. Indeed, consider matrices of the form

*A*

_{i,u}=

*u*

_{i}and that

*i*

_{1},

*j*

_{1}) are indices such that \(v(\mathbf{M}_{i_{1},j_{1}})\leq v(\mathbf{M}_{i,j})\), then replacing the vector \(e_{i_{1}}\) in the base

*B*by the vector \(v_{j_{1}}\) will indeed attain the local minimum. The next step consists of

- 1.
Define \((e_{1},\ldots,u_{i_{1}},\ldots,e_{n})\) as new base

*B*′. - 2.
Create

**M**_{B′}=(*A*_{i,u})^{−1}**M**_{B}.

**M**

_{B′}: this time the minimum should be taken over rows

*i*≠

*i*

_{1}and columns

*j*≠

*j*

_{1}. This is explained in Algorithm 3.

## Acknowledgements

Supported in part by DFG grant MO 1048/6-1.

I have benefited from very interesting and stimulating discussions with Federico Ardila, Josephine Yu, Michael Joswig, Annette Werner, Felipe Rincón and Stéphane Gaubert, held at the Tropical Geometry Workshop at the CIEM in Castro Urdiales (Spain) in December 2011.

### Open Access

This article is distributed under the terms of the Creative Commons Attribution License which permits any use, distribution, and reproduction in any medium, provided the original author(s) and the source are credited.