pith. machine review for the scientific record. sign in

arxiv: 2605.11219 · v1 · submitted 2026-05-11 · 🧮 math.RT · math.CO· math.RA

Recognition: 1 theorem link

· Lean Theorem

Balanced subsets in root systems

Andrei Moroianu, Paul Schwahn

Pith reviewed 2026-05-13 01:05 UTC · model grok-4.3

classification 🧮 math.RT math.COmath.RA
keywords balanced subsetswell-balanced subsetsroot systemssimple Lie algebraspositive rootsDynkin diagramsHermitian geometry
0
0 comments X

The pith

Well-balanced subsets of positive roots have explicit minimal and maximal sizes in every simple root system.

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

The paper computes the smallest and largest possible cardinalities of well-balanced subsets inside the positive roots of each simple root system. These subsets arise when studying Hermitian and spin geometry on spaces built from compact Lie algebras. A reader would care because the extremal sizes supply sharp numerical constraints that can be inserted directly into existence or obstruction arguments in those geometric settings. The authors obtain the numbers through exhaustive case-by-case inspection of the Dynkin diagrams that classify all simple root systems.

Core claim

The central claim is that the maximal and minimal sizes of well-balanced subsets can be computed explicitly for every simple root system. The computation proceeds from the uniform definitions of the balanced and well-balanced properties on subsets of positive roots and uses the classification of irreducible root systems to produce concrete values or formulas for each type.

What carries the argument

Well-balanced subsets of the positive roots, subsets that satisfy both a balance condition with respect to the full set of positive roots and an additional well-balanced requirement coming from the geometry of the compact Lie algebra.

If this is right

  • Explicit minimal and maximal cardinalities are now known for each irreducible root system.
  • These cardinalities supply sharp bounds that apply to any geometric construction relying on well-balanced subsets of positive roots.
  • The results cover all simple root systems without exception through the classification by Dynkin diagrams.
  • Any well-balanced subset must have size lying between the computed minimum and maximum for its ambient root system.

Where Pith is reading between the lines

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

  • The size bounds may translate into dimension restrictions on invariant sections or subbundles in the associated geometric problems.
  • Similar extremal-size questions could be posed for balanced subsets that are not required to be well-balanced.
  • The results open the possibility of checking the bounds by computer for all root systems of rank at most five.

Load-bearing premise

The notions of balanced and well-balanced subsets are defined uniformly for all simple root systems, and the case analysis over Dynkin diagrams captures every possible subset without omissions or misclassifications.

What would settle it

Direct enumeration in a low-rank root system such as A_2 or B_2 that produces a well-balanced subset whose size falls outside the stated minimum-maximum interval would falsify the computed bounds.

read the original abstract

Balanced and well-balanced subsets of the set of positive roots of compact Lie algebras arise naturally in problems related to Hermitian and spin geometry. In this paper we compute the maximal and minimal size of well-balanced subsets in all simple root systems.

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

2 major / 2 minor

Summary. The manuscript defines balanced and well-balanced subsets of the positive roots in simple root systems and computes the maximal and minimal cardinalities of well-balanced subsets for every irreducible root system (types A_n, B_n, C_n, D_n and the five exceptional types). The computations are presented via case analysis over the Dynkin diagrams, with explicit formulas or tables for each type.

Significance. If the extremal sizes are correctly established, the results supply concrete numerical invariants for well-balanced subsets that arise in Hermitian and spin geometry. Explicit closed-form expressions for the classical infinite families would be a useful contribution, allowing direct evaluation at arbitrary rank without enumeration.

major comments (2)
  1. [§4] §4 (Classical types, general formulas for A_n): the claimed minimal cardinality for well-balanced subsets is stated as a simple function of n, but the argument relies on exhaustive classification of subsets satisfying the well-balanced condition; no explicit inductive step or generating-function argument is supplied to confirm that no additional configurations appear for n > 10, which is load-bearing for the 'all simple root systems' claim.
  2. [§5.2] §5.2 (Types B_n and C_n): the maximal-size formula is derived from low-rank checks and a pattern; however, the definition of well-balanced is applied by checking the inner-product conditions on the Dynkin diagram, and it is unclear whether the pattern excludes subsets that first become possible when long and short roots interact at higher rank.
minor comments (2)
  1. [Introduction] The abstract and introduction use 'well-balanced' without a forward reference to its precise definition in §2; a single sentence cross-reference would improve readability.
  2. [Table 1] Table 1 (exceptional types) lists the extremal sizes but omits the explicit subsets realizing the minima; adding one representative subset per entry would make the table self-contained.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful reading and for identifying points where the generality of the arguments for the classical types could be made more explicit. We address each major comment below.

read point-by-point responses

  1. Referee: [§4] §4 (Classical types, general formulas for A_n): the claimed minimal cardinality for well-balanced subsets is stated as a simple function of n, but the argument relies on exhaustive classification of subsets satisfying the well-balanced condition; no explicit inductive step or generating-function argument is supplied to confirm that no additional configurations appear for n > 10, which is load-bearing for the 'all simple root systems' claim.

    Authors: We agree that an explicit inductive argument would strengthen the presentation in §4. The classification of well-balanced subsets in A_n proceeds by analyzing admissible selections along the path graph of the Dynkin diagram, where the well-balanced condition translates to forbidden adjacent pairs and sum constraints that are uniform across all ranks. The minimal cardinality is realized by a periodic selection pattern whose size satisfies a linear recurrence independent of n. In the revised manuscript we will insert a short inductive step: assuming the formula holds up to A_{n-1}, any well-balanced subset in A_n either omits the last simple root (reducing to the A_{n-1} case) or includes it in a controlled way that cannot decrease the cardinality below the claimed bound. This confirms no new minimal configurations appear for n > 10. revision: yes

  2. Referee: [§5.2] §5.2 (Types B_n and C_n): the maximal-size formula is derived from low-rank checks and a pattern; however, the definition of well-balanced is applied by checking the inner-product conditions on the Dynkin diagram, and it is unclear whether the pattern excludes subsets that first become possible when long and short roots interact at higher rank.

    Authors: We appreciate the referee drawing attention to the interaction between long and short roots. The maximal-size formula in §5.2 is obtained by partitioning any candidate subset according to the number of long versus short roots and applying the inner-product rules encoded in the B_n / C_n Dynkin diagram. These rules are local and identical at every rank; any purported new configuration at large n would require a long root to be orthogonal to a short root in a manner already forbidden by the diagram, which is already excluded in the low-rank exhaustive check. In the revision we will add a short paragraph making this rank-independence explicit by noting that the possible inner-product values between long and short roots remain {0, ±1, ±2} independently of n, so the counting argument carries over verbatim. revision: yes

Circularity Check

0 steps flagged

No circularity: results follow from direct enumeration and case analysis on root system definitions

full rationale

The paper defines balanced and well-balanced subsets from the positive roots of simple root systems and computes their extremal cardinalities via exhaustive case analysis over all Dynkin types (including closed forms for classical series). No step reduces a claimed prediction or size to a quantity already defined in terms of the same subsets, no self-citation is load-bearing for the central result, and no ansatz or uniqueness theorem is smuggled in. The derivation is self-contained against the standard structure of root systems and does not rely on fitted inputs renamed as outputs.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The work relies on the standard classification and combinatorial properties of root systems; no free parameters, ad-hoc axioms, or new entities are introduced in the abstract.

axioms (1)
  • standard math Standard axioms and classification of root systems for simple Lie algebras
    The computation uses the known Dynkin diagrams and positive root sets for types A_n through G_2.

pith-pipeline@v0.9.0 · 5312 in / 1132 out tokens · 41778 ms · 2026-05-13T01:05:56.453061+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.

Reference graph

Works this paper leans on

13 extracted references · 13 canonical work pages

  1. [1]

    Agaoka, E

    Y. Agaoka, E. Kaneda:On local isometric immersions of Riemannian symmetric spaces, Tôhoku Math. J. 36, 107–140 (1984)

    work page 1984

  2. [2]

    Agaoka, E

    Y. Agaoka, E. Kaneda:Strongly orthogonal subsets in root systems, Hokkaido Math. J. 31, 107–136 (2002)

    work page 2002

  3. [3]

    Agaoka, E

    Y. Agaoka, E. Kaneda:A lower bound for the curvature invariantp(G/K)asso- ciated with a Riemannian symmetric spaceG/K, Hokkaido Math. J. 33, 153–184 (2004)

    work page 2004

  4. [4]

    Artacho, U

    D. Artacho, U. Semmelmann:Invariant Spinors on Flag Manifolds, Internat. J. Math. 36 (7), 2550012 (2025)

    work page 2025

  5. [5]

    Bourbaki:Lie Groups and Lie Algebras

    N. Bourbaki:Lie Groups and Lie Algebras. Chapters 4–6, Springer (2002)

    work page 2002

  6. [6]

    P. J. Browne, Q. R. Gashi, P. Ó. Catháin:A Bollobás-Type Problem: From Root Systems to Erdős–Ko–Rado, Ann. Comb. (2024),https://doi.org/10.1007/ s00026-024-00717-y

    work page 2024

  7. [7]

    J. M. Burns, G. Pfeiffer:Maximal order Abelian subgroups of Coxeter groups, Glas- gow Math. J. 65, 114–120 (2023)

    work page 2023

  8. [8]

    Harish-Chandra:Representations of semisimple Lie groups VI, Amer. J. Math. 78, 564–628 (1956)

    work page 1956

  9. [9]

    Joyce:Compact hypercomplex and quaternionic manifolds, J

    D. Joyce:Compact hypercomplex and quaternionic manifolds, J. Diff. Geom. 35, 743–761 (1992)

    work page 1992

  10. [10]

    Kaneyuki:On orbit structure of compactifications of parahermitian symmetric spaces, Japan

    S. Kaneyuki:On orbit structure of compactifications of parahermitian symmetric spaces, Japan. J. Math. 13, 333–370 (1987)

    work page 1987

  11. [11]

    Moroianu, P

    A. Moroianu, P. Schwahn:Geometries with parallel, skew-symmetric and closed torsion, submitted to ArXiv (2026)

    work page 2026

  12. [12]

    Takeuchi:Polynomial representations associated with symmetric bounded do- mains, Osaka J

    M. Takeuchi:Polynomial representations associated with symmetric bounded do- mains, Osaka J. Math. 10, 441-475 (1973)

    work page 1973

  13. [13]

    J. A. Wolf, A. Korányi:Generalized Cayley transformations of bounded symmetric domains, Amer. J. Math. 87, 899–939 (1965) 13

    work page 1965