Hodge-Newton indecomposability and a combinatorial identity
Dong Gyu Lim

TL;DR
This paper offers a new perspective on Hodge-Newton indecomposability and provides a unified proof of a combinatorial identity related to affine Deligne-Lusztig varieties with finite Coxeter elements.
Contribution
It introduces an alternative viewpoint on Hodge-Newton indecomposability and simplifies the proof of a key combinatorial identity in the context of affine Deligne-Lusztig varieties.
Findings
Unified proof of a combinatorial identity
New interpretation of Hodge-Newton indecomposability
Enhanced understanding of affine Deligne-Lusztig varieties
Abstract
We present a simple alternative viewpoint on Hodge-Newton indecomposability, illustrating its explanatory value through a uniform proof of a combinatorial identity arising from affine Deligne-Lusztig varieties with finite Coxeter part.
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 Algebra and Geometry · Advanced Combinatorial Mathematics · Advanced Mathematical Identities
A combinatorial proof of the general identity of He-Nie-Yu
Dong Gyu Lim
Evans Hall, University of California at Berkeley, CA, USA
(Date: March 1, 2024)
Abstract.
We give a uniform and combinatorial proof of the general identity appearing in the work of He-Nie-Yu on the affine Deligne-Lusztig varieties with finite Coxeter part.
Contents
1. Introduction
1.1. Background
In [HNY22], He-Nie-Yu studies the affine Deligne-Lusztig varieties with finite Coxeter parts. They study such types of varieties using the Deligne-Lusztig reduction method from [DL76] and carefully investigating the reduction path. In the approach, they establish the “multiplicity one” result which is, roughly speaking, for any -conjugacy class , there is at most one path in the reduction tree that corresponds to . The proof of the “multiplicity one” result is obtained by showing that a certain combinatorial identity (of two -polynomials, or more precisely, of the class polynomials) of the following form holds:
[TABLE]
They first reduce this to the case when is split and simply-laced and is a fundamental coweight ([HNY22, 6.5 and 6.6]). Then, for type , they check the identity using some geometric properties of affine Deligne-Lusztig varieties, such as dimension formulae and injectiveness of the projection map from the affine flag variety to the affine Grassmannian ([HNY22, 5.4]). Also, for example, the type case is proven by computer. In our paper, we prove it all at once in the quasi-split case via a combinatorial proof.
1.2. The general identity and the sketch of proof
As in [HNY22, 2.1], let be a quasi-split reductive group over a local field and be a maximal torus constructed in loc.cit.. Denote by the relative Weyl group and by the set of simple reflections, equipped with a Frobenius action .
Moreover, denote by the inertia group of and define . The subset of dominant vectors will be denoted by . Now, for each , we denote the corresponding root, coroot, fundamental weight, and fundamental coweight by , , , and . Moreover, we denote by the -orbit of and define and .
Definition 1.1**.**
Given , define as and define
[TABLE]
Note that is -stable for any . We also note that our is defined in this way for the sake of simplicity of the proof, but it is the (bijective) image of the original one via the dominant Newton map (see [HNY22, 6.2]).
Our main theorem is the following.
Theorem 1.2**.**
Let . Then, as polynomials of a variable ,
[TABLE]
1.2.1. The setup and the proof
We explain the proof straight, but, in order to see the main idea more clearly, we suggest seeing Section 3.
In , consider the following set of points
[TABLE]
Definition 1.3**.**
Fix a subset . For each , let us define as with the convention that .
We also define the rough envelope of by
[TABLE]
We will denote by , the envelope of , the set .111In particular, we are not assuming that for all when considering .
The main proposition of our paper is as follows.
Proposition 1.4**.**
Let . TFAE:
- (1)
* is the smallest among the ones in .* 2. (2)
* is minimal among the ones in .* 3. (3)
For all , we have .
By taking any minimal element of , we get the following corollary.
Corollary 1.5**.**
For any , the smallest element of exists.
Now, we can prove the main theorem as follows.
Proof of Theorem 1.2.
We may assume that . Now, consider the following probabilistic process: For each , we select it with the probability . Then, for the set of the selected points, say , we take the smallest element in whose existence is guaranteed by Corollary 1.5.
Given , let be the probability that this process results in . Then, it is obvious that by the definition of . Now, it is enough to show that
[TABLE]
By Proposition 1.4, the element is the smallest in if and only if for all with the equality holding for each . The inequality part is equivalent to that the points above are not selected. There are number of such points so that we get the -part. The equality part means that the point must be selected for all , giving which is as and are -stable. ∎
1.2.2. The identity of [HNY22, 6.1]
By applying to Theorem 1.2, we get
[TABLE]
where here is the original one defined in [HNY22, 2.3].
2. Proof of the proposition
2.1. Two lemmas
Given a subset , we say that is connected if the corresponding graph in the Dynkin diagram is connected. We denote by the set of vertices of that is adjacent to but not in . For example, when , we have . Note that if is -stable, then so is .
The following is crucial in the proofs of Proposition 1.4 and Corollary 1.5.
Lemma 2.1**.**
Let be connected and be a vertex of . Then, there exist for each and for each such that
[TABLE]
The dual version also holds (with possibly different ’s and ’s).
Proof.
The main idea is that is a Dynkin diagram again. We now set ’s to be the coefficients, when expressing fundamental coweights of , of the linear combination by coroots of . Then, they are all positive (cf. [Lim23, Lemma 2.18]). Now, we need to compute what looks like. We do this by computing for each . By construction, it is nonzero if and only if . In that case, it is not just nonzero, but it is always negative as when and are adjacent, and is positive. ∎
Lemma 2.2**.**
For a subset and , suppose that there exists such that . Then, one can find such that either (S) or (Ic) holds.
[TABLE]
[TABLE]
Proof.
Definition of : Define and be its connected component containing . It is -stable. Applying lemma 2.1 to those and , we denote by the resulting part and by its -average. We want to set for some .
Construction of : Note that for all by definition of . As for all by lemma 2.1, we can find the maximal one such that for all . We take and let .
Verification of : Observe that only for and only for . Other cases give . Hence, we only need to consider . However, as is -invariant. It is since . As is -invariant, so is .
Verification of “(S) or (Ic)”: As and ,
[TABLE]
So, (S) is equivalent to which is equivalent to that . Next, from the previous paragraph, we know that if and only if .222If , then . However, for , we have but belongs to only the right-hand side set in (Ic). This proves the claim. ∎
2.2. The proposition
Proof of Proposition 1.4.
(1)(2): Trivial.
(2)(3): Assume that (3) does not hold. As , we can apply lemma 2.2. If the new satisfies the assumption again, we keep repeating this process. As the number in (S) is and that in (Ic) is , the process terminates in finite steps. The final then satisfies that for all . Noting that for some , we get for all meaning that . It contradicts to (2).
(3)(1): Suppose that and let us show that . This is equivalent to that for all . Now recall that for all as . Moreover, we have for all by assumption. Hence, for all . We get for all as and are -invariant.
Let . The dual version of lemma 2.1 applied to the connected component of containing tells us that is a nonnegative linear combination of () and (). However, as and for all , so we have for all . Therefore, for all . ∎
3. An explicit identity as a motivation
The main (probabilistic) idea of our paper arose proving this theorem:
Theorem 3.1** ([HNY22, 1.3]).**
For natural numbers , the following holds:
[TABLE]
Now, we consider and let , , and . After modifications, Theorem 3.1 is equivalent to the following, for . Here, we only consider lattice points interior to .
Proposition 3.2**.**
Let be the set of all convex piecewise linear curves which has only lattice points as non-linear points and lies in not touching and . Then, the following identity holds. Here, and are the number of lattice points under and of non-linear points of .
[TABLE]
Proof.
We may assume and consider the following process. For each lattice point, choose (or abandon) it with the probability (or ). Then, take the minimal length curve from to under the chosen points.
Given , the process ends in exactly when
-
the lattice points under are abandoned () and
-
the non-linear points of are chosen ().
So, the probability of ‘the process ends in ’ is and, obviously, their sum must be .
∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[DL 76] P. Deligne and G. Lusztig. Representations of reductive groups over finite fields. Ann. of Math. (2) , 103(1):103–161, 1976.
- 2[HNY 22] Xuhua He, Sian Nie, and Qingchao Yu. Affine deligne–lusztig varieties with finite coxeter parts, 2022.
- 3[Lim 23] Dong Gyu Lim. Nonemptiness of single affine deligne-lusztig varieties, 2023.
