Trajectory Code-Ledger Covariance
Abstract
Legal normalized trajectories have unique coordinates and code-ledger identity.
Theorem 1.1 (Legal trajectories have unique codes and binary identity).
Proof. Machine-checked in Lean as D5/S1/Dynamics/TrajectoryCodeLedgerCovariance.legal_trajectory_code_ledger_covariance (✓ std3). ∎
Source. Repository-derived.
Commentary.
A legal event and every state coordinate use the existing finitely supported canonical prime-axis table. The trajectory advances by the existing rowwise normalizer. The theorem states both that its actual next coordinate satisfies the canonical axiswise sum and decoder law, and that any two coordinates satisfying those laws are equal. Thus stepwise uniqueness is not encoded by defining a witness to be the desired result.
The ledger carrier is a rule coordinate paired with the remaining ledger state. Adjacent preservation is iterated to prove that the rule is constant across the orbit. Applying the frozen code-ledger identity theorem then removes that fixed coordinate and yields the binary criterion. The two stated consequences, code change forcing state change and state equality forcing code equality, are exposed separately.
Pinned library searches found generic unique-existence, equivalence injectivity, and product extensionality, but no trajectory theorem on the repository’s prime-axis and ledger carriers. The proof instead composes the frozen unique-normalization and code-ledger declarations; it introduces no new carrier or normalization definition.
References
- Truth anchor:
D5/S1/Dynamics/TrajectoryCodeLedgerCovariance.legal_trajectory_code_ledger_covariance - Dependency: D5/S1/Digit/PrimeAxis/PrimeAxisNormalizationUnique
- Dependency: D5/S1/Dynamics/CodeLedgerIdentity