Search arXivSearch

arXiv · 2608.13611

SN-ASMO: Satellite-Navigation Array Spatial-Manifold Precise Observation Theory A Mathematical Foundation for Observation Formation, Unified U(1) Geometry, Intrinsic Information, and Preservation of the RTK Integer Structure

Abstract

Suppressive interference, high-dynamic motion of the receiving platform, and carrier-phase RTK lead satellite navigation to one fundamental question: when the receiver actively participates in observation formation through its array geometry, channel states, weights, and signal-processing rules, how can the resulting carrier observation continue to represent the same objective propagation process while preserving continuous phase and the integer-ambiguity structure? The physical world is not changed by a reconfiguration of the observer, but its complex representation in the observation world is. Without a strict separation between propagation-induced and observer-induced variations, anti-jamming, high dynamics, and precise carrier-phase positioning become structurally coupled at the observation-formation level. Finally, reproducible and falsifiable protocols are provided for static interference, dynamic rotation, inter-branch timing mismatch, near-null response, RF replay, and RTK integer-risk validation. The scoped novelty of SN-ASMO is the unification of observation formation, reference covariance, exact nuisance quotients, same-source transport, intrinsic statistical information, and preservation of the RTK integer structure in one mathematically closed and physically testable framework.

Explore related subjects

Keep this discovery

BibTeXRIS

Xianwei Meng. 2026-08-28. SN-ASMO: Satellite-Navigation Array Spatial-Manifold Precise Observation Theory A Mathematical Foundation for Observation Formation, Unified U(1) Geometry, Intrinsic Information, and Preservation of the RTK Integer Structure. https://arxiv.org/abs/2608.13611

Cite the original work for its findings. Save a collection to share your selection of sources.

Discover connections

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related papers

Turing complete Navier-Stokes steady states via cosymplectic geometry

In this article, we construct stationary solutions to the Navier-Stokes equations on certain Riemannian $3$-manifolds that exhibit Turing completeness, in the sense that they are capable of performing universal computation. This universality arises on manifolds admitting nonvanishing harmonic 1-forms, thus showing that computational universality is not obstructed by viscosity, provided the underlying geometry satisfies a mild cohomological condition. The proof makes use of a correspondence between nonvanishing harmonic $1$-forms and cosymplectic geometry, which extends the classical correspondence between Beltrami fields and Reeb flows on contact manifolds.

math.DG

Geometric mean and Lebesgue-type decomposition of completely positive maps

We introduce the geometric mean and the parallel sum of completely positive (CP) maps between von Neumann algebras, based on the Pusz--Woronowicz theory of positive sesquilinear forms. We provide a concrete characterization via a block matrix positivity condition and establish their fundamental properties, including the AM--GM--HM inequality with respect to the CP order. In finite-dimensional settings, our construction is compatible with the Choi--Jamiolkowski correspondence, under which the geometric mean of CP maps corresponds to the Kubo--Ando geometric mean of their Choi matrices. This yields a natural operator-theoretic framework for interpolating quantum channels. As an application, we obtain index-type inequalities for conditional expectations in subfactor theory. Finally, we establish a Lebesgue-type decomposition of CP maps via a parallel sum construction, thereby providing a unified framework that simultaneously generalizes Ando's decomposition of bounded positive operators and Kosaki's decomposition of normal positive functionals on von Neumann algebras.

math.OA

Two Adjoint Perspectives on Fokker-Planck Optimization: A Microscopic-Macroscopic Correspondence

The Fokker-Planck equation admits both a macroscopic Eulerian description through probability densities and a microscopic Lagrangian description through stochastic trajectories. Consequently, optimization problems constrained by the Fokker-Planck equation can be formulated from either perspective. Surprisingly, the corresponding adjoint equations appear to be fundamentally different: the macroscopic adjoint is governed by the backward Kolmogorov equation, whereas the microscopic adjoint evolves pathwise along stochastic trajectories. In this note, we reconcile these two formulations by establishing their correspondence in the continuum setting. We further show that, although their discrete gradients no longer coincide after discretization, both provide consistent numerical approximations of the continuum gradient. Explicit convergence rates are established for both discretization strategies.

math.NA