Leibniz Algebra Automorphism Groups

ISEF Category: Mathematics

Subcategory: Algebra  ·  Difficulty: Advanced  ·  Setup: University Lab  ·  Time: Full Year

The Hook

A tiny change in an algebra can completely reshape its symmetries. That is the core idea behind automorphism groups, the maps that preserve structure while moving pieces around. If you can classify those symmetries, you can spot hidden patterns that most people never notice.

What Is It?

A Leibniz algebra is like a cousin of a Lie algebra. Both study how elements interact through a bracket operation, which is a rule that combines two inputs into a third. In Lie algebras, swapping the inputs flips the sign. In Leibniz algebras, that rule does not have to hold, so the structure is looser and often harder to classify.

An automorphism is a symmetry of the algebra. Think of a jigsaw puzzle where you can move pieces around, but the finished picture still looks the same. The automorphism group is the full set of those allowed moves. Your project asks which symmetries appear for small Leibniz algebras over a finite field F_p, where p is a prime like 2, 3, 5, or 7. The finite field keeps the arithmetic manageable and makes the classification precise.

The "nilpotent-cyclic" sub-family adds a sharper target. Nilpotent means repeated bracket operations eventually collapse to zero, and cyclic suggests the algebra can be generated from one element or one chain-like pattern. If you can prove a structure theorem for that family, you are not just listing examples. You are explaining why the family behaves the way it does.

Why This Is a Good Topic

This is a strong science fair topic because every part of it is testable. You can generate small examples, compute automorphism groups, compare patterns across dimensions and primes, and look for a theorem that explains the data. The project connects to symmetry, classification, and finite algebra, which are real research themes in modern mathematics. A student can learn how to read definitions, build examples, write code, and turn output into a clean mathematical story.

Research Questions

• How does the automorphism group change as the dimension of a Leibniz algebra increases from 1 to 5?
• What is the effect of changing the prime p on the size and structure of the automorphism group?
• Does the nilpotent-cyclic sub-family have a predictable automorphism pattern across all small dimensions?
• To what extent do different bracket tables with the same dimension produce non-isomorphic automorphism groups?
• Which invariants best separate Leibniz algebras with similar-looking automorphism data?
• How does the number of generators relate to the complexity of the automorphism group?
• What is the effect of imposing nilpotency on the frequency of large symmetry groups?

Basic Materials

• Laptop or desktop computer with enough memory to run Python and GAP.
• Python installed with a code editor such as VS Code or Jupyter Notebook.
• GAP system for group and algebra computations.
• Spreadsheet software for tracking algebra examples and results.
• Notebook for writing definitions, test cases, and conjectures.
• External storage or cloud backup for code and output files.

Advanced Materials

• Laptop or desktop computer with Python, GAP, and package support for algebra computation.
• Access to SageMath if you want to cross-check symbolic results.
• A LaTeX editor for writing theorem statements and proofs.
• Version control software such as Git for managing code revisions.
• Shared computing access, if your search space becomes large.
• Research notes organized by isomorphism class, dimension, and prime.

Software & Tools

• Python: Organizes the pipeline that builds examples, filters cases, and formats outputs for analysis.
• GAP: Computes algebraic structure data and automorphism groups for finite objects.
• SageMath: Helps cross-check algebra and group calculations in a single environment.
• Jupyter Notebook: Lets you document experiments, code, and observations in one place.
• ImageJ: Not needed for this topic, so skip it unless you create visual summaries from diagrams.

Experiment Steps

1. Define the exact family of Leibniz algebras you will study, including your limits on dimension and prime field size.
2. Choose one canonical way to encode each algebra, so equivalent examples can be compared without confusion.
3. Build a small script that generates candidate brackets and filters out duplicate isomorphism classes.
4. Plan how you will compute each automorphism group and record the group invariants you care about.
5. Decide which patterns count as a conjecture and which ones are just one-off examples.
6. Test whether the nilpotent-cyclic family follows a clean rule, then write that rule in theorem form if the data supports it.

Common Pitfalls

• Mixing up isomorphic algebras with different-looking tables, which makes the classification list count the same object twice.
• Using inconsistent basis orderings, which changes the bracket table and breaks comparisons across cases.
• Treating a computational output as a theorem without checking a proof, which weakens the math story.
• Searching too many algebras at once, which makes the project harder to debug and slows pattern finding.
• Recording automorphism group data without naming the invariant, which makes it hard to compare results later.

What Makes This Competitive

A competitive version of this project does more than dump computed examples. You would need a clean classification method, careful proof checks, and a reason your chosen family matters beyond the sample list. Strong projects also compare several invariants, not just group size, and explain why one pattern survives across primes. If your theorem for the nilpotent-cyclic family matches the computations and tightens a known gap, the project feels like real research.

Project Variations

• Study only nilpotent Leibniz algebras and compare how their automorphism groups differ from the full small-dimension family.
• Replace prime fields with a fixed finite field family and test whether the symmetry patterns stay stable across p.
• Focus on one invariant, such as group order or fixed-point structure, and use it to classify the algebras instead of listing every automorphism group.

Learn More

• GAP Manual: The official documentation explains finite group and algebra computations, and you can find it through the GAP website.
• MIT OpenCourseWare Algebra: Search MIT OpenCourseWare for abstract algebra and linear algebra notes that help with finite structures and symmetries.
• Bulletin of the American Mathematical Society: Search the journal site or your library portal for survey articles on algebra classification and symmetry.
• arXiv: Search for papers on Leibniz algebras, automorphism groups, and nilpotent Lie analogues to see current methods.
• MathWorld: Look up entries on automorphism groups, nilpotent algebras, and related algebra terms for quick definitions.
• PubMed: Not useful for this topic, so skip it and stay with algebra sources.