Order-3 pi-formulas, Apery-like kernels, and Clausen functoriality for Conservative Matrix Fields

This paper unifies order-3 $\pi$-formulas and Apery-like kernels within a rank-2 Conservative Matrix Field framework by proving they arise as shifted lifts of explicit order-2 kernels derived from Gauss-square coefficients and Domb numbers, while establishing a $\operatorname{Sym}^2$ functoriality that classifies these structures and generates 11 new integer sequences via Belyi pullbacks.

The Gist

Imagine you are trying to bake the perfect cake to represent the number $\pi$ (the ratio of a circle's circumference to its diameter). Mathematicians have been baking these "pi-cakes" for centuries, using recipes that involve adding up long lists of numbers.

Recently, a group of researchers (Raz, Shalyt, et al.) built a giant, automated kitchen robot. This robot scanned thousands of recipes, organized them, and found that many of the most complex, high-level recipes (called "Order-3") seemed to be unique and special. They couldn't be broken down into simpler parts.

Alex Shvets, the author of this paper, walked into that kitchen, looked at the robot's three most famous "Order-3" recipes, and said: "Wait a minute. These aren't new, complicated cakes. They are actually just simple, two-step cakes that someone accidentally added an extra 'mixing' step to."

Here is the breakdown of what this paper does, using simple analogies:

1. The "Hidden Simplicity" (The Summation Lift)

The robot found three complex recipes (two for $\pi$, one for a number called Catalan's constant). Shvets proved that if you look closely at the ingredients, these complex recipes are just simple recipes with an extra layer of "summing" on top.

• The Analogy: Imagine a simple recipe: "Mix flour and sugar." That's an Order-2 recipe.
• The robot found a recipe that said: "Mix flour and sugar, then add up the total weight of every bowl you've ever made." That's an Order-3 recipe.
• Shvets showed that the "Order-3" part is just the "Order-2" part plus a simple addition step. He stripped away the extra layer to reveal the simple, elegant core underneath.

2. The "Secret Identities" (The Kernels)

Once Shvets peeled back the extra layer, he looked at the core ingredients (the "kernels") and realized they were famous characters in disguise.

• Recipe #1 ($\pi$): This turned out to be a famous sequence of numbers known as A036917. It's like finding out your neighbor is actually a retired Olympic swimmer.
• Recipe #2 ($\pi$): This was the Domb Numbers (A002895). These are numbers that appear in physics and crystal structures.
• Recipe #3 (Catalan's Constant): This was a special variation of the Gauss Square numbers.

Shvets didn't just name them; he showed exactly how they were related to a giant mathematical machine called a Conservative Matrix Field (CMF). Think of the CMF as a universal translator or a master blueprint that connects different mathematical worlds. He proved that all three of these "disguised" recipes come from the same master blueprint, just viewed through different lenses.

3. The "Magic Mirror" (Symmetric Squares)

The paper introduces a concept called Symmetric Squares.

• The Analogy: Imagine you have a simple mirror (a Rank-2 object). If you look at your reflection, you see one image.
• Now, imagine you take that mirror and create a "square" of mirrors. Suddenly, you aren't just seeing one reflection; you are seeing a complex pattern of reflections interacting with each other.
• Shvets proved that the complex "Order-3" recipes are actually just the result of taking a simple "Order-2" mirror and looking at its "square reflection." He even wrote down the exact mathematical "glasses" (matrices) needed to switch between seeing the simple mirror and the complex square.

4. The "Portal" (Belyi Pullbacks)

For the Domb Numbers (Recipe #2), the connection wasn't direct. They didn't come from the standard mirror setup.

• The Analogy: Imagine the standard mirror is in a room in New York. The Domb Numbers are in a room in Tokyo. How do they connect?
• Shvets found a magic portal (called a Belyi map). This portal twists and stretches the New York room so perfectly that when you step through it, you land exactly in the Tokyo room.
• He proved that if you take the standard recipe, twist it through this specific portal, and then square it, you get the Domb Numbers. This unified the "strange" Domb recipe with the standard ones.

5. The "Bonus Round" (The Scan)

After solving the mystery of the three main recipes, Shvets didn't stop. He took his "magic portal" and "mirror" tools and scanned 5,040 different combinations of parameters.

• The Result: He found 11 new integer sequences (new lists of numbers) that had never been seen before.
• He proved these new lists are all "integers" (whole numbers, no fractions) and that they all follow the same rules as the original three. It's like finding 11 new species of birds that all belong to the same family as the ones you already knew.

Why Does This Matter?

In the past, mathematicians might have treated these complex $\pi$ formulas as isolated, mysterious islands. Shvets built a bridge between them.

1. Unification: He showed that what looked like three different, complicated problems are actually just three variations of the same simple idea.
2. Prediction: By understanding the "master blueprint" (the CMF), we can now predict where other similar formulas might hide.
3. Simplicity: He reminded us that even the most complex mathematical structures often have a simple, elegant core if you know how to look for it.

In short: The paper takes three confusing, high-level math recipes, peels off the extra layers to reveal they are just simple, famous recipes in disguise, and then uses a universal translator to show how they all fit into one beautiful, unified mathematical family.

Technical Summary

1. Problem Statement

Recent work by Raz et al. [14] established a framework for organizing formulas for mathematical constants (specifically $\pi$) using Conservative Matrix Fields (CMFs). Their analysis of 385 validated $\pi$-formulas produced 153 canonical polynomial recurrences: 149 of order 2 and 4 of order 3. While the order-2 formulas fit neatly into a rank-2 CMF geometry, the existence of order-3 recurrences raised a structural question: Are these order-3 objects fundamentally distinct from rank-2 CMF geometry, or can they be decomposed into lower-order kernels combined with external operations (like summation)?

The paper specifically targets the three explicit order-3 recurrences printed in the public Appendix B.6 of Raz et al. (two for $\pi$, one for Catalan's constant) to determine their structural origin and relationship to known Apéry-like sequences and hypergeometric theory.

2. Methodology

The author employs a multi-faceted approach combining Ore algebra, Conservative Matrix Field (CMF) theory, and hypergeometric function theory:

• Summation Decomposition: The paper utilizes a standard algebraic criterion (Lemma 3.1) in the Ore algebra $\mathbb{Q}[n]\langle S \rangle$. It proves that an order-3 recurrence operator $L_3$ is a "shifted summation lift" of an order-2 kernel $L_2$ if and only if the sum of the coefficients of $L_3$ vanishes. This allows the factorization $L_3 \propto \sigma(L_2(S-1))$.
• Kernel Identification: Once decomposed, the resulting order-2 kernels are identified by matching them against known sporadic Apéry-like sequences (OEIS A036917, A002895) and hypergeometric coefficient sequences.
• CMF Functoriality: The paper develops a Symmetric Square ($Sym_2$) framework. It constructs explicit gauge transformations between the CMF of a Gauss hypergeometric function $f = {}_2F_1$ and the CMF of its square $g = f^2$.
• Pullback-Twist Transport: A general theorem is formulated showing how CMFs behave under rational pullbacks (composing with a map $\phi$) and algebraic twists (multiplying by a scalar function $\rho$).
• Inverse Classification: The author solves an inverse problem: given a Riemann scheme of $Sym_2$-type, they derive a closed-form condition on the accessory parameter $\lambda$ that uniquely identifies the operator as the symmetric square of a Gauss equation.
• Computational Scan: A systematic scan of 5,040 parameter configurations involving Belyi maps and ${}_2F_1$ squares was performed to find new integer sequences.

3. Key Contributions and Results

A. Decomposition of Order-3 Recurrences

The paper proves that all three explicit order-3 recurrences from Raz et al. are shifted summation lifts of order-2 kernels.

• First $\pi$-kernel: Identified as a rescaling of the sporadic Apéry-like sequence A036917.
• Second $\pi$-kernel: Identified as a rescaling of the Domb numbers (A002895).
• Catalan kernel: Identified as a hypergeometric twist of the coefficient sequence of ${}_2F_1(1/2, 1; 3/2; z)^2$.

B. Unified $Sym_2$ Framework

The author places these kernels into a unified geometric framework:

1. Direct $Sym_2$ Specialization: The first $\pi$-kernel and the Catalan kernel arise directly from the symmetric square of Gauss hypergeometric functions at specific parameters, without nonlinear pullbacks.
2. Belyi Pullback for Domb: The Domb kernel (A002895) is not a direct square of a ${}_2F_1$ in the same variable. Instead, it is recovered by applying a degree-3 Belyi pullback $\phi(x) = \frac{108x^2}{(1-4x)^3}$ and an algebraic twist to the Gauss function ${}_2F_1(1/6, 1/3; 1; z)$.
3. Functoriality Theorem: Theorem 4.14 establishes that the operation of "pullback + twist" commutes with the $Sym_2$ functor, providing a rigorous mechanism to transport CMF structures from the Gauss world to the Domb world.

C. Explicit Gauge and Differential Relations

• Square-Gauge Matrix: An explicit rational matrix $\Phi$ is computed that relates the basis of the square of a Gauss function to the basis of the function itself, establishing the gauge equivalence between the Gauss CMF and the $Sym_2$ CMF.
• Inverse Classification: Theorem 4.11 provides a necessary and sufficient condition for a third-order Fuchsian operator to be a symmetric square of a second-order Gauss operator. The condition is a closed-form equation on the accessory parameter: $\lambda_0 = 2\gamma_1\gamma_2(1-2\alpha)$. This allows one to "reverse engineer" the underlying Gauss parameters $(a,b,c)$ from the recurrence.

D. Discovery of New Integer Sequences

A scan of 5,040 configurations yielded 11 additional integer sequences of the form $[x^n]\lambda^n {}_2F_1(a,b;c;\phi(x))^2$.

• Integrality: Theorem 5.1 proves that the coefficients of these 11 sequences are integers.
• Classification: These sequences are classified as $Sym_2$-pullbacks of rank-2 Gauss objects.
• Non-Apéry Nature: Remark 5.3 demonstrates that none of these 11 raw sequences satisfy a low-degree order-2 polynomial recurrence, distinguishing them from standard Apéry-like kernels.

4. Significance

• Structural Unification: The paper resolves the ambiguity of the "order-3" formulas. It shows they are not fundamentally new geometric objects but are derived from order-2 kernels via summation and pullback operations. This refines the understanding of the "minimal order" of formulas reported in previous literature.
• Bridging Classical and Modern: It connects classical results (Chaundy's ODE for $f^2$, Domb numbers, Belyi maps) with the modern CMF formalism, showing that these classical objects are natural trajectories or pullbacks within the CMF geometry.
• Algorithmic Insight: The inverse classification theorem offers a concrete, closed-form criterion for identifying when a third-order recurrence is a symmetric square, which is computationally more efficient than general operator-level tests.
• New Arithmetic Objects: The discovery and proof of integrality for 11 new sequences expand the known landscape of Apéry-like numbers and provide new targets for studying motives, L-functions, and supercongruences.

In summary, Shvets demonstrates that the landscape of $\pi$-formulas and Apéry-like sequences is governed by a unified $Sym_2$-pullback functoriality, where complex order-3 structures are systematically generated from rank-2 hypergeometric objects through summation, pullback, and twisting.