🔢 mathematics

Linearization Problem for a System of Two Second-Order ODEs via Cartan's Method: Branch I

This paper investigates Branch I of Cartan's classification for linearizable systems of two second-order ODEs, establishing their eight-dimensional Lie symmetry algebra, deriving a canonical form and linearizing transformation procedure, and illustrating these results with examples.

Original authors: Batoul M. Raddad, Ahmad Y. Al-Dweik, Marwan Aloqeili, F. M. Mahomed

Published 2026-07-21

📖 7 min read🧠 Deep dive

CC BY 4.0

Original authors: Batoul M. Raddad, Ahmad Y. Al-Dweik, Marwan Aloqeili, F. M. Mahomed

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine you are a detective trying to solve a mystery, but instead of footprints or fingerprints, your clues are equations. Specifically, you are looking at a special kind of math puzzle called a "system of two second-order ordinary differential equations" (ODEs). In the real world, these equations are the secret language of motion. They describe how things change over time, like a rocket accelerating, a planet orbiting a star, or a swing moving back and forth. Usually, these equations are messy and wild, making them incredibly hard to solve.

However, mathematicians have discovered that some of these messy equations are actually "disguised" versions of simple, linear equations. It's like finding a complex, swirling galaxy that, if you look at it from the right angle, turns out to be a structured, easy-to-analyze pattern. The big question in this field is: How do we know if a messy equation is just a disguised simple one? And if it is, how do we peel back the layers to find the simple version underneath? This is called the "linearization problem." If we can solve it, we can take a terrifyingly difficult problem and turn it into something a high school student could solve with a pencil and paper.

This paper is a new chapter in that detective story. The authors, a team of mathematicians, are using a powerful, high-tech toolkit called "Cartan's method" to sort these messy equations into different categories. Think of Cartan's method as a giant, magical sorting machine that looks at the hidden "symmetry" of an equation—its shape and balance—to decide what kind of family it belongs to. The paper focuses on one specific family, which they call "Branch I." They prove that if an equation belongs to this specific branch, it has a very special property: it can be transformed into a simple, linear form. They don't just say it's possible; they provide a step-by-step recipe (a systematic procedure) to find the exact transformation needed to unlock the simple version. They also show that these special equations have a specific "fingerprint" involving eight different symmetries, which acts as a guarantee that the linearization is possible.

The Story of Branch I

To understand what the authors did, imagine you have a box of tangled headphones. Some tangles are simple loops you can undo with a quick pull. Others are knots so complex they seem impossible to fix. In the world of differential equations, the "knots" are the non-linear systems, and the "simple loops" are the linear systems. The goal is to figure out which tangled headphones can be untangled and how to do it.

The authors used Cartan's method to build a massive classification tree. This tree splits all possible two-equation systems into different branches based on their internal geometry. Most of the tree has been explored, but there were some tricky branches that were still a mystery. This paper dives deep into Branch I.

The authors found that Branch I is defined by two main clues. First, the equations must have a specific "rank-one" structure, which is a fancy way of saying their internal matrix has a very specific, slightly flattened shape. Second, two specific mathematical values, called relative invariants $K_1$ and $L_1$ , must be exactly zero. You can think of these invariants as the "weight" and "balance" of the equation. If the balance is off, it's not in this branch. If the weight is wrong, it's not in this branch. But if both are zero, and the rank is one, you've found a member of Branch I.

What they proved:
The paper demonstrates that any system of two second-order ODEs that fits these criteria (Branch I) is guaranteed to be linearizable. This means it can be transformed into a simple, linear system using a "point transformation." A point transformation is like a magic lens that changes your view of the variables (the $x$ and $u$ values) so that the messy, curved lines of the original equation become straight lines in the new view.

Furthermore, the authors proved that these systems are not just linearizable; they are "rich" in symmetry. They admit an eight-dimensional Lie point symmetry algebra. In plain English, this means the system has eight distinct ways you can shift, stretch, or rotate the variables without changing the fundamental nature of the equation. It's like a snowflake that has eight perfect axes of symmetry. The presence of exactly eight symmetries is a strong indicator that the equation is a specific type of coupled linear system in disguise. (Note: While the simplest "free particle" equations admit 15 symmetries, this specific branch admits exactly 8, distinguishing it as a unique, slightly more complex linear family).

The Canonical Form:
The authors didn't just stop at saying "it can be solved." They found the "canonical form" for this branch. This is the ultimate, simplest version of the equation that every member of Branch I can be turned into. It looks like this:
$u''_1 = u_1 + u_2$
$u''_2 = -(u_1 + u_2)$
This is the "Rosetta Stone" for Branch I. If you have a messy equation, and you can transform it into this specific form, you know you've cracked the code.

The Recipe for Transformation:
Perhaps the most practical part of the paper is the "systematic procedure" they derived. They didn't just prove it exists; they gave a recipe to find the transformation.

Check the Fingerprint: First, you calculate the "Wilczynski invariant matrix" and the relative invariants ( $K_1, L_1$ , etc.) to see if your equation belongs to Branch I.
Build the Map: If it fits, you use their specific formulas to construct a "prolonged invariant coframe." Think of this as building a custom map or a set of coordinates that aligns with the equation's hidden geometry.
Solve the Puzzle: Using this map, you solve a series of linear and Riccati partial differential equations (PDEs). These are the steps to find the exact functions $\xi$ and $\phi$ that will transform your messy equation into the clean canonical form.

Real-World Examples:
To show that this isn't just abstract theory, the authors tested their method on three different examples.

Example 1: A non-linear system involving terms like $(x + u_1)$ and powers of derivatives. They successfully calculated the transformation and showed it reduced to the canonical form.
Example 2: A system with terms like $(x^2 u'_1 - 1)$ . Again, the method worked perfectly, revealing the hidden linear structure.
Example 3: A system of geodesic equations (which describe the shortest path on a curved surface). This one was tricky because its initial matrix had zero entries. The authors showed that by applying a simple preliminary swap of variables, they could move it into the "non-zero" version of Branch I and then apply their method.

What the paper does NOT do:
It is important to note what this paper leaves out. The authors explicitly state that they are focusing only on Branch I. They mention that there are other branches (like Branch II, where $K_1 = 0$ but $L_1 \neq 0$ ) that they will investigate in future papers. They do not claim to have solved the linearization problem for every possible system of two second-order ODEs; they have only solved it for this specific, well-defined family. They also do not provide a solution for systems that do not have eight symmetries or do not fit the rank-one criteria.

The Bottom Line:
This paper is a significant step forward in the quest to tame complex differential equations. By using Cartan's method to isolate a specific branch of equations, the authors have provided a definitive "yes/no" test for linearizability and a clear, step-by-step guide on how to perform the transformation. They have turned a vague possibility into a concrete algorithm. For anyone dealing with systems of two second-order ODEs, this work offers a new, powerful tool: if your equation fits the Branch I criteria, you now know exactly how to strip away the complexity and reveal the simple, linear heart underneath. The mystery of Branch I is solved, and the path to the solution is clearly marked.

Technical Summary: Linearization Problem for a System of Two Second-Order ODEs via Cartan's Method: Branch I

Problem Statement
The paper addresses the linearization problem for systems of two second-order ordinary differential equations (ODEs) under invertible point transformations. Specifically, it investigates the conditions under which a nonlinear system can be transformed into a linear system, and further, into a canonical form. While the linearization problem for systems admitting the maximal number of symmetries (15) or the free particle case (rank-zero generalized Wilczynski invariant matrix) is well-established, the classification of linearizable systems with intermediate symmetry dimensions (specifically 5, 6, 7, and 8) remains largely unresolved. This work focuses on Branch I of the classification tree, characterized by a rank-one generalized Wilczynski invariant matrix and the vanishing of two specific relative invariants, $K_1$ and $L_1$ .

Methodology
The authors employ Cartan's equivalence method to analyze the geometric structure of the system. The methodology proceeds through the following steps:

Adapted Coframe Construction: The system is lifted to the first jet space $J^1(\mathbb{R}, \mathbb{R}^2)$ , and an adapted coframe is constructed using the generalized Wilczynski invariants.
Normalization and Absorption: The authors perform a series of normalization steps on the torsion coefficients of the structure equations. This involves absorbing torsion terms into the Maurer-Cartan forms to reduce the dimension of the structure group $G$ .
Branching via Invariants: The reduction process naturally leads to a branching classification based on the rank of the generalized Wilczynski invariant matrix $W$ and the vanishing of relative invariants. The paper isolates the branch where $\text{rank}(W) = 1$ (non-generic case) and $W \neq O$ .
Sub-branch Analysis: Within the rank-one branch, the authors further subdivide based on the vanishing of relative invariants $K_1$ and $L_1$ . They demonstrate that for the sub-branch where $K_1 = 0$ and $L_1 = 0$ , the prolonged invariant coframe achieves a rank-zero state with constant structure equations.
Symmetry and Transformation Derivation: By analyzing the resulting constant structure equations, the authors determine the dimension of the Lie symmetry algebra and derive a systematic procedure to construct the linearizing point transformation by solving a system of linear and Riccati partial differential equations (PDEs).

Key Contributions and Results

Canonical Form: The paper establishes that any linearizable system in Branch I (rank-one $W$ , $K_1=0$ , $L_1=0$ ) is equivalent to the specific canonical form:
$u''_1 = u_1 + u_2, \quad u''_2 = -(u_1 + u_2)$
This system admits an eight-dimensional Lie point symmetry algebra.
Necessary and Sufficient Conditions: The authors provide a complete set of necessary and sufficient conditions for a system to belong to this branch. These conditions are expressed as the vanishing of a specific set of relative invariants ( $K_1, K_2, K_3-2K_5, K_6, K_8+4K_4K_5$ ) and the satisfaction of constant structure equations for the associated invariant coframe.
Symmetry Characterization: It is proven that systems in this branch admit exactly eight point symmetries. The paper explicitly lists the basis vector fields for this symmetry algebra.
Algorithm for Linearization: A constructive algorithm (Proposition 5.1) is derived to find the explicit point transformation $\Phi: (\bar{x}, \bar{u}_1, \bar{u}_2) = (\xi(x, u), \phi_1(x, u), \phi_2(x, u))$ that maps a given nonlinear system to the canonical form. This involves solving for auxiliary functions $a_1, a_3, a_{15}$ and subsequently integrating the transformation equations.
Illustrative Examples: The theoretical results are validated through three distinct examples, including nonlinear systems with cubic first-derivative terms and geodesic equations. In each case, the method successfully identifies the system as belonging to Branch I and constructs the explicit linearizing transformation.

Significance and Claims
The paper claims to address a gap identified by Mahomed and Qadir regarding the linearization criteria for symmetry algebras other than the minimal (2n+1) and maximal (n²+4n+3) dimensions. By providing a complete Cartan equivalence analysis for Branch I, the authors offer:

A rigorous geometric characterization of a class of linearizable systems that had not been systematically characterized within a complete Cartan framework.
A systematic procedure for constructing linearizing maps for systems admitting eight symmetries, moving beyond abstract existence proofs to explicit construction.
A foundation for a broader classification program. The authors note that this work is the first in a series of manuscripts intended to cover the remaining branches of the classification tree (e.g., Branch II where $K_1=0, L_1 \neq 0$ ), collectively aiming to solve the linearization problem for all symmetry algebras of two second-order ODEs.

The work emphasizes that while the rank-zero case (free particle equations) is well-known, the intermediate rank-one cases with specific invariant vanishing conditions represent distinct geometric classes requiring separate analysis, which this paper provides for the first time.

The Story of Branch I

More like this