Informational Holonomy Curvature and Its Discrete-to-Continuous Convergence

We introduce a notion of curvature based on informational holonomy. Let (M,g) be a smooth Riemannian manifold and let π:P→M be a bundle of state spaces equipped fibrewise with a smooth divergence Dx inducing an information metric gPx. Assuming a connection on P compatible with this fibrewise information geometry, we measure the deviation of holonomy around small geodesic triangles by transporting a reference state μx and comparing it to its image via the induced informational distance dx=2Dx. Normalizing the resulting distance defect by the geometric area yields a continuous informational holonomy (sectional) curvatureKholcont(x,Π). We prove that this limit exists for all (x,Π) and equals the norm of a vector Wx(Π;μx)∈TμxPx depending linearly on the curvature of the connection along Π. In geometric models induced from the Levi–Civita connection via an isometric representation, Kholcont becomes a scalar invariant of Rg|Π and, on spaces of constant sectional curvature, reduces to a constant multiple of |secg|. On the discrete side, we consider quasi-uniform sampling graphs whose edges carry channels approximating parallel transport. Discrete triangle holonomies define a curvature estimator, and under explicit sampling, area-approximation, and channel-consistency assumptions, we establish a discrete-to-continuum convergence theorem with a quantitative error bound controlled by the sampling scale.

Authors

Institutions

Publication Details

Journal
International Journal of Topology
Published
2026-06-18
DOI
https://doi.org/10.3390/ijt3020013
Primary Topic
Statistical Mechanics and Entropy
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Informational Holonomy Curvature and Its Discrete-to-Continuous Convergence

David Gutierrez Ule
International Journal of Topology
Statistical Mechanics and Entropy
article

Informational Holonomy Curvature and Its Discrete-to-Continuous Convergence

David Gutierrez Ule
article en

Abstract

We introduce a notion of curvature based on informational holonomy. Let (M,g) be a smooth Riemannian manifold and let π:P→M be a bundle of state spaces equipped fibrewise with a smooth divergence Dx inducing an information metric gPx. Assuming a connection on P compatible with this fibrewise information geometry, we measure the deviation of holonomy around small geodesic triangles by transporting a reference state μx and comparing it to its image via the induced informational distance dx=2Dx. Normalizing the resulting distance defect by the geometric area yields a continuous informational holonomy (sectional) curvatureKholcont(x,Π). We prove that this limit exists for all (x,Π) and equals the norm of a vector Wx(Π;μx)∈TμxPx depending linearly on the curvature of the connection along Π. In geometric models induced from the Levi–Civita connection via an isometric representation, Kholcont becomes a scalar invariant of Rg|Π and, on spaces of constant sectional curvature, reduces to a constant multiple of |secg|. On the discrete side, we consider quasi-uniform sampling graphs whose edges carry channels approximating parallel transport. Discrete triangle holonomies define a curvature estimator, and under explicit sampling, area-approximation, and channel-consistency assumptions, we establish a discrete-to-continuum convergence theorem with a quantitative error bound controlled by the sampling scale.

International Journal of TopologyVol. 3(2)
Oldham Council (GB)
Openalex Percentile: Top 5%
Statistical Mechanics and Entropy
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.