Matrix bordering structure of the Faddeev-Jackiw algorithm: Schur complement regularization and symbolic automation.
BorderedFJReduction is a symbolic computational engine that formalizes the Faddeev–Jackiw (FJ) reduction as a geometrically constrained instance of the Matrix Bordering Technique (MBT).
Unlike traditional procedural implementations, this package employs Schur complement regularization to handle the singular pre-symplectic matrix, establishing a direct algebraic isomorphism with the Poisson bracket algebra of the system's constraints.
Project status: The theoretical formulation and software architecture correspond to the article "Matrix bordering structure of the Faddeev-Jackiw algorithm: Schur complement regularization and symbolic automation" (2026), available at arXiv:2602.12114. The package is designed for analytical work on singular Lagrangians, emphasizing explicit constraint propagation and rank diagnostics via the Schur complement.
Conceptual flow of the bordered Faddeev–Jackiw reduction, highlighting constraint propagation, rank diagnostics, and gauge symmetry detection.
BorderedFJReduction is a Wolfram Language paclet that provides a fully symbolic implementation of the Faddeev–Jackiw (FJ) reduction for singular Lagrangian systems.
The core contribution of this project is the realization that the FJ iterative extension of phase space is not a heuristic procedure, but a geometrically constrained instance of the Matrix Bordering Technique (MBT). This insight enables a deterministic, transparent, and automatable reduction process, preserving full parametric dependence throughout the computation.
The engine returns an opaque symbolic object encapsulating the complete symplectic hierarchy, while exposing its internal structure through a controlled, queryable interface.
The engine is built upon the proof that each iteration of the Barcelos-Neto-Wotzasek algorithm generates an extended matrix whose non-degeneracy is governed by the Schur complement. The package automates:
- Isomorphism Identification: Links the invertibility of the extended matrix directly to the second-class structure of the constraints.
- Symbolic Regularization: Implements matrix bordering to resolve phase-space singularities without manual intervention.
- Gauge Diagnostics: Automatically detects first-class constraints and redundancies within the symmetry algebra.
The workflow replaces the manual iterative process with an algebraic evaluation of the bordering structure, ensuring the algorithm terminates if and only if the system is second-class.
- Fully symbolic implementation of the Faddeev–Jackiw reduction
- Theorem-driven formulation based on the Matrix Bordering Technique (not a procedural algorithm)
- Automatic detection and classification of:
- Regular symplectic manifolds
- Constraint hierarchies generated by consistency conditions
- Gauge symmetries, including null and linearly dependent constraints
- Schur complement–based regularization of singular pre-symplectic matrices
- Exact preservation of parametric dependence throughout the reduction process (essential for bifurcation, stability, and structural analysis)
- Structured symbolic output encapsulated in a Wolfram
SummaryBox - Opaque but fully queryable association-based interface for downstream analysis
- Direct access to:
- Extended symplectic matrices
- Generalized symplectic brackets
- Constraint algebra and iteration metadata
- Publication-ready visualization of generalized symplectic structures
The reduction process is internally organized as a causal graph of symbolic states, rather than a linear algorithm. Each iteration corresponds to a bordered extension of the symplectic 2-form until regularity or gauge redundancy is detected.
This mirrors the interpretation developed in the accompanying manuscript:
The Faddeev–Jackiw procedure is a geometrically constrained matrix bordering process acting on symbolic symplectic data.
- 🔧 Minimum Requirements
- 🚀 Installation
- 🧪 Basic Usage
- 🧩 API Summary
- 🧭 Gauge Symmetry Detection
- 📚 Scientific Context and Related Work
- 📝 Editorial Status
- 👥 Authors
- 🔮 Future Directions
- 🙏 Acknowledgements
- 📄 License
- 📌 Citation and DOI
- 📋 Development
- Wolfram Language / Mathematica 13.0 or later
- Wolfram Workbench (Eclipse-based IDE) — optional but recommended
- Tested on Windows, macOS, and Linux
PacletInstall[
"https://github.com/echanlopez/BorderedFJReduction/releases/download/v0.1.2/BorderedFJReduction-0.1.2.paclet",
ForceVersionInstall -> True
]Then load the package:
Needs["BorderedFJReduction`"]PacletInstall["/path/to/BorderedFJReduction-0.1.2.paclet"]Note: Release v0.1.2 supersedes earlier archived versions and corrects a paclet packaging issue (context isolation and symbol leakage), without modifying the underlying algorithm or mathematical formulation.
A minimal invocation returns a structured symbolic object summarizing the regularization status, constraint geometry, and phase-space extension of the system.
Example shown below: Faddeev–Jackiw reduction of the Singular Lagrangian with noncanonical kinetics (details omitted for clarity; see the Examples/ folder for the full definition).
Needs["BorderedFJReduction`"]The following animation illustrates only the final symbolic structured output for a typical reduction.
🔎 Technical notes
-
Input/Output shown: The animation displays the complete Lagrangian specification alongside the reduction's structured summary.
-
Parametric preservation: Physical parameters (e.g., masses, spring constants, coupling terms) remain symbolic throughout the computation, enabling sensitivity analysis and parametric bifurcation studies without re-execution.
-
Design philosophy: The output prioritizes diagnostic information (rank, iteration count, regularity status) over raw symbolic expressions, consistent with the package's emphasis on geometric structure rather than algebraic manipulation.
In practice, the output of BorderedFJMatrix is typically assigned to a symbolic
object. This allows direct programmatic access to the internal structures generated
by the reduction, such as constraints, extended symplectic matrices, and iteration
metadata.
bfj = BorderedFJMatrix[kineticEnergy, symplecticPotential, vars];The returned object supports the following query interface:
bfj["Constraints"]
bfj["ExtendedMatrix"]
bfj["ExtendedOneForm"]
bfj["ExtendedSymplecticVariables"]
bfj["InverseExtendedMatrix"]
bfj["IterationCount"]
bfj["MatrixStatus"]To visualize the generalized symplectic brackets in a structured, publication-ready format:
FJSymplecticFrame[bfj]
Note: The visualization shows the extended symplectic structure with publication-ready formatting, including the inverse matrix (generalized brackets) and diagnostic information.
The object returned by BorderedFJMatrix is intentionally opaque but fully queryable:
"Constraints"— generated constraint functions"ExtendedMatrix"— final bordered symplectic matrix"ExtendedOneForm"— extended canonical one-form"ExtendedSymplecticVariables"— phase-space variables"InverseExtendedMatrix"— generalized symplectic brackets"IterationCount"— number of FJ iterations required for regularization"MatrixStatus"—"Regular"or"Singular"
If the reduction fails to reach a regular symplectic manifold, the engine automatically diagnoses gauge redundancy:
-
Null constraints (identically zero)
-
Dependent constraints (no further restriction of phase space)
In such cases, the final pre-symplectic matrix and its null vectors are preserved, providing direct access to the generators of gauge transformations.
The theoretical foundation of this package is rooted in the geometric formulation of constrained dynamics introduced by Faddeev and Jackiw, which recasts singular Lagrangian systems in terms of pre-symplectic structures rather than hierarchical constraint classifications.
The full iterative power of the method was developed by Barcelos-Neto and Wotzasek, who established a systematic procedure for extending the phase space until either a regular symplectic manifold or a gauge symmetry is revealed.
From a linear algebra perspective, the present implementation makes explicit the connection between the Faddeev–Jackiw iteration and the Matrix Bordering Technique, a classical tool in numerical analysis and bifurcation theory for handling rank-deficient operators and structured singularities.
Recent developments in computational and algorithmic physics have emphasized the role of symbolic rewriting systems and causal structures in the formulation of physical laws. In this spirit, BorderedFJReduction treats constrained dynamics as a deterministic transformation of symbolic states, rather than as a procedural manipulation of equations.
As a result, the package complements existing symbolic approaches to constrained systems and is particularly well suited for studies where parametric dependence, bifurcation structure, and exact constraint algebra play a central role.
This package accompanies the theoretical development presented in:
Matrix bordering structure of the Faddeev-Jackiw algorithm:
Schur complement regularization and symbolic automation
The implementation has been validated on:
- Singular Lagrangian system with noncanonical kinetic structure
- Singular mechanical systems analyzed within the Dirac–Bergmann framework
- Systems exhibiting gauge symmetry
These examples illustrate how the symbolic engine bridges abstract symplectic geometry with concrete mechanical realizations.
This software is not a replacement for Dirac–Bergmann methods, but a complementary algebraic formulation.
This paclet accompanies the article:
Matrix bordering structure of the Faddeev-Jackiw algorithm:
Schur complement regularization and symbolic automation
which is currently in preparation for submission and public dissemination.
The present release provides a fully functional symbolic engine designed to:
- establish computational reproducibility,
- provide an inspectable implementation of the theoretical results,
- and Enable automated analysis of singular Lagrangians and their constraint structures.
The scientific priority and the comprehensive validation of the underlying theoretical framework are fully documented in the BorderedFJReduction_Examples.nb notebook within the Examples directory.
-
Ramón Eduardo Chan López (SECIHTI-DACB-UJAT)
-
José Alberto Martín Ruiz (ICN-UNAM, C3-UNAM)
-
Jaime Manuel Cabrera (SECIHTI-DACB-UJAT)
-
Jorge Mauricio Paulin Fuentes (DACB-UJAT)
The current engine targets finite-dimensional systems (point mechanics). However, its algebraic architecture is designed as a kernel for future extensions toward:
- Field theories
- Symbolic tensor calculus
- Infinite-dimensional constraint surfaces
- Gauge theories (Maxwell, Yang–Mills)
The long-term vision is a Tensor Faddeev–Jackiw Engine, where constraint handling emerges directly from the algebraic structure of the symplectic form.
The algebraic logic underlying matrix bordering admits operator-theoretic generalizations. In particular, Schur complements have been systematically studied for bounded and complementable operators on Hilbert spaces, providing a mathematically consistent framework for infinite-dimensional extensions under suitable analytic hypotheses.
References on Matrix Bordering and Schur Complements:
-
G. H. Golub and C. F. Van Loan, Matrix Computations, 4th ed., Johns Hopkins University Press (2013).
Chapter 3 discusses matrix bordering techniques and their applications in numerical linear algebra. -
C. Băcuţa, Schur complements on Hilbert spaces, Journal of Computational and Applied Mathematics 231 (2009).
https://www.sciencedirect.com/science/article/pii/S0377042708004305
Provides operator-theoretic generalization relevant to infinite-dimensional extensions.
The lead developer of the software would like to acknowledge Eric Rimbey for his critical feedback and rigorous code reviews during the early stages of this project.
His emphasis on immutability, explicit semantic structure, and disciplined control of symbolic state played a decisive role in shaping the final design philosophy of the engine. Several aspects of the current implementation—particularly its rule-based structure and transparent error handling—are a direct consequence of those early discussions.
Contributions of this kind, grounded in systems thinking and semantic rigor, are fundamental to the maturation of reliable scientific software, even when their impact is primarily architectural rather than directly visible in the final code.
This project is released under the MIT License.
The software is intended for academic and research use, providing a transparent and reproducible implementation of the methods described in the accompanying manuscript.
If you use this software in academic work, please cite it using the following DOIs:
- Concept DOI (all versions): https://doi.org/10.5281/zenodo.18362979
- Version-specific DOI (v0.1.2 – recommended): https://doi.org/10.5281/zenodo.18487436
If you use BorderedFJReduction in your research, please cite the accompanying work:
@article{ChanMartinBorderedFJReduction,
title = {Matrix bordering structure of the Faddeev--Jackiw algorithm:
Schur complement regularization and symbolic automation},
author = {Chan--L{\'o}pez, E. and
Mart{\'\i}n--Ruiz, A. and
Cabrera, Jaime Manuel and
Paulin Fuentes, Jorge Mauricio},
journal = {arXiv preprint},
year = {2026},
eprint = {2602.12114},
archivePrefix = {arXiv},
primaryClass = {math-ph},
note = {The Faddeev--Jackiw algorithm is formulated as a geometrically
constrained instance of the Matrix Bordering Technique.
A symbolic implementation is provided via the
\texttt{BorderedFJReduction} Wolfram Language Paclet.}
}@software{ChanLopez_BorderedFJReduction_2026,
author = {Chan--L{\'o}pez, E. and
Mart{\'\i}n--Ruiz, A. and
Cabrera, Jaime Manuel and
Paulin Fuentes, Jorge Mauricio},
title = {BorderedFJReduction: A Symbolic Engine for the Faddeev-Jackiw reduction as constrained matrix bordering},
version = {0.1.2},
year = {2026},
publisher = {Zenodo},
doi = {10.5281/zenodo.18362980},
url = {https://github.com/echanlopez/BorderedFJReduction}
}For maintainers and contributors: