La Profilée - The Admissible Reduction Theorem

La Profilée’s five Admissibility Requirements AR1–AR5 define the domain of LP-valid system description: systems with an identified identity structure, non-zero structural capacities, definable transformation, temporal extension, and structural coherence between Frame and modules. The present paper proves the Admissible Reduction Theorem: any persistence condition defined on an LP-admissible system is either equivalent to IR = R / (F · I · C) ≤ 1 under reparameterization, or it is not a persistence condition in the structural sense. The proof proceeds in three steps. First, we show that AR1–AR5 jointly force a specific variable structure on any persistence condition defined within the admissible domain: the condition must contain a transformation component and an integration capacity component, and these must be relationally structured. Second, we show that the Functional Uniqueness Theorem — established in “La Profilée as a Law of Nature” — uniquely determines the form of the integration capacity component as F · I · C within the admissible domain. Third, we show that any relational persistence condition with this variable structure is equivalent to IR ≤ 1 under reparameterization. The result closes the admissible domain: within LP’s structural universe, no alternative persistence condition exists.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-04-01
DOI
https://doi.org/10.5281/zenodo.19368715
Primary Topic
Logic, programming, and type systems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

La Profilée - The Admissible Reduction Theorem

Marc Maibom
Zenodo (CERN European Organization for Nuclear Research)
Logic, programming, and type systems
article

La Profilée - The Admissible Reduction Theorem

Marc Maibom
article en

Abstract

La Profilée’s five Admissibility Requirements AR1–AR5 define the domain of LP-valid system description: systems with an identified identity structure, non-zero structural capacities, definable transformation, temporal extension, and structural coherence between Frame and modules. The present paper proves the Admissible Reduction Theorem: any persistence condition defined on an LP-admissible system is either equivalent to IR = R / (F · I · C) ≤ 1 under reparameterization, or it is not a persistence condition in the structural sense. The proof proceeds in three steps. First, we show that AR1–AR5 jointly force a specific variable structure on any persistence condition defined within the admissible domain: the condition must contain a transformation component and an integration capacity component, and these must be relationally structured. Second, we show that the Functional Uniqueness Theorem — established in “La Profilée as a Law of Nature” — uniquely determines the form of the integration capacity component as F · I · C within the admissible domain. Third, we show that any relational persistence condition with this variable structure is equivalent to IR ≤ 1 under reparameterization. The result closes the admissible domain: within LP’s structural universe, no alternative persistence condition exists.

Zenodo (CERN European Organization for Nuclear Research)
Peace, Justice and strong institutions
Openalex Percentile: Top 25%
Logic, programming, and type systems
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.