Geometric Learning and Finsler Metrics in Weighted Projective Spaces

Abstract

We introduce a hierarchical clustering framework for weighted projective spaces Pq built on Finsler geometry. From an optimization-based Finsler norm that quotients out the weighted scaling action, we construct a scaling-invariant distance dF([z], [w]) and a rational analogue dF,Q([z], [w]) for points of Pq(Q). The norm carries a shape parameter p: the case p=2 is Riemannian and admits a closed-form distance, while p≠ 2 is genuinely Finsler, and the metric and clustering guarantees below hold for every p∈[1,∞). Whereas earlier work measured proximity in these spaces through non-metric dissimilarities, we prove that dF satisfies the triangle inequality and is therefore a genuine metric; this is what equips the induced clustering with its theoretical guarantees, including monotone dendrograms and Gromov--Hausdorff stability under perturbation of the data. The metric respects the intrinsic scaling symmetry and weighted topology of Pq, avoiding the distortions of a flat-space embedding. We develop the framework's arithmetic applications -- clustering rational points in the moduli space of genus two curves and analyzing rational functions in arithmetic dynamics -- and indicate prospective extensions to quantum state spaces, where the weights q model anisotropic noise. More broadly, the construction offers a rigorous metric foundation for graded neural networks and related machine-learning techniques on graded algebraic varieties.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…