KEX-WP-03
Ordered Topology and the Projection-Loss Law
Exact counting of distinct histories erased by endpoint or net-zero storage
Abstract
This paper isolates the strongest exact result derived from the KEX topology. Using the adjacency spectrum of the five-vertex path, it proves that the number of closed walks of even length 2m is 2(3^m+1). Every one of these histories has zero net rank displacement, yet each carries a different path. The result supplies a rigorous basis for proof ledgers, rollback histories, graph-genomic paths, and observer-state traces.
1. Problem and scope
Let A be the adjacency matrix of the rank path P5. A^n counts length-n walks. The trace counts all walks that return to their start. Because P5 is bipartite, there are no odd closed walks.
The spectrum {√3,1,0,−1,−√3} yields an exact closed form. This is not empirical and does not depend on a particular software implementation.
The theorem concerns information loss under projection, not the invalidity of zero. The scalar zero correctly reports net displacement; it is simply insufficient to recover history.
2. Formal model
d_K(a,b)=|ρ(b)−ρ(a)|    (1)
C_n = tr(A^n)    (2)
C_{2m}=2(3^m+1), m≥1;   C_{2m+1}=0    (3)
All symbols in these equations are local to this paper unless explicitly imported from Series Paper 01. A compatibility numeral such as zero may appear in ranks, matrices, encodings, distances, statistics, or projected outputs without becoming an untyped KEX active state.
Figure 1. Exact growth in path histories collapsed by net-zero projection.
3. Results and claim register
4. Architecture or state mapping
5. Application and cross-domain translation
A ledger need not retain every low-level event forever, but any compaction must declare which equivalence classes it creates. A reversible checkpoint retains enough prior state or proof to distinguish histories relevant to the application.
Graph-genomic and virtual-world applications inherit this theorem only when their histories are represented as walks on the declared topology. The mapping must be tested rather than assumed.
Cross-domain reuse is accepted only as a structure-preserving mapping. Similar words or diagrams are insufficient: the mapping must preserve identity, allowed transitions, observer/environment terms where relevant, and the authoritative proof boundary.
6. Experimental programme
7. Falsifiers and failure conditions
•	Any mismatch between matrix enumeration and the closed form invalidates the implementation.
•	A claim about a domain that does not preserve path structure is outside this theorem.
•	Hashing endpoints alone does not solve lineage loss.
8. Conclusion
The projection-loss law is a bounded but genuine formal discovery. It gives the KEX proof-ledger doctrine a quantitative target: preserve the distinctions that the chosen projection would otherwise erase.
References
[1] A. Keddeh, KEDDEH THEOREM AND BRAINK VIRTUALISED BIO-ORGANISM, Master Foundation Document v1.9, 2026. Internal source corpus.
[2] D. R. Jefferson, 'Virtual Time,' ACM TOPLAS 7(3), 404–425 (1985). https://doi.org/10.1145/3916.3988
[3] W. W. Liao et al., 'A draft human pangenome reference,' Nature 617, 312–324 (2023). https://doi.org/10.1038/s41586-023-05896-x
[4] KEX/BRAINK White Paper Series v1.0, KEX-WP-03, calculation receipt 31ba82c00739db6ef07e724a863dc317b885622d4eb7a1360bb7702a28b79513.
CENTRAL THESIS
On the five-node KEX path, endpoint-only zero projection collapses an exponentially growing family of distinct transition histories.
Series field
Value
Author and origin authority
A. Keddeh
System lineage
KEX / KEDDEH THEOREM / BRAINK / BRAINK⁶
Series
KEX/BRAINK Modular White Paper Series v1.0
Publication date
19 July 2026
Prerequisite
Series Paper 01
Next research route
Series Papers 04 and 06
STATUS DISCIPLINE
Mathematical validity, engineering performance, and physical correspondence are separate evidence lanes. This paper promotes only the claims that pass its declared gates.
PAPER BOUNDARY
On the five-node KEX path, endpoint-only zero projection collapses an exponentially growing family of distinct transition histories.
ID
Result
Status
P-01
Eight distinct length-2 histories project to net zero.
EXACT
P-02
118,100 length-20 histories project to net zero.
EXACT
P-03
6,973,568,804 length-40 histories project to net zero.
EXACT
Component/state
Function/value
Evidence or interpretation
2
8
0
4
20
0
10
488
0
20
118,100
0
40
6,973,568,804
0
Experiment
Dataset/workload
Acceptance criterion
Matrix enumeration
Lengths 1–40
Trace equals closed form
Independent proof
Spectral and recurrence methods
Same integer sequence
Projection collision
Enumerated closed paths
Distinct native records, common scalar
Compaction policy
Application-specific equivalence
Declared recovery boundary
NON-AGGREGATE GATE
One failed mandatory falsifier blocks promotion even if other tests score highly. Results remain at the highest evidence state for which every required gate passes.
