Formalizing $A_1^{(1)}$ Curve Neighborhoods in Lean 4

Abstract: Combinatorial curve neighborhoods are somewhat foundational when setting up the quantum Schubert calculus for affine flag manifolds. In the specific case of type $A_1^{(1)}$, you can encode these neighborhoods entirely within the moment graph of the infinite dihedral group $D_\infty$. Building on the framework developed by Mihalcea and Norton, this paper presents a complete, axiom-free formalization of these combinatorial curve neighborhoods in Lean 4. Rather than just wrapping mathematical statements, we formalized $D_\infty$ directly as a Coxeter system to explicitly compute length functions and degree maps. Reachable sets are defined through edge chains bounded by specific degrees, and we ultimately characterize the curve neighborhood by the maximal vertices inside these sets. The core effort here lies in formally verifying the explicit combinatorial formulas for curve neighborhoods of arbitrary elements. Interestingly, by restricting our search space to finite sets, we also managed to extract a fully computable version of these neighborhoods.

• The paper formalizes combinatorial curve neighborhoods for the A₁^(1) affine flag manifold using an axiom-free, machine-checked approach in Lean 4.
• It implements explicit Coxeter system instances, computable word length reductions, and inductive reasoning on moment graph structures within Mathlib.
• The work bridges theoretical combinatorics and computation by certifying algorithms that enable executable verification and applications in quantum cohomology.

Formalization of $A_1^{(1)}$ Curve Neighborhoods in Lean 4

Overview

The paper "Formalizing $A_1^{(1)}$ Curve Neighborhoods in Lean 4" (2604.23211) provides a comprehensive, axiom-free formalization—both logically and computationally—of combinatorial curve neighborhoods for the $A_1^{(1)}$ affine flag manifold in Lean 4. The focus is on translating the intricately combinatorial results of Mihalcea and Norton regarding these neighborhoods, which are expressed via the moment graph of the infinite dihedral group $D_\infty$, into a machine-checked language that admits both verification and computation using the Mathlib library.

Mathematical and Combinatorial Foundation

The $A_1^{(1)}$ affine flag manifold's combinatorial structure is governed by the infinite dihedral group $D_\infty$, realized as a Coxeter group generated by involutive elements $s_0$ and $s_1$. The representation leverages Coxeter theoretic length, reduced decompositions, and the explicit bijection with root reflections by combinatorial data.

The combinatorial curve neighborhood $\Gamma_d(u)$ of an element $u \in D_\infty$ and degree $A_1^{(1)}$0 comprises the Bruhat-maximal elements $A_1^{(1)}$1 that are reachable from $A_1^{(1)}$2 by an increasing chain in the moment graph of total degree at most $A_1^{(1)}$3. Mihalcea and Norton's main theorem provides an algebraic characterization: $A_1^{(1)}$4 can be determined by the set of products $A_1^{(1)}$5 for maximal $A_1^{(1)}$6 in the set $A_1^{(1)}$7, reducing the recursive, graph-theoretic reachability to an explicit, algebraic criterion relying on Coxeter length additivity and root counts.

A core combinatorial step involves a parity lemma quantifying how chain degrees relate to word decompositions modulo $A_1^{(1)}$8, providing explicit bounds for reachability in the moment graph.

Lean 4 and Mathlib Formalization

The translation into Lean 4 operates on several levels:

• Coxeter System Instance: $A_1^{(1)}$9 is instantiated as a Coxeter system with the appropriate generator and relation structure. The formalization ensures explicit computational equivalence between the abstract and geometric group presentations, establishing the bridge necessary for operating within the algebraic API of Mathlib.
• Explicit Length and Reduced Words: While Coxeter length is abstractly the minimum length over all generator decompositions, the formalization provides a constructive, computable version, proven equivalent to the theoretical definition. This proof relies on structural induction and detailed analysis of alternating products.
• Moment Graph and Degree Structure: The moment graph and its reachability conditions are realized using inductive Lean structures, capturing strictly increasing chains and their associated degrees. This enables formal traversal of Bruhat order and inductive reasoning in proofs.

Key Formal Proofs and Technical Achievements

The formalization rigorously establishes several nontrivial steps that are typically glossed over in informal treatments:

• Finiteness of $A_1^{(1)}$0: The proof that $A_1^{(1)}$1 is finite for any bounded $A_1^{(1)}$2 is made explicit by leveraging the degree bounds to cap Coxeter word lengths, thus facilitating enumeration and computability.
• Parity Lemma and Presburger Arithmetic: Verification of the parity lemma, which is combinatorially subtle and crucial for the algebraic-to-graph-theoretic bridge, is reduced to formal Presburger arithmetic. The Lean 4 omega tactic is leveraged to mechanically discharge the resulting linear constraints across all group element types.
• Main Theorem (algebraic characterization of $A_1^{(1)}$3): The full structural induction required for Mihalcea and Norton's theorem is carried out using left-descent combinatorics, case analysis, and contradiction arguments rooted in Coxeter length. This formalizes the aggressive maximality property of the curve neighborhood.
• Extraction of Computable Algorithms: By bounding candidate sets and mapping abstract sets to explicit lists and finite sets, the neighborhood computation becomes fully algorithmic. Ultimately, the formalization not only supplies proof but also certified executable code via native Lean evaluation.

Numerical and Computational Results

A highlight of the work is the seamless fusion of formal verification and computation:

• Curve neighborhoods, previously accessible only through intricate combinatorics, now admit computation—e.g., for specific $A_1^{(1)}$4 and $A_1^{(1)}$5, the computed neighborhoods match Mihalcea and Norton's tabulations.
• The explicit realization of $A_1^{(1)}$6 as a computable, finite set bridges symbolic theory and computational practice.

Implications and Prospects

This formalization establishes the workflow and baseline for pushing Schubert calculus—traditionally an area dominated by informal, highly technical combinatorics—into the fully certified regime. The implications are twofold:

• Theoretical Rigor: Subtle arguments regarding word parity, length bounds, and moment graph traversal, which are error-prone in informal settings, are now mechanized and verified with full certainty.
• Computational Accessibility: Algebraic curve neighborhood computations, central in quantum cohomology and representation theory, become directly executable, facilitating further experimentation and conjecture testing within Lean.

The techniques and infrastructure developed here are readily extensible to other classes of Coxeter groups and quantum Schubert problems, albeit with increased combinatorial complexity. Beyond affine type $A_1^{(1)}$7, more general (possibly unequal parameter) Coxeter systems and their moment graphs could be targeted, pushing the limits of current formalization and computation tools within proof assistants.

From a broader AI and formal methods perspective, this demonstrates the maturity of interactive theorem proving in handling combinatorial geometry, and sets a precedent for integrating mathematical libraries, proof automation, and certified symbolic computation for concrete problems in representation theory and beyond.

Conclusion

The formalization of $A_1^{(1)}$8 curve neighborhoods in Lean 4 (2604.23211) fully mechanizes both the proofs and the algorithms associated with combinatorial moment graph reachability, as developed by Mihalcea and Norton. The work highlights both the subtlety involved in translating informal combinatorial reasoning into machine-verifiable logic, and the practical payoff in producing certified, executable symbolic computation. This contribution underlines the feasibility and utility of combining algebraic, combinatorial, and computational methods within modern theorem proving environments and sets the stage for future advances in the formal verification of quantum Schubert calculus and related areas.