arXiv:2511.16095v2
Abstract
Let be a quotient of a real Lie group by a non-uniform lattice. Consider a one-parameter subgroup of that is -diagonalizable over and whose action on is mixing. In this dynamical system we study the set of points with a precompact orbit, written as , which is known to be a dense subset of of full Hausdorff dimension. We prove that is indecomposable in the following sense: given any , the set of for which , where denotes the positive ray in , is uncountable and dense in . When the dimension of the neutral subgroup of with respect to is we demonstrate, for any , the existence of many points whose orbit closure is compact and has Hausdorff dimension at least .
AI-generated audit
Audit summary
Not a correctness certificate. A “Correct” result may include yellow typos or minor formal corrections that do not affect substantive soundness. It means this audit found no unresolved substantive error under the stated criteria; it does not replace expert scrutiny or formal verification.
Current report
Detailed mathematical audit
01Statements2 reported findingsCorrect
The dimension lower bound for bounded positive orbits with prescribed bounded limit points, the dense indecomposability consequence, and the large-dimensional compact-orbit-closure corollary are correct.
Bounded orbits approaching a prescribed bounded point have the stated dimension
Pages 3 and 5--17 · main theorem, reduction to Theorem 2.5, and proof · arXiv:2511.16095v2
Mixing supplies, uniformly on a compact set, many generic descendants whose next orbit block remains compact. Sparse approach steps use equidistribution of expanding-horospherical boxes to enter an arbitrarily small product neighborhood of the prescribed bounded orbit. A tree-like construction alternates the two steps; making approach steps density zero preserves Hausdorff dimension . Slicing with the contracting and neutral directions adds , giving .
Indecomposability and large compact orbit closures follow
Pages 3--4 and 7 · dense-orbit theorem, corollary, and reduction to Theorem 2.5 · arXiv:2511.16095v2
When , the main lower bound is full dimensional in every open set. Scheduling a countable dense subset of any compact invariant forces the constructed orbit closure to contain all of . Choosing from the established compact invariant sets with dimension exceeding then gives a compact positive-orbit closure of at least that dimension.
02Proofs2 reported findingsCorrect
The product-structure reduction, mixing estimates, tessellation counts, sparse approach-step construction, and Hausdorff-dimension calculation are correct and complete.
Generic and approach steps are uniform on the chosen compact set
Pages 4--13 · reduction, equidistribution, and step propositions · arXiv:2511.16095v2
The expanding subgroup is simply connected and nilpotent, so the tessellations and Haar scaling used in the count are valid. Mixing is applied to compactly supported approximations after the boundary-null compact set is fixed. The local product decomposition controls the contracting and neutral errors throughout an approach block, and every constant is chosen before the subsequent time thresholds.
The sparse tree retains full expanding dimension
Pages 13--17 · marked tessellation tree and proof of Theorem 2.5 · arXiv:2511.16095v2
Generic levels have a fixed positive density of children, while an approach level has one child but can be placed at indices of zero asymptotic density. The logarithmic density loss from approach levels is therefore negligible compared with the contraction scale. Orbit segments between marked times remain in one fixed compact set, and the prescribed approach radii tend to zero along infinitely many occurrences of each target.
03Novelty0 reported findingsNo non-novelty findings
No non-novelty findings.