pith. sign in

arxiv: 2510.09277 · v3 · pith:SFOX42E2new · submitted 2025-10-10 · 🧮 math.RT

On character tables for fusion systems

Thomas Lawrence , Jason Semeraro This is my paper

Pith reviewed 2026-05-21 20:24 UTC · model grok-4.3

classification 🧮 math.RT
keywords fusion systemssaturated fusion systemscharacter tablesvirtual charactersp-groupsdeterminantscentralizersconjectures
0
0 comments X

The pith

The determinant of the character table matrix for a fusion system equals the product of centralizer orders of its fully centralised class representatives.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

This paper studies a conjecture that equates the determinant of a square matrix X built from virtual fusion-stable characters of a p-group to the product of the orders of centralizers of fully centralised class representatives in a saturated fusion system. The matrix X records the values of a basis for the lattice of such virtual characters, so its determinant squared measures the volume of that lattice. When the fusion system comes from an actual finite group, the equality recovers the usual column orthogonality relations of ordinary character theory. The authors establish the conjecture in all cases realised by groups and verify it by direct computation for every simple fusion system on a p-group of order at most p to the fourth. They outline a possible route to the remaining cases that uses algebraic properties of the characteristic idempotent associated to the fusion system.

Core claim

A character table X for a saturated fusion system F on a finite p-group S is the square matrix of values associated to a basis of the lattice of virtual F-stable ordinary characters of S. The conjecture states that the determinant of X conjugate(X), the square of the volume of this lattice, equals the product of the orders of the S-centralisers of fully F-centralised F-class representatives. This statement reduces exactly to column orthogonality for the ordinary character table of S when F equals the fusion system of S itself. The equality is proved whenever F arises from a finite group G having Sylow p-subgroup S, and it is checked for all simple fusion systems with |S| at most p to the 4.

What carries the argument

The character table X, the square matrix whose rows are the values on S of a chosen basis for the lattice of virtual F-stable ordinary characters.

If this is right

  • The equality holds for every fusion system that is realised by some finite group with the given Sylow p-subgroup.
  • The equality holds for every simple fusion system whose underlying p-group has order at most p to the fourth.
  • When the fusion system is the one generated by S itself, the equality reduces to the standard column orthogonality formula for the character table of S.
  • A general proof may be obtained by analysing the action of the characteristic idempotent of F on the lattice of virtual characters.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same volume calculation might supply an intrinsic definition of a character table for exotic fusion systems that cannot be realised by any finite group.
  • Similar determinant identities could be investigated for other algebraic objects attached to fusion systems, such as the ring of stable class functions or the cohomology ring.
  • If the conjecture is true in general, it would give a uniform way to compare the size of the stable character lattice across different fusion systems on the same p-group.

Load-bearing premise

A well-defined basis exists for the lattice of virtual F-stable ordinary characters of S so that the square matrix X can be assembled from their values.

What would settle it

Compute the lattice basis and the matrix X for a saturated fusion system on a p-group of order p to the 5 or larger, then check whether the determinant of X conjugate(X) equals the product of the stated centralizer orders.

read the original abstract

A character table $X$ for a saturated fusion system $\mathcal{F}$ on a finite $p$-group $S$ is the square matrix of values associated to a basis of the lattice of virtual $\mathcal{F}$-stable ordinary characters of $S$. We investigate a conjecture of the second author which equates the determinant of $X \overline{X}$ (the square of the volume of this lattice) with the product of the orders of $S$-centralisers of fully $\mathcal{F}$-centralised $\mathcal{F}$-class representatives. This statement is exactly column orthogonality for the character table of $S$ when $\mathcal{F}=\mathcal{F}_S(S)$. We prove the conjecture when $\mathcal{F}=\mathcal{F}_S(G)$ is realised by some finite group $G$ with Sylow $p$-subgroup $S$, and for all simple fusion systems when $|S| \le p^4$. We also put forward a potential strategy for the general case, which would exploit properties of the characteristic idempotent of $\mathcal{F}$.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

0 major / 3 minor

Summary. The paper defines a character table X for a saturated fusion system F on a finite p-group S as the square matrix whose rows are the values of a basis for the lattice of virtual F-stable ordinary characters of S. It proves the conjecture that det(X conjugate(X)) equals the product of the orders of the S-centralizers of fully F-centralized F-class representatives, first by reducing the realized case F = F_S(G) to the standard column orthogonality relations for the ordinary character table of G, and second by exhaustive enumeration and direct matrix evaluation for all simple fusion systems with |S| <= p^4. A strategy for the general case that would exploit properties of the characteristic idempotent of F is outlined but not completed.

Significance. If the conjecture holds in general it would supply a fusion-system analogue of column orthogonality, with potential consequences for the representation theory of saturated fusion systems. The manuscript supplies rigorous, non-circular proofs for the realized case (via direct appeal to group character orthogonality) and for all simple systems of order at most p^4 (via classification and explicit computation). These special-case verifications, together with the explicit description of the F-stable character lattice as the fixed submodule of Z Irr(S), constitute a solid contribution that can be built upon.

minor comments (3)
  1. [final section] The outline of the general-case strategy via the characteristic idempotent would benefit from a short paragraph indicating which known properties of the idempotent (e.g., its action on class functions or its relation to the Burnside ring) are expected to produce the required orthogonality; this would make the suggestion more concrete without expanding the paper's scope.
  2. [section on small-order cases] A brief summary table listing the simple fusion systems with |S| <= p^4 that were enumerated, together with the computed value of det(X conjugate(X)) for each, would allow readers to verify the explicit calculations at a glance.
  3. [introduction] The notation X for the character table and the use of conjugate(X) should be introduced with a single sentence in the introduction that distinguishes the matrix from ordinary complex conjugation.

Simulated Author's Rebuttal

3 responses · 0 unresolved

We thank the referee for their detailed summary of our manuscript and for recommending minor revision. The report accurately captures the main results and contributions. We provide point-by-point responses to the aspects highlighted in the referee summary below.

read point-by-point responses

  1. Referee: It proves the conjecture that det(X conjugate(X)) equals the product of the orders of the S-centralizers of fully F-centralized F-class representatives, first by reducing the realized case F = F_S(G) to the standard column orthogonality relations for the ordinary character table of G

    Authors: We confirm this description of our proof strategy for the realized case. By appealing directly to the column orthogonality relations in the character table of G, the argument avoids circularity and establishes the result for all realized fusion systems. revision: no

  2. Referee: and second by exhaustive enumeration and direct matrix evaluation for all simple fusion systems with |S| <= p^4

    Authors: For the cases of simple fusion systems with |S| <= p^4, we indeed relied on exhaustive enumeration based on the classification of such systems, followed by explicit computation of the relevant character tables and determinants to verify the conjecture. revision: no

  3. Referee: A strategy for the general case that would exploit properties of the characteristic idempotent of F is outlined but not completed.

    Authors: We agree that our discussion of the general case consists of an outline of a strategy involving the characteristic idempotent, without providing a complete proof. This is presented as a potential approach for future investigation. revision: no

Circularity Check

0 steps flagged

No significant circularity; proofs reduce to standard orthogonality and enumeration

full rationale

The manuscript proves the stated determinant formula for realized fusion systems F = F_S(G) by direct appeal to the column orthogonality relations on the ordinary character table of G, an independent fact from classical representation theory that does not depend on any fitted parameters or self-referential definitions inside the paper. For the finitely many simple fusion systems on p-groups of order at most p^4, the argument proceeds by exhaustive enumeration of the classified saturated fusion systems, explicit construction of the F-stable virtual characters as the fixed submodule of Z Irr(S), and direct evaluation of the resulting matrix determinant; both the classification and the matrix computations are feasible for these small orders and rest on external combinatorial data rather than internal fits. The lattice of virtual F-stable characters is defined in the standard way as the F-invariant submodule of the ordinary character lattice, with its rank equal to the number of F-classes following from the dimension of the space of invariant class functions. The general-case strategy via the characteristic idempotent is explicitly labeled an outline only. No load-bearing step reduces by construction to a self-citation, a fitted input renamed as prediction, or an ansatz smuggled from prior work by the same authors. The single mention of a conjecture due to the second author is the statement being proved, not a premise used to justify the proof.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The work rests on the standard definition of saturated fusion systems and the existence of virtual F-stable characters; no new free parameters or invented entities are introduced.

axioms (1)
  • domain assumption Saturated fusion systems possess fully centralised elements and well-defined F-class representatives.
    Invoked when forming the product of centraliser orders in the conjectured formula.

pith-pipeline@v0.9.0 · 5703 in / 1200 out tokens · 56249 ms · 2026-05-21T20:24:53.593388+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.