The affine equation
Let q=ps, let ord be the valuation of C∞ with ordθ=−1, and let A=(ajk)∈M2(C∞). The t-motive M(A) is defined by Te∗=θe∗+Aτe∗+τ2e∗, e∗=(e1,e2)t; it is pure of dimension 2 and rank 4 [2]. Assume a21=0. By [2 (3.0), (3.1), Theorem 3.3], h1(M(A)) is the Fq[T]-rank of the module of small solutions X=∑i≥0xiτi, xi∈C∞, xi→0, of the system (i≥0,x−1=x−2=0)
k=0∑4akxiqk+b14xi−1q4+b13xi−1q3+b12xi−1q2+b24xi−2q4=0,(1)
with
a4=a21q2θq3+q2,a3=a21q2a11q2θq2+a21q2a22q2θq2,a2=a21θq+a21q2θq2+a21qa11qa22q−a12q,
a1=a21a11+a21qa22q,a0=a211,b14=−a21q2θq3+θq2,b13=−a21q2a11q2−a21qa22q,
b12=−a211−a21q21,b24=a21q21.
Put αk=ordak, βjk=ordbjk (with ord0=+∞) and Pk=(qk,αk). One has the exact relations
a3=−θq2b13,β14=α4+q2,β24=α4+q3+q2.(2)
Since a0a4=0, the solutions of the equation i=0 form a 4-dimensional Fq-vector space S0, and the valuations of its nonzero elements are the slopes, with sign changed, of the lower convex hull Π of the points Pk, an edge from abscissa qj to ql carrying ql−qj of them. For every c, the elements of S0 of valuation >c form, with 0, an Fq-subspace, of dimension l if the edges of slope <−c end at abscissa ql.
Two elementary lemmas
For g∈Q put W(g)=maxk(g−αk)/qk, the maximum over the k with ak=0.
Lemma 1. Let c∈C∞ with ordc=g. The equation ∑kakxqk=−c has solutions, all of valuation ≤W(g), and some of valuation exactly W(g). The function W is strictly increasing.
Proof. If ordx>W(g), every term akxqk has valuation >αk+qkW(g)≥g, which is impossible. The Newton polygon of c+∑kakxqk has its first edge from (0,g) to the point Pk minimizing (αk−g)/qk; its roots have valuation W(g), and C∞ is algebraically closed. □
Given xi−1,xi−2 with valuations v,v′, put T14=β14+q4v, T13=β13+q3v, T12=β12+q2v, T24=β24+q4v′, and Φ(v)=W(β12+q2v).
Lemma 2. W(T14)≥v+q−2, W(T13)≥v+q−1 (if b13=0), W(T24)≥v′+(q+1)q−2, and Φ(v)≥v+(β12−α2)q−2 (if a2=0).
Proof. Bound W below by the term k=4, k=3, k=4, k=2 respectively and use (2). □
The criterion
For k∈{0,1,3,4} with ak=0 put fk=(β12−αk)/(qk−q2), and let
I={v∈R:Φ(v)≤v}.
A direct computation shows that v∈I if and only if α2≥β12 and max(f3,f4)≤v≤min(f0,f1) (indices with ak=0 omitted); geometrically, the line through (q2,β12) of slope −v lies on or below all the points Pk.
Theorem 3. Assume a21=0.
(1) If I=∅, then h1(M(A))=4. This holds in particular if orda2<ordb12.
(2) If I=∅ and a1=0, f1<f0, then h1(M(A))≥1.
Proof. Let x0∈S0, v0=ordx0, and define x1,x2,… inductively: if the tail of (1) vanishes, take xi=0; otherwise take for xi a solution of maximal valuation (Lemma 1). Since the valuation of the tail is at least min(T14,T13,T12,T24), Lemma 1 gives, with vj=ordxj,
vi≥min(W(T14),W(T13),Φ(vi−1),W(T24)).(3)
the terms with a zero coefficient being omitted (for i=1 the term T24 is absent).
(1) The function Φ(v)−v is convex and piecewise linear, with slope q2−1>0 for v≫0 and slope q−2−1<0 for v≪0; if I=∅ it is positive, hence ≥c for some c>0. By (3) and Lemma 2, vi≥min(vi−1,vi−2)+min(c,q−2), so vi→+∞ and X=∑xiTi is a small solution.
If α2<β12, then Φ(v)−v≥(β12−α2)q−2>0 for all v by Lemma 2, so I=∅. Applying this to an Fq-basis x0(1),…,x0(4) of S0 gives small solutions X(1),…,X(4). They are Fq[T]-linearly independent: in a relation ∑cjX(j)=0 with cj∈Fq[T] not all zero we may assume, T being injective on C∞[[T]], that some cj(0)=0, and the constant term gives ∑cj(0)x0(j)=0. Hence h1(M(A))≥4, and h1(M(A))≤4 always.
(2) Let v+=maxI=min(f0,f1)=f1. The line ℓ through (q2,β12) of slope −v+ passes through P1, strictly below P0 (as f1<f0), and on or below the other points; hence P0P1 is the first edge of Π, of slope <−v+, and S0 contains an element x0=0 with v0>v+. The function Φ(v)−v is convex, ≤0 on I and >0 to the right of v+, so it is nondecreasing on [v+,∞) and Φ(v)−v≥c0:=Φ(v0)−v0>0 for v≥v0. By induction, (3) and Lemma 2 give vi≥v0 and vi≥min(vi−1,vi−2)+min(c0,q−2), so X is a small solution and h1≥1. □
Corollary 4 (simple case). Assume a21=0. If the valuation of a2 equals the minimum of the valuations of its four summands (in particular in the simple case of [5], where the valuation of each of the nine coefficients equals the minimum of the valuations of its summands), then h1(M(A))=4.
Proof. The first two summands of a2 have valuations −q−orda21 and −q2−q2orda21, smaller than the valuations −orda21 and −q2orda21 of the two summands of b12. Hence α2<min(−orda21,−q2orda21)≤β12, and Theorem 3(1) applies. □
Remark 5. If at every step the minimum of T14,T13,T12,T24 is attained by a single term, the inequalities above become equalities, and one finds that the starts x0 with ordx0≤maxI stay of valuation ≤maxI; the value of h1 is then 4, 1 or 0 according as I=∅, f1<f0, or neither. Values 2 and 3 can therefore only occur through cancellations in the tail.
Conjecture 3.7 of Ehbauer, Grishkov and Logachev
Write (u11,u12,u21,u22)=(orda11,orda12,orda21,orda22)∈(Q∪{+∞})4. In [2 Conjecture 3.7] (see also [4 Conjecture 4.2.3]) it is conjectured that h1(M(A))=4 whenever this point lies outside a countable union of linear subspaces of dimension ≤3.
For u21<∞ put s1=−q−u21, s2=−q2−q2u21, s3=q(u11+u22−u21), s4=qu12, with s3=+∞ if u11=+∞ or u22=+∞, and s4=+∞ if u12=+∞; these are the valuations of the four summands of a2.
Corollary 6. Let H⊂(Q∪{+∞})4 be the set of points with u21<∞ at which two of the finite numbers s1,…,s4 are equal. It is the union of the six sets defined by
u21=−q+1q,u11+u22−qq−1u21+1=0,u12+q1u21+1=0, u11+u22+(q−1)u21+q=0,u12+qu21+q=0,u11+u22−u21−u12=0. each equation being imposed with all the coordinates it involves finite and the other coordinates arbitrary in Q∪{+∞}. Let H′ be the image of H under u11↔u22, u12↔u21. This exchange maps the set given by s1=s4 onto the set given by s2=s4 and fixes the set given by s3=s4, so H∪H′ is the union of nine such sets. If (u11,u12,u21,u22)∈/H∪H′, then M(A) is uniformizable: h1(M(A))=h1(M(A))=4.
Proof. Suppose first u21<∞. The equalities sj=sk between finite sj,sk are the six equations defining H, and s1,s2 are always finite. Outside H the minimum of the sj is attained once, so no cancellation can occur in a2, and Corollary 4 gives h1=4. If u21=∞ and u12<∞, the basis (e2,e1) gives M(A)=M(JAJ−1) with J=(0110), which exchanges a11↔a22 and a12↔a21; apply the first case. If a12=a21=0, M(A) is the direct sum of two Drinfeld modules of rank 2, which are uniformizable. Finally h1=4 if and only if h1=4 by Anderson’s theorem [2]. □
Remark 7. For antidiagonal A (u11=u22=+∞), H∪H′ meets the plane of (u12,u21) in the four lines u21=−q+1q, u12=q+1q, u21=−qu12−q and u21=−u12/q−1. The first, third and fourth contain the rays R1,R2,R3 of [2 Section 6], on which the non-uniformizable M(A) of [2 Theorem 5.1] lie. On H∪H′ uniformizability may fail only if the leading terms of the tied summands of a2 cancel to the point that I=∅. The uniformizable locus is open in families [1].
Numerical checks
Theorem 5.1 of [2]. For antidiagonal A, the value of h1 obtained by iterating (3) with equality coincides with [2 Theorem 5.1] at all 38 640 points of a grid in (orda21,orda2), for q=2 and q=3.
The example of [3]. For q=2 and A=(θθ−2θ60) one has s2=s4=−12 (and u22=+∞): the point lies on H, and θ12 cancels in a2=θ4, so that α2=−4≥−8=β12. This agrees with h1(M(A))=0 and h1(M(At))=1 [3 Theorems 4.1 and 4.7].
The example of [5]. For q=2 and A=(θ3θ−1θ−21) the nine coefficients are those of [5]; the two summands θ8 of a2 cancel (s2=s3=−8), and a2=θ3+θ−4. Here β12=−4 and (f0,f1,f3,f4)=(1,0,4,1), so max(f3,f4)>min(f0,f1) and I=∅ whatever the valuation of a2. Since a1,a3,b12,b13 have no ties among their summands, h1(M(A))=4 for every A whose entries have the valuations (−3120), in accordance with [5]. The lower bounds (3) for the start of valuation −1/2 are −1/2,0,1/2,1,…, as in [5].
Exact computations. For 40 000 matrices A with entries in Fq[θ,θ−1] (q=2,3), chosen so that cancellations in a2 are frequent, the nine coefficients were computed exactly. In every case I=∅ holds for A if and only if it holds for At, in accordance with h1(M(A))=4⟺h1(M(At))=4.
The scripts used for these checks are not part of this deposit.
Acknowledgements. The author thanks D. Logachev for explaining the computation of h1 through affine equations. The computations and part of the writing were carried out with the assistance of Claude (Anthropic).
Independent researcher, Meaux, France