Projective Information Loss and Fibre Erasure in Admissible Non-Injective Projection

We establish a fibre-erasure theorem for the admissible coarse-graining hierarchy of the Cosmochrony spectral programme . The non-injective projection $\Pi : \Omega \to \mathcal{O}$ defines a residual fibre-information functional $I(c;\sigma(\ell))$, where $c$ is a Weil-block fibre label and $\sigma_c(\ell)$ is the BFS capacity profile at coarse-graining depth $\ell$. The structural sufficiency hypothesis [H-suff] — that $\sigma(\ell)$ is a sufficient statistic for the hierarchy beyond $\ell$ — is proved at the level of the BFS rank observable (Proposition prop:rank-suff), where the fibre label is erased identically; for the full Born–Infeld capacity it remains conditional on a single preservation step, numerically supported for $q \in \{61, 151, 211\}$ (Section sec:hsuff-test). Granting [H-suff], the data-processing inequality implies that $I(c;\sigma(\ell))$ is non-increasing in $\ell$: fibre information is erased, not created, under admissible coarse-graining. This result is not a $c$-theorem; it does not count effective degrees of freedom. It is a quantitative realisation of the ENI no-go theorem : non-injectivity of $\Pi$ forces projective information loss, and the data-processing inequality makes this loss monotone and measurable. The inter-sector variance $\mathrm{Var}_c(\sigma_c(\ell))$ serves as a computable proxy; its restriction to $\mathrm{SU}(3)$ colour-triplets connects directly to hypothesis [H-color] .

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-05-30
DOI
https://doi.org/10.5281/zenodo.20466460
Primary Topic
Theoretical and Computational Physics
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

Projective Information Loss and Fibre Erasure in Admissible Non-Injective Projection

Jérôme Beau
Zenodo (CERN European Organization for Nuclear Research)
Theoretical and Computational Physics
preprint

Projective Information Loss and Fibre Erasure in Admissible Non-Injective Projection

Jérôme Beau
preprint en

Abstract

We establish a fibre-erasure theorem for the admissible coarse-graining hierarchy of the Cosmochrony spectral programme . The non-injective projection $\Pi : \Omega \to \mathcal{O}$ defines a residual fibre-information functional $I(c;\sigma(\ell))$, where $c$ is a Weil-block fibre label and $\sigma_c(\ell)$ is the BFS capacity profile at coarse-graining depth $\ell$. The structural sufficiency hypothesis [H-suff] — that $\sigma(\ell)$ is a sufficient statistic for the hierarchy beyond $\ell$ — is proved at the level of the BFS rank observable (Proposition prop:rank-suff), where the fibre label is erased identically; for the full Born–Infeld capacity it remains conditional on a single preservation step, numerically supported for $q \in \{61, 151, 211\}$ (Section sec:hsuff-test). Granting [H-suff], the data-processing inequality implies that $I(c;\sigma(\ell))$ is non-increasing in $\ell$: fibre information is erased, not created, under admissible coarse-graining. This result is not a $c$-theorem; it does not count effective degrees of freedom. It is a quantitative realisation of the ENI no-go theorem : non-injectivity of $\Pi$ forces projective information loss, and the data-processing inequality makes this loss monotone and measurable. The inter-sector variance $\mathrm{Var}_c(\sigma_c(\ell))$ serves as a computable proxy; its restriction to $\mathrm{SU}(3)$ colour-triplets connects directly to hypothesis [H-color] .

Zenodo (CERN European Organization for Nuclear Research)
Peace, Justice and strong institutions
Theoretical and Computational Physics
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.