Geometric conditions for matrix domination in two dimensions

Argyrios Christodoulou

arxiv: 1907.00347 · v3 · submitted 2019-06-30 · 🧮 math.DS

Geometric conditions for matrix domination in two dimensions

Argyrios Christodoulou This is my paper

Pith reviewed 2026-05-25 12:46 UTC · model grok-4.3

classification 🧮 math.DS

keywords dominated setsspecial linear grouphyperbolic geometrytraceseigenvectorsSL(2)dynamical systems

0 comments

The pith

Traces and eigenvectors give explicit necessary and sufficient conditions for a finite set of SL(2) matrices to be dominated.

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

The paper proves one necessary condition and one sufficient condition for a finite subset of the special linear group to form a dominated set. Both conditions are stated entirely in terms of the traces of the matrices and the directions of their eigenvectors. These criteria can be evaluated by direct calculation from the given matrices. The sufficient condition additionally supplies an algorithm that produces a dominated set once the desired eigenvectors are specified. The proofs rest on the correspondence between matrix products and isometries of the hyperbolic plane.

Core claim

A finite subset of the special linear group is dominated precisely when the traces and eigenvectors satisfy certain explicit geometric inequalities derived from the action on the hyperbolic plane. The necessary condition and the sufficient condition are each stated directly in these terms and require no further dynamical computation.

What carries the argument

The geometric correspondence between domination of SL(2) matrices and expansion properties of their action on the hyperbolic plane, expressed through traces and eigenvector directions.

If this is right

Domination of any given finite matrix set can be decided by computing only traces and eigenvector angles.
Dominated sets with any prescribed eigenvectors can be constructed by following the sufficient-condition algorithm.
The same geometric test applies uniformly to every finite collection inside the special linear group.

Where Pith is reading between the lines

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

The hyperbolic-geometry translation may make it feasible to count or sample dominated sets of given size by working directly with eigenvector configurations.
The criteria supply a practical test that could be inserted into existing algorithms for studying Lyapunov exponents of random matrix products in two dimensions.

Load-bearing premise

The correspondence between dominated matrix sets and two-dimensional hyperbolic geometry is strong enough to translate domination into explicit conditions on traces and eigenvectors alone.

What would settle it

A concrete finite collection of matrices in SL(2,R) whose traces and eigenvectors satisfy the stated sufficient condition yet whose iterated products fail to exhibit uniform expansion in every direction.

read the original abstract

In this article we prove a necessary and a sufficient condition for a finite subset of the special linear group to be dominated. These conditions are purely geometric in nature, as they only involve the trace and the eigenvectors of the matrices, and can be computed explicitly. Our sufficient condition, in particular, provides a simple algorithm for constructing a dominated set with prescribed eigenvectors. The techniques involved in our proofs take advantage of the interaction between dominated sets and two-dimensional hyperbolic geometry.

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.

Desk Editor's Note private letter to a colleague

Christodoulou gives explicit trace-and-eigenvector criteria that are necessary and sufficient for domination of finite sets in SL(2), plus a construction algorithm.

read the letter

Christodoulou proves necessary and sufficient geometric conditions for a finite subset of SL(2) to be dominated, phrased only in terms of traces and eigenvectors. The sufficient condition also supplies a direct algorithm for building such a set with chosen eigenvectors. That is the core contribution, and it is new relative to the algebraic approaches cited in the abstract. The proofs rest on the usual correspondence between matrix products and isometries of the hyperbolic plane, which fits the two-dimensional setting without obvious circularity. The conditions are stated to be computable, which is a practical plus for anyone who needs to check or produce examples. The paper stays tightly focused and does not claim broader impact. The main limitation is scope: the result sits inside the literature on dominated splittings and ping-pong phenomena, so its audience is narrow. No load-bearing gaps appear in the stated claims, and the stress-test found no internal inconsistency. A reader already working on matrix semigroups or hyperbolic dynamics on surfaces will get immediate use from the algorithm and the explicit tests. Someone outside that niche will not. The work is formally grounded enough and the claims are sharp enough that it should go to referees rather than be desk-rejected. Minor revisions might be needed to spell out the derivations more explicitly for readers who do not already know the hyperbolic-geometry dictionary, but that is ordinary for a short note in this area.

Referee Report

0 major / 2 minor

Summary. The paper proves a necessary condition and a sufficient condition for a finite subset of SL(2) to be dominated. Both conditions are stated to be purely geometric, depending only on the traces and eigenvectors of the matrices, and are explicitly computable. The sufficient condition is claimed to yield a simple algorithm for constructing a dominated set with prescribed eigenvectors. The proofs are said to exploit the interaction between dominated sets and two-dimensional hyperbolic geometry.

Significance. If the stated conditions and proofs hold, the result supplies explicit, checkable geometric criteria for matrix domination in SL(2), replacing abstract existence arguments with direct computations on traces and eigenvectors. The construction algorithm would be a concrete tool for generating examples in dynamical systems and hyperbolic geometry contexts. The geometric framing aligns with standard techniques in the field for studying dominated splittings.

minor comments (2)

The abstract asserts that proofs exist and that the conditions can be computed explicitly, but the provided text contains no derivations, examples, or verification steps. If the full manuscript includes these, they should be referenced in the abstract or introduction for clarity.
Notation for the special linear group (SL(2) versus SL(2,R)) and the precise definition of 'dominated' should be stated explicitly at the first use to avoid ambiguity for readers outside the immediate subfield.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their positive summary of the paper and for recommending minor revision. No specific major comments were raised in the report.

Circularity Check

0 steps flagged

No significant circularity

full rationale

The paper establishes necessary and sufficient geometric conditions (via traces and eigenvectors) for domination of finite subsets of SL(2) by leveraging standard interactions with 2D hyperbolic geometry. No load-bearing step reduces by definition, fitted input, or self-citation chain to the target result; the derivation is self-contained and externally grounded in hyperbolic geometry.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

Based solely on abstract; no free parameters, invented entities, or non-standard axioms are indicated. Relies on standard properties of SL(2) and hyperbolic geometry.

axioms (1)

standard math Standard properties of the special linear group and its action via two-dimensional hyperbolic geometry.
Invoked to establish the geometric conditions as stated in the abstract.

pith-pipeline@v0.9.0 · 5585 in / 1013 out tokens · 48354 ms · 2026-05-25T12:46:45.109341+00:00 · methodology

discussion (0)

Lean theorems connected to this paper

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

IndisputableMonolith/Foundation/AlexanderDuality.lean alexander_duality_circle_linking unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

Theorem 1.1 ... τ(h) < 1/5 min{C(f,g)−1/(C(f,g)+3),1} ... τ(h)>4 max{|log|C(f,g)(C(f,g)−1)||}+23 ... semidiscrete and inverse-free
IndisputableMonolith/Cost/FunctionalEquation.lean washburn_uniqueness_aczel unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

tr(h)=a+b ... 1/2|tr(f∘g)| = |cosh d sinh(τ(f)/2) sinh(τ(g)/2) − cosh(τ(f)/2) cosh(τ(g)/2)|

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.