La Profilée - The Structural Law of Persistent Identity - A Complete and Self-Contained Derivation

La Profilée does not describe how systems evolve — it determines whether they remain the same system at all. La Profilée (LP) establishes a structural law governing identity under real transformation. Its central question is unavoidable: under which conditions does a system undergoing real transformation remain the same system? LP does not describe how systems evolve. It determines whether evolution preserves identity. Central condition: A system persists as itself if and only if IR ≤ 1 and FCC holds. IR ≤ 1 determines whether the system continues to exist as a structured entity. FCC determines whether it remains this system. The empirical accessibility of the structural variables follows from the admissibility conditions of the persistence problem itself; proprietary diagnostic implementations are secondary realizations of this forced accessibility, not preconditions of it. The core derivation is self-contained with respect to all indispensable LP-specific claims required for the three laws. Standard mathematical structures are used in their conventional form. Selected extensions (Scale Invariance, Vertical IR Aggregation, Frame Collision Direction, Structural Time Invariance) are stated in compressed form; full derivations appear in the cited LP series papers. The paper establishes three structural laws from minimal conditions and specifies falsification conditions for each. The three laws: (I) IR = R/(F·M·K) ≤ 1 is the necessary and sufficient condition for the persistence of the system as a structured entity (IR ≤ 1); persistence as this system additionally requires FCC. (II) T_col < T_rec strictly — identity is time-directed. (III) F → M → K is the unique admissible recovery sequence. From these, four consequences follow: Collapse Latency, the Structural Depth Deficit, the Intervention Paradox, and Structural Irreversibility. Axiom 0 (Determinacy as a Condition of Meaning). If a persistence claim is to possess a determinate truth condition, there must exist a structural boundary that distinguishes identity-preserving from identity-destroying transformation. Without such a boundary, the statement 'the same system' lacks evaluable content and cannot be assessed as true or false. This is not a substantive claim about systems — it is a condition for the persistence claim to be a claim at all. Without such a criterion, there is no fact of the matter about persistence. Proposition (Global Boundary Forces Comparability). Let A be the class of all admissible transformations classified as identity-preserving by a single determinate global persistence boundary. Define T₁ ≤ₚ T₂ ⇔ (T₂ ∈ A ⇒ T₁ ∈ A). Then ≤ₚ is total up to equivalence classes of equal persistence severity. If ≤ₚ is not total, then no single global persistence boundary exists. Proof. A single global persistence boundary assigns every admissible transformation exactly one verdict relative to the same preserving class A. The induced relation ≤ₚ orders transformations by inclusion with respect to admissibility into A. Suppose ≤ₚ is not total. Then there exist T₁, T₂ such that neither T₁ ≤ₚ T₂ nor T₂ ≤ₚ T₁. Hence each transformation admits admissibility contexts in which it is persistence-preserving while the other is not. The verdict structure is then not globally unified: the boundary classifies each transformation only through locally divergent verdict dependencies, not relative to one common persistence severity order. This is not a weaker global boundary — it is the breakdown of a single global boundary into incompatible local verdict structures. Therefore non-totality is incompatible with the existence of one determinate global persistence boundary. Hence totality holds up to equivalence classes. ✓ □ Lemma 1 (Global Determinacy Forces Total Preorder). If a persistence boundary is global and determinate, the induced persistence relation on admissible transformations must be a total preorder. Proof. A single global persistence boundary yields one and the same admissibility verdict structure for all admissible transformations. Define T₁ ≤ₚ T₂ ⇔ (T₂ ∈ A ⇒ T₁ ∈ A). Reflexivity and transitivity are immediate. Assume non-totality: there exist T₁, T₂ such that neither T₁ ≤ₚ T₂ nor T₂ ≤ₚ T₁. Hence each can occur as admissible while the other is inadmissible. Therefore the verdicts cannot be generated from one common persistence-severity boundary. The classification fragments into context-dependent local structures. But by hypothesis the persistence boundary is single, global, and determinate. Contradiction. Therefore ≤ₚ is total up to equivalence classes. Comparability is not a property of the boundary — it is the condition under which a boundary can exist. ✓ □ Corollary (Empirical Decidability Implies Scalar Representability). Any comparability structure on admissible transformations that is empirically decidable admits a scalar representation up to strictly monotone transformation. Any non-scalar representation that preserves the same verdict structure collapses to a scalar ordering under equivalence. Scalarity is not an imposed restriction but a consequence of scientific determinacy: for a persistence claim to have a determinate truth condition decidable in principle, its boundary must induce an operationally decidable classification admitting a scalar representation. Therefore scalarity is not optional — it is the minimal invariant of any determinate persistence boundary. Any representation that does not admit such scalarization fails to preserve global comparability and therefore cannot represent a determinate persistence boundary. Lemma 2 (Scalar Representation of the Persistence Boundary). Any total preorder on admissible transformations admits a scalar representation preserving the persistence classification. Proof. A scalar representation is not an additional structure imposed on the boundary. It is the minimal representation of a total decision structure. From Lemma 1 and the Scalar Representability Corollary, admissible transformations are equipped with a total preorder ≤ₚ, and this preorder admits a scalar representation. For any total preorder that is empirically usable — whose equivalence classes are finitely or measurably distinguishable — there exists a real-valued function f such that T₁ ≤ₚ T₂ ⇔ f(T₁) ≤ f(T₂). These conditions are not additional assumptions but consequences of empirical decidability. Specifically: finite empirical discriminability implies countable order-density of the preorder — the existence of a countable subset of equivalence classes that is dense in the ordering. Countable order-density is the minimal regularity condition required by the Debreu representation theorem, and it follows directly from the requirement that persistence verdicts be empirically decidable at finite resolution. No further topological, metric, or continuity assumptions are introduced. The persistence boundary corresponds to a threshold θ: identity-preserving ⇔ f(T) ≤ θ; identity-destroying ⇔ f(T) > θ. No geometric or metric structure is required — the scalar function represents the order structure alone. Any representation that does not admit such scalarization fails to preserve global comparability and therefore cannot represent a determinate persistence boundary. Any non-scalar representation either (i) fails to preserve total comparability, or (ii) contains redundant structure that collapses to the same scalar ordering under equivalence. Therefore every admissible persistence boundary admits a scalar representation. ✓ □ Lemma 3 (Forced Bipartite Decomposition of Persistence Boundaries). A persistence boundary that does not distinguish between transformation pressure and absorption capacity cannot determine persistence: it either collapses into triviality or becomes representation-dependent. Therefore any scalar persistence boundary necessarily decomposes into a comparison between transformation pressure and directed integration capacity: R ≤ IK. Proof. Let f(T) be the scalar representation from Lemma 2, with threshold θ: persistence ⇔ f(T) ≤ θ. A persistence boundary distinguishes two structurally distinct roles: (1) transformation-induced deviation from the identity-defining structure; (2) structural capacity to absorb such deviation without identity loss. This distinction is forced by the nature of the persistence problem. If no distinction is made: Case (i) — f measures only deviation: identical deviations across systems must yield identical persistence verdicts. But systems with different capacities respond differently to the same transformation. Persistence cannot be determined from deviation alone. Case (ii) — f measures only capacity: persistence verdicts are independent of transformation magnitude. All transformations would be always admissible or always inadmissible. The persistence boundary collapses into triviality. Case (iii) — f mixes both without structural separation: the contribution of deviation and absorption cannot be independently evaluated. Persistence verdicts become non-invariant under decomposition of transformations: the same total transformation may yield different results depending on internal representation. This violates admissible representation invariance (Theorem DI2). Therefore any admissible scalar persistence boundary must distinguish: R — a quantity measuring identity-challenging transformation; IK — a quantity measuring identity-preserving integration capacity. Persistence is determined by whether deviation exceeds absorption capacity: R ≤ IK, up to strictly monotone transformation. This decomposition is not a modeling choice but the minimal structure required to distinguish transformation from its admissible absorption. A scalar boundary that does not admit a decomposition into a monotone-increasing transformation term and a monotone-increasing capacity term cannot remain invariant under admissible decomposition of transformations: splitt