# KEX Active-State Foundations Retained-source reading edition · 18 October 2026 Source author: A. Keddeh. Source version: 19 July 2026. Publisher: Keddeh Systems. ## Reading context Series Paper 01 supplies the proof-bearing-state and cross-domain mapping background used in Sections 4 and 8 of the central study. Its historical notation is retained. A proof obligation in this source does not by itself certify an implementation or a physical measurement. The complete retained plain-text capture follows. Paragraph spacing and heading levels are editorial reading aids. No source wording, mathematical expression or line order has been changed; the original capture is also retained byte for byte. This is the recovered text layer, not a claim to reproduce unavailable original document layout, omitted tables or media. [Source document](https://docs.google.com/document/d/1m2ipz_7dwt6t3Qeyhmnp3hkD6FTJ01ve/edit). ## Retained source KEX-WP-01 KEX Active-State Foundations A typed algebraic basis for identity, transition, boundary, and projection ### Abstract This paper establishes the shared mathematical language for the KEX/BRAINK series. It distinguishes active coordinates from compatibility projections, defines the ordered state space {−3,−2,1,+2,+3}, fixes 1 as the identity anchor, and gives the rank, transition, mirror, and proof-bearing state objects used by later papers. Its principal contribution is type separation: position, payload, measurement, absence, balance, and invalidity are different objects. The paper proves finite metric and mirror properties inside the declared axiom system and states the precise boundary between formal mathematics and physical claims. ### 1. Problem and scope The source doctrine uses both the signed sequence −3|−2|1|+2|+3 and the role projection 3|2|1|2|3. The first retains direction; the second retains bilateral role. They become compatible once labels, ranks, and role magnitudes are explicitly separated. An active state record is not merely a number. It carries entity identity, state label, payload, observer, environment, transition path, rule version, and proof head. This prevents the same payload from being confused with the position at which it is processed. Conventional zero remains available for arithmetic and compatibility. It is not admitted as an untyped live coordinate. Later papers refine the zero-like variants and projections. ### 2. Formal model S_active = {−3, −2, 1, 2, 3}, −3 ≺ −2 ≺ 1 ≺ 2 ≺ 3 (1) ρ(−3)=1, ρ(−2)=2, ρ(1)=3, ρ(2)=4, ρ(3)=5 (2) X_t = ⟨id,q_t,payload_t,observer_t,environment_t,path_t,rule_t,proof_t⟩ (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. Ordered active-state topology and rank roles. ### 3. Results and claim register ### 4. Architecture or state mapping ### 5. Application and cross-domain translation Every later domain mapping must preserve the anchor, adjacency, orientation, and commit order. A genomic locus, virtual machine, game entity, and cosmological observation may share this state grammar without being claimed to share physical substance. The primary research value is a disciplined intermediate representation. It can be compiled into ordinary host types while retaining a native record that makes loss and projection visible. 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 • A rank assignment that is not injective invalidates the metric construction. • A domain mapping that sends two active roles to one untyped value fails structural preservation. • Any claim of physical superiority based solely on renaming states is rejected. ### 8. Conclusion The five-state system is a valid finite typed topology. Its usefulness beyond formalisation must be earned by implementations and measurements, which the remaining papers isolate by sector. References [1] A. Keddeh, KEDDEH THEOREM AND BRAINK VIRTUALISED BIO-ORGANISM, Master Foundation Document v1.9, 2026. Internal source corpus. [2] KEX_STRICTLY_ACCOUNTED_ENVIRONMENT_WORKBOOK.xlsx, 2026. Internal evidence-control workbook. [3] KEX/BRAINK White Paper Series v1.0, KEX-WP-01, calculation receipt 31ba82c00739db6ef07e724a863dc317b885622d4eb7a1360bb7702a28b79513. CENTRAL THESIS KEX is technically coherent when its five symbols are treated as ordered state labels with a rank topology, not as ordinary integers under undeclared arithmetic. 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 None Next research route Series Papers 02–05 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 KEX is technically coherent when its five symbols are treated as ordered state labels with a rank topology, not as ordinary integers under undeclared arithmetic. ID Result Status F-01 Rank distance is a metric on the five active labels. FORMALISED F-02 The anchor is the unique centre of the ordered rank topology. FORMALISED F-03 Changing labels alone does not change hardware or physical law. BOUNDARY Component/state Function/value Evidence or interpretation −3 Ingress boundary external event or unadmitted source −2 Inbound transition decode, validate, translate, restore 1 Identity anchor authoritative entity, source, or runtime root +2 Outbound transition execute, update, transform +3 Commit boundary emit, checkpoint, export, evidence Experiment Dataset/workload Acceptance criterion Exhaustive state check All five states and 25 ordered pairs Exact rank and distance table Transition closure All adjacent transitions Target remains in S_active Host decoding Zero/default/invalid inputs Rejected or typed; never silently active Cross-language parity Two independent implementations Canonical record equality 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.