This paper establishes a local structural bridge between two recently developed information-geometric frameworks for observer-dependent probability representations on finite state spaces. Background. On the parametric side, the partition-adapted framework of Khomyakov (KLEO v3.24.1) defines observer entropy as the Kullback–Leibler divergence between a parametric distribution and the uniform lift of its coarse-graining, and shows that it scales quadratically with the resolution threshold, with a coefficient determined by the Fisher information matrix. On the empirical side, the Interference-First Reality (IFR) framework of Bianchi (2026) identifies multi-observer objectivity with the Fréchet barycenter of observer-induced distributions in the Jensen–Shannon metric, with almost-sure convergence guaranteed by metric barycenter theory. Principal results. The paper derives four main results: 1. Local Metric Bridge Lemma (Section 3): On the open probability simplex, the Jensen–Shannon divergence satisfies the local quadratic expansion D_JS(p ‖ p + εδ) = (ε²/8) I_p(δ) + O(ε³), where the explicit coefficient 1/8 arises from the midpoint structure of the symmetric divergence. 2. Multi-Observer Quadratic Aggregation Theorem (Section 4): For a partition-adapted parametric family satisfying conditions (A1)–(A3) of Khomyakov (KLEO v3.24.1), the empirical Jensen–Shannon Fréchet barycenter of an N-observer ensemble, centered on the within-class neutral locus, exists uniquely for small ε and coincides to leading order with the weighted Fisher–Rao barycenter of the within-class perturbation directions. The minimal Jensen–Shannon dispersion satisfies a quadratic scaling law governed by the within-class block I_ww(θ₀*) of the Fisher information matrix. 3. Leading-order coincidence of estimators (Corollary 6.1): The variational Fréchet minimizer p_F and the closed-form geometric overlap estimator p_G of Bianchi (2026) agree to order O(ε²) in Jensen–Shannon distance within the local regime. 4. Multi-observer Landauer corollary (Corollary 6.6): Under a per-channel irreversibility assumption and an additivity postulate for independent observer channels, the aggregate energetic cost of barycenter formation is bounded below by k_B T times the Jensen–Shannon dispersion. Scope. The bridge is local in ε (the within-class perturbation amplitude) and finite in N (the number of observers). It does not subsume Bianchi's almost-sure N → ∞ consistency theorem nor Khomyakov's ε → 0⁺ quadratic scaling result; it establishes their structural compatibility in the overlapping regime where both apply. The results are specialized to balanced exponential families (softmax), with explicit worked-example coefficients for four- and five-point state spaces. Domain-specific applicability is assessed against the cross-domain distinguishability hierarchy of Bianchi (2026), Table 14, identifying the low-dispersion regime (d_JS ≲ 10⁻² nats) as the primary domain of validity. Keywords: Jensen–Shannon divergence, Kullback–Leibler divergence, Fisher information, Fisher–Rao metric, multi-observer aggregation, Fréchet barycenter, probability simplex, partition-adapted parameterization, observer entropy, information geometry. MSC 2020: 62B10, 94A17, 53B12, 62F12.
This paper establishes a local structural bridge between two recently developed information-geometric frameworks for observer-dependent probability representations on finite state spaces. Background. On the parametric side, the partition-adapted framework of Khomyakov (KLEO v3.24.1) defines observer entropy as the Kullback–Leibler divergence between a parametric distribution and the uniform lift of its coarse-graining, and shows that it scales quadratically with the resolution threshold, with a coefficient determined by the Fisher information matrix. On the empirical side, the Interference-First Reality (IFR) framework of Bianchi (2026) identifies multi-observer objectivity with the Fréchet barycenter of observer-induced distributions in the Jensen–Shannon metric, with almost-sure convergence guaranteed by metric barycenter theory. Principal results. The paper derives four main results: 1. Local Metric Bridge Lemma (Section 3): On the open probability simplex, the Jensen–Shannon divergence satisfies the local quadratic expansion D_JS(p ‖ p + εδ) = (ε²/8) I_p(δ) + O(ε³), where the explicit coefficient 1/8 arises from the midpoint structure of the symmetric divergence. 2. Multi-Observer Quadratic Aggregation Theorem (Section 4): For a partition-adapted parametric family satisfying conditions (A1)–(A3) of Khomyakov (KLEO v3.24.1), the empirical Jensen–Shannon Fréchet barycenter of an N-observer ensemble, centered on the within-class neutral locus, exists uniquely for small ε and coincides to leading order with the weighted Fisher–Rao barycenter of the within-class perturbation directions. The minimal Jensen–Shannon dispersion satisfies a quadratic scaling law governed by the within-class block I_ww(θ₀*) of the Fisher information matrix. 3. Leading-order coincidence of estimators (Corollary 6.1): The variational Fréchet minimizer p_F and the closed-form geometric overlap estimator p_G of Bianchi (2026) agree to order O(ε²) in Jensen–Shannon distance within the local regime. 4. Multi-observer Landauer corollary (Corollary 6.6): Under a per-channel irreversibility assumption and an additivity postulate for independent observer channels, the aggregate energetic cost of barycenter formation is bounded below by k_B T times the Jensen–Shannon dispersion. Scope. The bridge is local in ε (the within-class perturbation amplitude) and finite in N (the number of observers). It does not subsume Bianchi's almost-sure N → ∞ consistency theorem nor Khomyakov's ε → 0⁺ quadratic scaling result; it establishes their structural compatibility in the overlapping regime where both apply. The results are specialized to balanced exponential families (softmax), with explicit worked-example coefficients for four- and five-point state spaces. Domain-specific applicability is assessed against the cross-domain distinguishability hierarchy of Bianchi (2026), Table 14, identifying the low-dispersion regime (d_JS ≲ 10⁻² nats) as the primary domain of validity. Keywords: Jensen–Shannon divergence, Kullback–Leibler divergence, Fisher information, Fisher–Rao metric, multi-observer aggregation, Fréchet barycenter, probability simplex, partition-adapted parameterization, observer entropy, information geometry. MSC 2020: 62B10, 94A17, 53B12, 62F12.
This paper constructs a rigorous mathematical bridge between Kaminsky's ontological duality framework and Khomyakov's KL-geometric theory of observer entropy. The central result establishes a canonical isomorphism between the statistical manifold (𝒫>₀(𝒳), D_KL) and the factor space of Kaminsky's ontological configuration space Ω_W = Subj × Subj under subjective-indistinguishability equivalence. Four theorems are proved: (T1) the ontological flow induces a Markov semigroup on the statistical manifold under an explicit fibre-uniformity assumption; (T2) the KL divergence is the unique f-divergence, up to positive scalar, whose Hessian recovers the Fisher–Rao metric; (T3) ontological observer entropy equals the expected within-fibre KL divergence from the uniform fibre prior; (T4) ontological observer entropy coincides with Khomyakov's observer entropy under a precise operator identification. A monotonicity theorem for subjective entropy is derived from the Shannon chain rule, yielding an entropic arrow of time consistent with physical time ordering. Version 1.2 introduces a new Parametric Realization assumption enabling a rigorous embedding of the ontological trajectory into a smooth parametric statistical family, together with a derived Fisher–Rao scaling theorem establishing the quadratic expansion of ontological observer entropy in terms of the Fisher information metric. These additions provide the missing structural link required to import the information-geometric scaling law into the ontological framework in a formally controlled manner.
Jensen-Shannon divergence (JD) is a symmetrized and smoothed version of the most important divergence measure of information theory, Kullback divergence. As opposed to Kullback divergence it determines in a very direct way a metric; indeed, it is the square of a metric. We consider a family of divergence measures (${\text{JD}}_{\ensuremath{\alpha}}$ for $\ensuremath{\alpha}>0$), the Jensen divergences of order $\ensuremath{\alpha}$, which generalize JD as JD1=JD. Using a result of Schoenberg, we prove that ${\text{JD}}_{\ensuremath{\alpha}}$ is the square of a metric for $\ensuremath{\alpha}∊(0,2]$, and that the resulting metric space of probability distributions can be isometrically embedded in a real Hilbert space. Quantum Jensen-Shannon divergence (QJD) is a symmetrized and smoothed version of quantum relative entropy and can be extended to a family of quantum Jensen divergences of order $\ensuremath{\alpha}$ $({\text{QJD}}_{\ensuremath{\alpha}})$. We strengthen results by Lamberti and co-workers by proving that for qubits and pure states, ${\text{QJD}}_{\ensuremath{\alpha}}^{1/2}$ is a metric space which can be isometrically embedded in a real Hilbert space when $\ensuremath{\alpha}∊(0,2]$. In analogy with Burbea and Rao's generalization of JD, we also define general QJD by associating a Jensen-type quantity to any weighted family of states. Appropriate interpretations of quantities introduced are discussed and bounds are derived in terms of the total variation and trace distance.
Title: The Invariance of the Interface: Why Fisher Information Reappears in Derivations of Physical Law Description This note addresses a persistent conceptual gap in “information physics” programs that derive familiar dynamical laws by extremizing Fisher-information-based functionals: why Fisher information, rather than some other statistical functional? The proposed answer is meta-explanatory. The observer–world interface is modeled as probabilistic, and “objectivity” is formulated as Observer Equivalence (OE): invariance under reparameterization and monotonicity under coarse-graining (information-loss channels). Under these constraints, Chentsov-type characterization results single out the Fisher information metric as the unique local Riemannian geometry on the space of probability distributions (up to an overall scale). Fisher information is thus treated not as an axiom but as an invariance residue forced by OE at the probabilistic interface. To connect geometry to dynamics, the note introduces an explicit postulate—Informational Inertia—motivated as an information-geometric analogue of least-action/geodesic principles: in the absence of forcing, interface states evolve along paths of minimal statistical resistance (geodesics of the OE-fixed geometry), with physical constraints supplying the remaining “potential” structure. A single exemplar is presented: revisiting the Madelung/Reginatto (Hall–Reginatto) route to the Schrödinger equation, where the “quantum potential” arises as the geometric term associated with the Fisher penalty for reshaping the probability density. The overall scale (and thus ℏ) is explicitly acknowledged as empirical input: OE fixes the form of the geometry, not its scale. Keywords observer equivalence; Fisher information; information geometry; Chentsov theorem; coarse-graining; monotone metrics; Schrödinger equation; Madelung transformation; Reginatto; foundations of physics How to cite Ullman, G. “The Invariance of the Interface: Why Fisher Information Reappears in Derivations of Physical Law.” Zenodo. https://doi.org/10.5281/zenodo.18495542 Notes on AI assistance This manuscript was prepared with assistance from large language models for drafting, editing, and LaTeX formatting. The author takes full responsibility for the technical content, claims, and references.
In a worldview based on causal partial orders, any single observer possesses only a local fragment: partial events at finite resolution, partial causal relations, and partial information states on locally observable algebras. Multiple observers attempt to achieve ``consensus'' on the same universe causal network through communication and updates, thereby reconstructing a consistent world description. In the abstract causal network framework, this paper formalizes observers as multi-component objects equipped with geometric domains, local partial orders, resolution scales, observable algebras, boundary states, model families, state update operators, and utility functions, establishing a unified theory of ``consensus geometry.'' At the geometric level, given a family of local causal fragments \{(C_i,\prec_i)\}_{i\in I} covering event set X, if local partial orders satisfy Cech-type consistency conditions in overlapping regions, then there exists a unique global partial order (X,\prec) as causal consensus extension; otherwise causal consensus exists at most at coarser resolution levels. Resolution is characterized by event partitions P_i and observable algebras A_i; the richness of common refinement P_\ast and algebra intersection A_{com}=\bigcap_iA_i determines the fineness of achievable consensus. At the information and dynamical level, consider state families \{\omega_i^{(t)}\} on common observable algebra A_{com}, communication channels T_{ij}, and weight matrix W=(w_{ij}). Based on Umegaki relative entropy $ D(\rho\|\sigma)=\tr\big(\rho(\log\rho-\log\sigma)\big) and its data processing inequality, we construct weighted total deviation function \Phi^{(t)}=\sum_{i\in I}\lambda_i D\big(\omega_i^{(t)}\|\omega_\ast\big), proving that when channels satisfy data processing inequality, communication graph is strongly connected, weight matrix is primitive, and common fixed point \omega_\ast exists, \Phi^{(t)} is a strictly monotone non-increasing Lyapunov function, making state iteration converge to unique state consensus \omega_{cons}=\omega_\ast. This structure simultaneously encompasses classical average consensus algorithms and contractive flows on quantum channels. At the model level, viewing candidate causal dynamical models as elements of compact space M, under appropriate identifiability and large deviation conditions, we prove that as observation data increases, the intersection of acceptable model sets M_i^{(T)} of each observer contracts with probability one to the unique true model M^\ast, achieving model consensus. The above geometric, informational, and model structures are unified into a ``consensus feasible region'' O_{cons} in observer property space O$. This paper provides several necessary or sufficient conditions for causal consensus, state consensus, and model consensus, proposing a set of quantitative indicators including geometric overlap degree, resolution compatibility, algebra intersection dimension, relative entropy deviation, and communication graph connectivity, demonstrating how to systematically analyze ``how multiple observers weave the same causal world'' from the causal network perspective.
By Chentsov’s theorem, the Fisher–Rao metric is, up to a constant factor, the only Riemannian metric on finite probability simplices that is invariant under sufficient st atistics. We ask which dynamical laws in physics, population biology and machine learning can be written in terms of this one metric, and in what way. Two classes appear. Gradient flows of the Fisher metric include the replicator equation, which is an exact Shahshahani gradient flow of mean fitness, and natural-gradient learning; both have variational characterisations as steepest descent or as Kullback–Leibler proximal steps. Hamiltonian flows arise on Kähler statistical manifolds, where the Fisher metric and a symplectic form are the real and imaginary parts of the quantum geometric tensor. This class contains the Schrödinger equation on projective Hilbert space and, through the time-dependent variational principle on Gaussian coherent states, Hamilton’s equations for a smoothed Hamiltonian, for which we give an explicit O(h¯ ) bound on the classical limit. In both classes the metric sets the speed of evolution. A single Cauchy–Schwarz inequality then contains Fisher’s fundamental theorem, a bound on the rate of change of a trait mean, and the Mandelstam–Tamm bound as special cases. We also show that the initial purity loss of a pure state under Lindblad dephasing equals one half of the quantum Fisher information of the coupling operator, and that the Fisher metric of a Gibbs family inherits the critical exponent of the susceptibility. Every quantitative statement is checked numerically in an open test suite. An exact-Fisher study of small neural networks gives an effective-dimension scaling exponent of 0.27 (95% confidence interval 0.17–0.36).