Introduction

Let $\mathcal N_{24}$ denote the set of the $24$ positive-definite even unimodular lattices of rank $24$, classified by Niemeier . The family consists of the $23$ rooted Niemeier lattices and the unique rootless Leech lattice $\Lambda_{24}$ .

For an even unimodular lattice $L$ of rank $24$ and an integer $g\geq1$, let $$\mathbb H_g = \left\{ Z\in\operatorname{Mat}_{g\times g}(\mathbb C): Z=Z^{\mathsf T},\ \operatorname{Im}(Z)>0 \right\}$$ denote the Siegel upper half-space. The degree-$g$ Siegel theta series of $L$ is $$\Theta_L^{(g)}(Z) = \sum_{X\in L^g} \exp\!\left( \pi i\,\operatorname{tr}(X^{\mathsf T}XZ) \right),$$ where $X=(x_1,\dots,x_g)$ is regarded as a $24\times g$ matrix with columns $x_j\in L$. Since $L$ is even unimodular of rank $24$, $$\Theta_L^{(g)}\in M_{12}\!\left(\operatorname{Sp}_{2g}(\mathbb Z)\right).$$

A fundamental question in the arithmetic theory of modular forms is determining the capacity of Siegel theta series to distinguish non-isometric lattices:

What is the minimal genus $g$ for which the scalar Siegel theta series distinguish all $24$ Niemeier lattices pairwise?

This question involves two fundamentally distinct algebraic phenomena:

1. Pairwise separation: $\Theta_{N_1}^{(g)}\neq\Theta_{N_2}^{(g)}$ for all distinct isometry classes $N_1\neq N_2$ in $\mathcal N_{24}$.

2. Linear independence: $$\dim_{\mathbb C}\operatorname{span} \{\Theta_N^{(g)}:N\in\mathcal N_{24}\}=24.$$

Borcherds, Freitag, and Weissauer established that the $24$ Niemeier theta series are linearly dependent in all degrees $g\leq 11$ and become linearly independent in degree $12$.

In this paper, we resolve the minimal pairwise separation problem.

The logical structure of the proof is clean:

• If two Niemeier lattices have distinct Coxeter numbers $h(N_1)\neq h(N_2)$, then genus $1$ already separates them, since $$a(1,\Theta_N^{(1)})=24h_N.$$

• If two Niemeier lattices have the same Coxeter number, then they belong to one of exactly five collision pairs. For each such pair, the Fourier coefficient $$a(I_4,\Theta_N^{(4)})$$ takes distinct values.

Niemeier Root Systems and Coxeter-Number Collisions

Every rooted Niemeier lattice $N$ is uniquely determined up to isometry by its root system $$\operatorname{Roots}(N) = \bigoplus_i X_i^{m_i},$$ where each $X_i$ is an irreducible simply-laced root system of ADE type and $$\sum_i m_i\operatorname{rk}(X_i)=24.$$ All irreducible components $X_i$ of a given rooted Niemeier lattice share a common Coxeter number $h$ (by a theorem of Venkov ).

Across the $23$ rooted lattices, there are $18$ distinct positive Coxeter numbers. Including the Leech lattice, which is rootless and is assigned $h=0$, there are $19$ Coxeter-number values. Exactly five positive Coxeter numbers occur for two distinct Niemeier lattices. These give the five collision classes: $$\begin{array}{c l l} \toprule h & \text{Collision class} & \text{Root systems}\\ \midrule 6 & (A_5^4D_4,\;D_4^6) & A_5^{\oplus4}\oplus D_4 \quad\text{vs.}\quad D_4^{\oplus6} \\[1mm] 10 & (A_9^2D_6,\;D_6^4) & A_9^{\oplus2}\oplus D_6 \quad\text{vs.}\quad D_6^{\oplus4} \\[1mm] 12 & (A_{11}D_7E_6,\;E_6^4) & A_{11}\oplus D_7\oplus E_6 \quad\text{vs.}\quad E_6^{\oplus4} \\[1mm] 18 & (A_{17}E_7,\;D_{10}E_7^2) & A_{17}\oplus E_7 \quad\text{vs.}\quad D_{10}\oplus E_7^{\oplus2} \\[1mm] 30 & (D_{16}E_8,\;E_8^3) & D_{16}\oplus E_8 \quad\text{vs.}\quad E_8^{\oplus3} \\ \bottomrule \end{array}$$

The remaining $13$ rooted lattices have unique Coxeter numbers, while the Leech lattice is rootless.

Rigidity in Genera One, Two, and Three

In genera $g\leq3$, the scalar theta series of a Niemeier lattice depend only on its Coxeter number $h$.

Genus One

The number of roots of $N$ is $$R(N)=24h.$$ The genus-one theta series is $$\begin{equation} \Theta_N^{(1)} = E_4^3+(24h-720)\Delta \in M_{12}(\mathrm{SL}_2(\mathbb Z)). \label{eq:genus1} \end{equation}$$

Thus the span of all genus-one Niemeier theta series has dimension $d(1)=2$.

Genus Two

Let $X$ be an irreducible simply-laced root system of rank $r$ and Coxeter number $h$. Every root $\alpha\in X$ is orthogonal to exactly $$rh-(4h-6)$$ roots of $X$.

If $$N=\bigoplus_i X_i$$ is a Niemeier root system and $\alpha\in X_k$, then the roots orthogonal to $\alpha$ consist of those orthogonal to $\alpha$ inside $X_k$ together with all roots in the other components. Thus the number of roots orthogonal to $\alpha$ in $N$ is $$[r_kh-(4h-6)]+(24-r_k)h = 20h+6.$$

Hence the number of ordered orthogonal root pairs is universally $$a(I_2,\Theta_N^{(2)}) = 24h(20h+6) = 480h^2+144h.$$

By Erokhin and Nagaoka–Takemori , the genus-two theta series is $$\begin{equation} \Theta_N^{(2)} = (E_4^{(2)})^3 + (24h-720)Y_{12}^{(2)} + (48h^2-2800h+43200)X_{12}^{(2)}. \label{eq:genus2} \end{equation}$$

Thus the span has dimension $$d(2)=3.$$

Genus Three

The total number of ordered orthogonal root triples is $$a(I_3,\Theta_N^{(3)}) = 7872h^3+7104h^2+2880h = 192h(41h^2+37h+15).$$

Nagaoka and Takemori proved that the genus-three theta series depends polynomially on $h$ of degree at most three, with the explicit expression $$\begin{align} \Theta_N^{(3)} ={}& (E_4^{(3)})^3 + (24h-720)Y_{12}^{(3)} + (48h^2-2800h+43200)X_{12}^{(3)} \nonumber\\ &+ (48h^3-288h^2+3144h-1131120)F_{12}. \label{eq:genus3} \end{align}$$

Thus $$d(3)=4.$$

Since $\Theta_N^{(g)}$ depends only on $h$ for $g\leq3$, lattices within each of the five collision classes have identical scalar theta series in every genus $g\leq3$. Therefore $$g_{\mathrm{sep}}\geq4.$$

Fourier Expansion and the $I_4$-Coefficient

Let $\operatorname{Sym}_g^*(\mathbb Z)$ denote the lattice of half-integral symmetric $g\times g$ matrices: $$\operatorname{Sym}_g^*(\mathbb Z) = \left\{ T=(t_{ij})\in\operatorname{Mat}_{g\times g}(\mathbb Q): T=T^{\mathsf T},\ t_{ii}\in\mathbb Z,\ 2t_{ij}\in\mathbb Z \right\}.$$

The Fourier expansion of $\Theta_L^{(g)}$ is $$\Theta_L^{(g)}(Z) = \sum_{T\in\operatorname{Sym}_g^*(\mathbb Z)_{\geq0}} a(T,\Theta_L^{(g)}) \exp(2\pi i\,\operatorname{tr}(TZ)),$$ where $$a(T,\Theta_L^{(g)}) = \#\left\{ X=(x_1,\dots,x_g)\in L^g: \frac12X^{\mathsf T}X=T \right\}.$$

Orthogonal Frame Enumeration in ADE Root Systems

For an irreducible simply-laced root system $X$, let $N_k(X)$ denote the number of ordered $k$-tuples of mutually orthogonal roots. We define the truncated exponential generating function $$F_X(t) = \sum_{k=0}^4\frac{N_k(X)}{k!}t^k.$$

The $A_n$ Family

The $D_n$ Family

Dividing by $k!$ gives $$\begin{equation} F_{D_n}(t) = 1 + 2n^{\underline2}t + \left( 2n^{\underline2}+2n^{\underline4} \right)t^2 + \left( 4n^{\underline4} +\frac43n^{\underline6} \right)t^3 + \left( 2n^{\underline4} +4n^{\underline6} +\frac23n^{\underline8} \right)t^4. \label{eq:FDn} \end{equation}$$

The Exceptional Systems $E_6,E_7,E_8$

The exceptional cases can be handled by successive determination of orthogonal root subsystems. When more than one orbit of possible choices occurs, the cases are treated separately.

Dividing by $k!$ gives $$\begin{align} F_{E_6}(t) &= 1+72t+1080t^2+4320t^3+2160t^4, \nonumber\\ F_{E_7}(t) &= 1+126t+3780t^2+32760t^3+75600t^4, \nonumber\\ F_{E_8}(t) &= 1+240t+15120t^2+302400t^3+1965600t^4. \label{eq:exceptional_polynomials} \end{align}$$

Assembly and Separation of Collision Classes

Proof of Theorem 1

Pairwise Separation Versus Linear Independence

Let $$V_g = \operatorname{span}_{\mathbb C} \{\Theta_N^{(g)}:N\in\mathcal N_{24}\} \subset M_{12}(\operatorname{Sp}_{2g}(\mathbb Z))$$ and write $$d(g)=\dim_{\mathbb C}V_g.$$

Borcherds, Freitag, and Weissauer proved that the $24$ Niemeier theta series are linearly dependent for $g\leq11$ and linearly independent in degree $12$. Thus $$d(12)=24.$$

Their work also produces a cusp form of degree $12$ and weight $12$ as an appropriate linear combination of the Niemeier theta series.

The structural hierarchy is therefore: $$\boxed{ \begin{aligned} g=1 &: \quad d(1)=2, \quad \Theta_N^{(1)} \text{ depends linearly on }h, \\[1mm] g=2 &: \quad d(2)=3, \quad \Theta_N^{(2)} \text{ depends quadratically on }h, \\[1mm] g=3 &: \quad d(3)=4, \quad \Theta_N^{(3)} \text{ depends cubically on }h, \\[1mm] g=4 &: \quad \textbf{Pairwise separation by }a(I_4), \\[1mm] 5\leq g\leq11 &: \quad d(g)<24, \\[1mm] g=12 &: \quad \textbf{Full linear independence: }d(12)=24. \end{aligned} }$$

It is important to distinguish the genus-four separation result from linear independence. Pairwise distinct theta series can remain highly linearly dependent. In particular, the genus-four result does not contradict the BFW theorem.

Complete Genus-Four Spectrum

The preceding proof only requires the five equal-Coxeter-number collision classes. As a computational corollary, however, the same frame-assembly formula can be evaluated for every Niemeier root system.

The resulting $a(I_4)$-values are pairwise distinct across all $24$ Niemeier lattices.

Computational Verification Script

The following self-contained Python script performs two independent checks. First, it constructs selected ADE root systems explicitly and counts orthogonal frames geometrically. Second, it evaluates the symbolic frame-generating functions and verifies the five Coxeter-number collision classes and the complete $24$-lattice spectrum.

import itertools
import numpy as np
import sympy as sp

# ==============================================================================
# ROUTE 1: PURE GEOMETRIC ROOT SYSTEM GENERATION & FRAME COUNTING
# ==============================================================================

def build_Dn_roots(n):
    roots = []
    for i in range(n):
        for j in range(i + 1, n):
            for s1 in [1.0, -1.0]:
                for s2 in [1.0, -1.0]:
                    v = np.zeros(n)
                    v[i], v[j] = s1, s2
                    roots.append(v)
    return np.array(roots)


def build_E8_roots():
    roots = []

    # Roots of the form +/-e_i +/-e_j
    for i in range(8):
        for j in range(i + 1, 8):
            for s1 in [1.0, -1.0]:
                for s2 in [1.0, -1.0]:
                    v = np.zeros(8)
                    v[i], v[j] = s1, s2
                    roots.append(v)

    # Half-integral roots with an even number of minus signs
    for s in itertools.product([0.5, -0.5], repeat=8):
        if sum(1 for x in s if x < 0) % 2 == 0:
            roots.append(np.array(s))

    return np.array(roots)


def geometric_k_frame_counts(roots, max_k=4):
    N = len(roots)
    G = np.round(roots @ roots.T, 4)

    # adj[i] = roots orthogonal to roots[i]
    adj = [
        np.where(np.abs(G[i]) < 1e-4)[0]
        for i in range(N)
    ]

    counts = {1: N}

    if max_k >= 2:
        counts[2] = sum(len(adj[i]) for i in range(N))

    if max_k >= 3:
        c3 = 0
        for i in range(N):
            for j in adj[i]:
                c3 += len(
                    np.intersect1d(
                        adj[i],
                        adj[j],
                        assume_unique=True
                    )
                )
        counts[3] = c3

    if max_k >= 4:
        c4 = 0
        for i in range(N):
            for j in adj[i]:
                c_ij = np.intersect1d(
                    adj[i],
                    adj[j],
                    assume_unique=True
                )
                for m in c_ij:
                    c4 += len(
                        np.intersect1d(
                            c_ij,
                            adj[m],
                            assume_unique=True
                        )
                    )
        counts[4] = c4

    return counts


# Geometric checks for D_4 and D_5
d4_geo = geometric_k_frame_counts(build_Dn_roots(4))
assert d4_geo == {
    1: 24,
    2: 144,
    3: 576,
    4: 1152
}

d5_geo = geometric_k_frame_counts(build_Dn_roots(5))
assert d5_geo == {
    1: 40,
    2: 560,
    3: 2880,
    4: 5760
}


# Geometric checks for E_8
e8_roots = build_E8_roots()

e8_geo = geometric_k_frame_counts(e8_roots)

assert e8_geo == {
    1: 240,
    2: 30240,
    3: 1814400,
    4: 47174400
}


# Obtain E_7 as the roots of E_8 orthogonal to a root
r0 = np.array([1.0, 1.0, 0, 0, 0, 0, 0, 0])

e7_roots = e8_roots[
    np.abs(e8_roots @ r0) < 1e-4
]

e7_geo = geometric_k_frame_counts(e7_roots)

assert e7_geo == {
    1: 126,
    2: 7560,
    3: 196560,
    4: 1814400
}


# ==============================================================================
# ROUTE 2: SYMBOLIC FRAME GENERATING FUNCTIONS
# ==============================================================================

t = sp.Symbol('t')


def fall(n, m):
    return sp.prod(
        [n - j for j in range(m)]
    )


def F_A(n):
    return sum(
        fall(n + 1, 2 * k)
        // sp.factorial(k)
        * t**k
        for k in range(
            min(5, (n + 1) // 2 + 1)
        )
    )


def F_D(n):
    return (
        1
        + 2 * fall(n, 2) * t
        + (
            2 * fall(n, 2)
            + 2 * fall(n, 4)
        ) * t**2
        + (
            4 * fall(n, 4)
            + sp.Rational(4, 3) * fall(n, 6)
        ) * t**3
        + (
            2 * fall(n, 4)
            + 4 * fall(n, 6)
            + sp.Rational(2, 3) * fall(n, 8)
        ) * t**4
    )


# Verify symbolic D_n formula against geometric counts
for n in [4, 5]:
    poly = F_D(n)
    geo = geometric_k_frame_counts(
        build_Dn_roots(n)
    )

    for k in range(1, 5):
        assert int(
            sp.factorial(k) * poly.coeff(t, k)
        ) == geo[k]


polys = {
    'A1': F_A(1),
    'A2': F_A(2),
    'A3': F_A(3),
    'A4': F_A(4),
    'A5': F_A(5),
    'A6': F_A(6),
    'A7': F_A(7),
    'A8': F_A(8),
    'A9': F_A(9),
    'A11': F_A(11),
    'A12': F_A(12),
    'A15': F_A(15),
    'A17': F_A(17),
    'A24': F_A(24),

    'D4': F_D(4),
    'D5': F_D(5),
    'D6': F_D(6),
    'D7': F_D(7),
    'D8': F_D(8),
    'D9': F_D(9),
    'D10': F_D(10),
    'D12': F_D(12),
    'D16': F_D(16),
    'D24': F_D(24),

    'E6':
        1
        + 72*t
        + 1080*t**2
        + 4320*t**3
        + 2160*t**4,

    'E7':
        1
        + 126*t
        + 3780*t**2
        + 32760*t**3
        + 75600*t**4,

    'E8':
        1
        + 240*t
        + 15120*t**2
        + 302400*t**3
        + 1965600*t**4
}


def a_I4(comps):
    if not comps:
        return 0

    P = sp.prod(
        [polys[c]**m for c, m in comps]
    )

    return int(
        24 * P.expand().coeff(t, 4)
    )


# ==============================================================================
# COLLISION-CLASS VERIFICATION
# ==============================================================================

collisions = [
    (
        6,
        "A5^4 D4",
        [('A5', 4), ('D4', 1)],
        "D4^6",
        [('D4', 6)]
    ),
    (
        10,
        "A9^2 D6",
        [('A9', 2), ('D6', 1)],
        "D6^4",
        [('D6', 4)]
    ),
    (
        12,
        "A11 D7 E6",
        [('A11', 1), ('D7', 1), ('E6', 1)],
        "E6^4",
        [('E6', 4)]
    ),
    (
        18,
        "A17 E7",
        [('A17', 1), ('E7', 1)],
        "D10 E7^2",
        [('D10', 1), ('E7', 2)]
    ),
    (
        30,
        "D16 E8",
        [('D16', 1), ('E8', 1)],
        "E8^3",
        [('E8', 3)]
    ),
]


for h, n1, c1, n2, c2 in collisions:
    v1 = a_I4(c1)
    v2 = a_I4(c2)

    assert v2 > v1, (
        f"Separation failed at h={h}"
    )


# ==============================================================================
# COMPLETE 24-LATTICE INJECTIVITY CHECK
# ==============================================================================

all_24 = [
    ("Leech", []),

    ("A1^24",
     [('A1', 24)]),

    ("A2^12",
     [('A2', 12)]),

    ("A3^8",
     [('A3', 8)]),

    ("A4^6",
     [('A4', 6)]),

    ("A5^4 D4",
     [('A5', 4), ('D4', 1)]),

    ("D4^6",
     [('D4', 6)]),

    ("A6^4",
     [('A6', 4)]),

    ("A7^2 D5^2",
     [('A7', 2), ('D5', 2)]),

    ("A8^3",
     [('A8', 3)]),

    ("A9^2 D6",
     [('A9', 2), ('D6', 1)]),

    ("D6^4",
     [('D6', 4)]),

    ("A11 D7 E6",
     [('A11', 1), ('D7', 1), ('E6', 1)]),

    ("E6^4",
     [('E6', 4)]),

    ("A12^2",
     [('A12', 2)]),

    ("D8^3",
     [('D8', 3)]),

    ("A15 D9",
     [('A15', 1), ('D9', 1)]),

    ("A17 E7",
     [('A17', 1), ('E7', 1)]),

    ("D10 E7^2",
     [('D10', 1), ('E7', 2)]),

    ("D12^2",
     [('D12', 2)]),

    ("A24",
     [('A24', 1)]),

    ("D16 E8",
     [('D16', 1), ('E8', 1)]),

    ("E8^3",
     [('E8', 3)]),

    ("D24",
     [('D24', 1)])
]


spectrum = [
    a_I4(comps)
    for name, comps in all_24
]

assert len(spectrum) == 24

assert len(set(spectrum)) == 24, (
    "Spectrum values are not all distinct"
)


print(
    "All geometric checks, collision separations, "
    "and 24-spectrum verifications passed."
)

# ============================================================

References