GRADE is a framework of metrics and models that classify functions by their complexity through diagonal and Hadamard grades, establishing a strict hierarchy from rational to transcendental functions.
It uses nilpotent monodromy to set sharp lower bounds for grading, linking algebraic structure with analytic properties in D-finite and hypergeometric functions.
Applications include the analysis of hypergeometric series and Apéry’s generating function, providing concrete examples of grade computations and refined stratifications within function spaces.
GRADE refers to a diverse set of frameworks, metrics, and models across multiple domains including algebra, information retrieval, dialogue evaluation, automated grading, benchmarking, and machine learning. The concept typically encodes a notion of "gradation" or "degree"—either as a measure of complexity, capability, or evaluation along structural, algebraic, or computational axes. This article provides an integrated technical overview of GRADE as it appears in algebraic function theory, especially through the notion of diagonal grade and its relation to nilpotent monodromy, hypergeometric functions, Hadamard grade, and notable generating functions (Harder et al., 14 Apr 2025).
1. Diagonal Grade: Definition and Function Classes
Let K be a number field and consider the formal power series h(x0,…,xn)=i0,…,in≥0∑ai0,…,inx0i0⋯xnin—a rational or algebraic function with Q(0)=0. The diagonal of h is the single-variable series: Δn(h)=∑i≥0ai,…,ixi.
The diagonal gradedg(f) of a nonzero f(x)∈K[[x]] is: dg(f)=min{n≥0∣∃h∈K(x0,…,xn):f=Δn(h)}
with dg(f)=∞ if no such n exists. Define h(x0,…,xn)=i0,…,in≥0∑ai0,…,inx0i0⋯xnin0 and h(x0,…,xn)=i0,…,in≥0∑ai0,…,inx0i0⋯xnin1. Notably, h(x0,…,xn)=i0,…,in≥0∑ai0,…,inx0i0⋯xnin2 is the set of rational functions and h(x0,…,xn)=i0,…,in≥0∑ai0,…,inx0i0⋯xnin3 is the set of algebraic functions. The diagonal grade thus encodes a hierarchy of function spaces: h(x0,…,xn)=i0,…,in≥0∑ai0,…,inx0i0⋯xnin4
This structure formalizes how increasing the number of variables in the rational function "source" allows for greater function-theoretic richness in the resulting univariate series.
2. Nilpotent Monodromy and Grade Lower Bounds
Consider a h(x0,…,xn)=i0,…,in≥0∑ai0,…,inx0i0⋯xnin5-finite function h(x0,…,xn)=i0,…,in≥0∑ai0,…,inx0i0⋯xnin6 with minimal annihilating operator over h(x0,…,xn)=i0,…,in≥0∑ai0,…,inx0i0⋯xnin7: h(x0,…,xn)=i0,…,in≥0∑ai0,…,inx0i0⋯xnin8
Let h(x0,…,xn)=i0,…,in≥0∑ai0,…,inx0i0⋯xnin9 denote the associated differential module (rank Q(0)=00). The local monodromy at Q(0)=01 decomposes as Q(0)=02, with Q(0)=03 unipotent. The nilpotence indexQ(0)=04 is the minimal Q(0)=05 with Q(0)=06.
The principal result in this direction states: Q(0)=07
Q(0)=08
Consequently, for any Q(0)=09-finite h0,
h1
Thus, the nilpotence of the monodromy yields a fundamental lower bound for the diagonal grade and, by implication, for any related gradation such as the Hadamard grade.
3. Diagonal and Hadamard Grade of Hypergeometric Series
For the generalized hypergeometric function: h2
the diagonal and Hadamard grade can be determined via monodromy. In the non-resonant case with h3, Levelt's monodromy theorem guarantees the nilpotence index at h4 is h5. Thus,
h6
On the other hand, the explicit Hadamard factorization yields: h7
where each h8 is algebraic. This gives an upper bound h9 for the Hadamard grade. For the special case with Δn(h)=∑i≥0ai,…,ixi.0,
Δn(h)=∑i≥0ai,…,ixi.1
for all Δn(h)=∑i≥0ai,…,ixi.2. This provides strictly increasing sequences of function classes: Δn(h)=∑i≥0ai,…,ixi.3
and, for Hadamard grade, likewise for the corresponding Δn(h)=∑i≥0ai,…,ixi.4.
4. Hadamard Grade: Definition and Relation
The Hadamard product of Δn(h)=∑i≥0ai,…,ixi.5 and Δn(h)=∑i≥0ai,…,ixi.6 is: Δn(h)=∑i≥0ai,…,ixi.7
The Hadamard gradeΔn(h)=∑i≥0ai,…,ixi.8 is the minimal Δn(h)=∑i≥0ai,…,ixi.9 (or dg(f)0) such that
dg(f)1
with all dg(f)2 algebraic (dg(f)3 if dg(f)4 is rational). Any Hadamard product of diagonals is again a diagonal, so dg(f)5. The correspondence between nilpotence and Hadamard (or diagonal) grade is precise for the hypergeometric family considered above, and the direct Hadamard decomposition gives dg(f)6 for
dg(f)7
5. Apéry's Generating Function and Higher Grade
Apéry’s sequence: dg(f)8
admits the diagonal representation: dg(f)9
implying f(x)∈K[[x]]0. Furthermore, f(x)∈K[[x]]1 satisfies Apéry’s third-order Fuchsian ODE with monodromy at f(x)∈K[[x]]2 a f(x)∈K[[x]]3 Jordan block, implying f(x)∈K[[x]]4 and thus f(x)∈K[[x]]5. This confirms the existence of f(x)∈K[[x]]6 with diagonal grade f(x)∈K[[x]]7, resolving an outstanding question on the strictness of the class inclusions f(x)∈K[[x]]8.
6. Structural and Theoretical Implications
The findings substantiate that:
The diagonal grade provides a strict stratification of f(x)∈K[[x]]9-finite functions, with rational dg(f)=min{n≥0∣∃h∈K(x0,…,xn):f=Δn(h)}0 algebraic dg(f)=min{n≥0∣∃h∈K(x0,…,xn):f=Δn(h)}1 strictly higher diagonal classes.
Nilpotent monodromy is a sharp lower bound for both diagonal and Hadamard grade, and for classical hypergeometric series of the form dg(f)=min{n≥0∣∃h∈K(x0,…,xn):f=Δn(h)}2, both grades equal dg(f)=min{n≥0∣∃h∈K(x0,…,xn):f=Δn(h)}3.
Hadamard grade, while potentially distinct in general, coincides with diagonal grade in these explicit cases due to direct factorization into algebraic components.
The explicit computation for Apéry's dg(f)=min{n≥0∣∃h∈K(x0,…,xn):f=Δn(h)}4 demonstrates grade dg(f)=min{n≥0∣∃h∈K(x0,…,xn):f=Δn(h)}5, answering in the affirmative the existence question for higher grades.
7. Outlook and Extensions
The presented framework establishes deep connections between the algebraic-combinatorial representation of functions, the monodromy theory of their differential equations, and concrete realizations via diagonals and Hadamard products. These techniques are foundational for the classification and understanding of transcendental numbers, the analytic properties of special functions, and applications in periods, enumerative geometry, and mathematical physics (Harder et al., 14 Apr 2025). The extension of grade computations to wider classes of special functions, generating functions in enumerative combinatorics, and their analogues in dg(f)=min{n≥0∣∃h∈K(x0,…,xn):f=Δn(h)}6-series or multivariate settings remains a stimulating area for future research.