KEDDEH SYSTEMS | RESEARCH AND FORMAL PUBLISHING | ENGINEER · AUTOMATE · SCALE # Observer Relational Mathematics ## Attached relational powers, observer context and long-form equivalence Document ID: KEDDEH-RESEARCH-ORM-001 Editorial edition: Library R1 · 18 October 2026 Source edition: Publication Extension R1 · 10 October 2026 Research author: Aboudy Keddeh — Systems Architect Publisher: Keddeh Systems Rights holder: Aboudy Keddeh Classification: Internal research · Owner review Status: Editorial research draft; publication approval and independent assessor not recorded Licence profile: KEDDEH-RESERVED-1.0 Architecture, notation and research direction: Aboudy Keddeh. AI-assisted editorial development, source synthesis and document preparation: dot, powered by OpenAI. Authorship, rights ownership and approval are separate records. This edition develops the complete ten-section source into a continuous technical paper without changing its accepted expression. ## 1. Abstract Observer Relational Mathematics asks what a calculation must retain when its expression is built from predecessor-dependent relational groups. Its starting point is **(-3)^(+1) + (-14)^(+1) = (-17)^(+1)**. The parenthesized (+1) groups express lower-level unification and relational power over their attached predecessors. They are neither independent multiplication factors nor permission to apply ordinary exponentiation. [ORM §§1–3] The problem is mathematical and representational. A scalar evaluation can suppress identities, attachments, orientation and observation context that distinguish one construction from another. The source therefore treats the long form as the canonical research record and a numerical evaluation as a separately defined projection. It also distinguishes a relation not represented by an observer from a relation established to be nonexistent. [ORM §§4–5] This edition follows the argument from notation through candidate orientation assignments and recursive observation to implementation and evaluation. The source establishes the accepted notation and preservation rules. Its 10 October text lists operational semantics and algebraic proofs as subsequent work. Linked July papers already define typed-state and projection mechanisms under their own conditions, and later preservation software supplies bounded implementation evidence. Those contributions are incorporated without substituting them for the specific attached relational-power operator. ## 2. Scope and definition register ### 2.1 What the notation carries | Term or symbol | Meaning in this source | Interpretation consequence | |---|---|---| | Predecessor group | A parenthesized predecessor, such as (-3) | Its identity remains bound to its own attached group | | Attached (+1) | Lower-level unification and relational power over the predecessor | No independent multiplication or automatic conventional exponent rule | | Intervening + | Written operation joining the two predecessor-power constructions | Retain operation and operand order | | Output construction | (-17) with attached (+1) in the accepted expression | Retain the authored equality; familiar integer arithmetic is not its native derivation | | Orientation | Proposed positive/negative assignment of a relational unit | Represented positive state does not prove negative impossible | | Observation context | Selected representation, reference and observer assumptions | Context enters interpretation and completeness claims | | Projection | Declared evaluation or representation derived from the long form | State which information is preserved and discarded | | Relational equivalence | Equality under the applicable relational semantics | Equal numeric outputs alone do not establish it | The source has not settled within this edition whether (+1)/(-1) are formally orientations, operators or values in the completed algebra. “Orientation” records the proposed role in §§3 and 6 rather than an editorial resolution of the open typing question in §8. ### 2.2 Current interpretation, dated 18 October 2026 The author's current shared-origin designation is the literal nonnumeric text **.1**. It is not numerical 0.1, integer 1, a host index or a plotting coordinate. It also has a different role from the attached (+1) groups here. Replacing an attached group with .1 would alter the expression rather than clarify it. [CURRENT; STUDY §§2.2–3.1] Current directions distinguish observed entity, observer and observable, with spatial, temporal and instance context and ordered recursive relationships. These distinctions explain the purpose of long-form retention. They do not authorize an additional scalar evaluation rule. Original authored definitions and subsequent corrections take precedence over a familiar formulation imported by AI analogy. ## 3. Relational construction and ordered reasoning ### 3.1 Accepted expression **(-3)^(+1) + (-14)^(+1) = (-17)^(+1).** ORM-1. Exact plain-text source notation. The expression is read in order. Retain (-3) as the first predecessor and bind its immediately following (+1) to it. Retain (-14) as the second predecessor with its own (+1). Preserve the intervening +, the written equality and the output predecessor (-17) with its attached (+1). Retain the source reference and supplied observation context, including explicit unspecified context rather than invented defaults. [ORM §§2, 5; CURRENT] This is a structural reading, not a proof by ordinary exponentiation. Cancelling the attached groups, reducing the expression to -3-14=-17, or replacing them with (+1) multipliers chooses semantics expressly disallowed by the source. The familiar truth of an integer equality does not establish the relational construction's meaning. ### 3.2 Lower-level unification and candidate assignments The source presents two negative predecessor groups at relational power (+1) and an output group also marked (+1). The unit sign is explicit. Suppressing it would remove a distinction the author intends to preserve. Potentiality and actuality remain separate: represented (+1) does not prove (-1) impossible. [ORM §3] | First attached group | Second attached group | Source standing | |---|---|---| | (+1) | (+1) | Represented in ORM-1 | | (+1) | (-1) | Candidate configuration; no output supplied here | | (-1) | (+1) | Candidate configuration; no output supplied here | | (-1) | (-1) | Candidate configuration; no output supplied here | This is the source's research space, not a truth table. The enumeration does not prove all assignments reachable or calculate their outputs. The operational dependency must specify their meaning, admission conditions and observational distinctions before an evaluator may infer an answer. [ORM §6] ### 3.3 Recursive observation The source's principle is **Not observed does not imply nonexistent.** An observer selects a representation and has finite access to relations. A relation missing from that representation is therefore not, on that basis alone, established to be absent from the system. The principle applies recursively to the observer's assumptions and any claim of model completeness. It does not imply that every conceivable relation is true; each candidate needs its own definition and evidence. [ORM §4] ### 3.4 Long-form priority The canonical record retains predecessor, relational superscript, operation, reference and observation context. Any numerical evaluation is a projection of that structure rather than a substitute for it. Its contract must identify what it preserves and discards. Equal projected numbers cannot by themselves establish equality of the relational states. [ORM §5] A completed equivalence relation must therefore state which components it compares, which transformations it permits and how observer context is treated. This does not mean every differently formatted record refers to a different physical entity. It means that equivalence needs the declared relation rather than an unexplained collapse to a scalar. ## 4. Linked definitions, computational contract and example ### 4.1 What the earlier series supplies Mathematical Foundations and Proof Obligations v1.0 supplies a disjoint tagged-state domain, explicit observer/frame/parent/source fields (§§2.1–2.4) and a conditional projection-loss theorem (§4). For a discrete random variable X over typed states and a deterministic projection φ, noninjectivity on X's positive-probability support gives **H(X|φ(X)) > 0**. Here H is Shannon conditional entropy as defined in MATH1 §4.1. Injectivity on that support gives zero conditional entropy; this statement is not a general differential-entropy result. This supplies a precise comparison for information lost by a projection. It does not prove that every observation or every full observer transform is noninjective. [MATH1] Native Algebra and Artifact Verification v4.0 §3.2 supplies a different, numeric aggregation result. Its sorted multiset of signed atomic contributions has a commutative/associative canonical additive reduction while retaining a cancellation ledger. That theorem deliberately forgets input order at its stated projection layer. It cannot replace an ordered observer relation or determine the predecessor-dependent (+1)/(-1) operator. [NATIVE4 §3.2] WP04's rank mirror μ(s)=ρ⁻¹(6−ρ(s)) likewise belongs to its declared five-state rank geometry. It fixes the historical central anchor and preserves rank distance. It is not raw numeric negation and does not define the attached relational groups in ORM-1. [WP04 §2] These are genuine linked definitions; their applicability must be stated rather than treating this extension as a standalone axiom system or merging distinct operations by name. ### 4.2 Proposed implementation boundary The source proposes a typed abstract syntax tree that preserves predecessor identity and relational-power nodes separately, a projection admitted only when semantically defined and authorized, and a verifier comparing structure, provenance and observer assumptions. These are proposed correspondences in the 10 October edition. [ORM §7] | Stage | Retained input | Output or failure requirement | |---|---|---| | Admission | Exact source, edition and supplied context | Retained record or identified malformed/unsupported syntax | | Parsing | Groups, attachments, operations, written order | Recoverable structure without numeric coercion | | Semantic binding | Identified author-defined operation and revision | Applicable semantics or an explicitly unresolved binding | | Evaluation/projection | Bound operator, admitted inputs, intermediate representation | Specified output with lineage or typed rejection; no silent arithmetic substitution | | Equivalence | Complete records and a named relation | Explicit comparison of retained distinctions and permitted transformations | This table is an editorial organization of the proposed boundary. It is not a report that every stage has been deployed. ### 4.3 Editorial worked preservation example Treat ORM-1 as a document object. Retain its first construction (-3) with (+1), second construction (-14) with (+1), and output construction (-17) with (+1), together with the joining + and equality. A reader can reconstruct which group attaches to which predecessor. Now consider an export containing only -3-14=-17. It has lost all three attached groups. A conventional arithmetic reader may recognize a true integer equality, but the export fails this preservation task. The result is “attachment information lost,” not “native algebra verified.” Changing the second attached group to (-1) creates one of the candidate configurations. A preservation system can retain both versions and identify the changed attachment. It cannot derive the new output from ORM-1 alone. This is a new editorial walkthrough of preservation, not a new native derivation or executed test. ## 5. Method and evaluation programme The source §8 obligations have a dependency order. First, define the grammar for predecessor groups, attached groups and operations. Parsing tests should distinguish preserved attachment from reassignment and should reconstruct source signs, grouping and order. Next, bind an evaluation rule that states whether (+1)/(-1) are orientations, operators or values, and specifies admitted domain, outputs, intermediate states, rejection behaviour and context. Linked definitions should be cited with their conditions. Candidate configurations remain unevaluated until their rule is resolved. Then examine closure, associativity or their failure under those declared operations. The source requests these investigations without asserting their outcomes. A counterexample must use the same admitted domain and operation as the claim. Substituting a conventional algebra changes the question. Observer change must be classified as a change of value, representation or admission condition, retaining prior records and naming the altered component. Unobserved context must remain distinguishable from a reported value. Finally, compare expressive power and resource cost with typed syntax trees, provenance systems, epistemic logic and conventional algebra. Novelty is an outcome to establish, not a premise. Compare systems required to preserve the same context and produce the same outputs. Publish counterexamples and independent tests as well as successful cases. [ORM §§8–9] No new software execution is claimed by this editorial edition. The trace of related papers located typed-state, projection and rank-mirror definitions but did not locate a complete attached relational-power evaluator in that inspected set. That is a bounded dependency finding, not a whole-corpus absence claim. Transported arithmetic in the source-correction material is explicitly classified as comparison construction and cannot fill the dependency by silent substitution. ## 6. Results and evidence standing The source's established contribution is its accepted notation, binding rules, long-form priority and observation/existence distinction. It separately classifies proposed algebraic semantics as under formalisation, physical/quantum consequences as unestablished by this document and computational advantage as requiring reproducible benchmark and external comparison. [ORM §9] Later preservation evidence advances part of the engineering question. A retained workbench reports 39 fixed fixtures and 131 nested-browser checks. A separate software review reports 714 checks, including 557 schema mutations and nine asynchronous-input/array-shape cases. These concern exact source, ordered relations, explicit context and identity preservation. They do not evaluate the native attached relational-power operators or establish complete Observer Theorem conformance. [CURRENT; STUDY §6.1] Those receipts show that bounded source-preservation mechanisms have been exercised. They do not settle the algebra through storage alone. The distinction keeps progress cumulative: a preserved expression can later be bound to a source-defined operator while retaining both the definition used and its actual result. ## 7. Discussion and next manuscripts The paper's organizing contribution is the priority of construction over projection. Retain the relationship first, define its operation, specify equivalence, then test scientific or performance consequences against appropriate evidence. Earlier series results can contribute definitions and proofs under their own conditions, while the newer relational-power notation keeps its own operator identity. The original proposed sequence is preserved: - Volume II: Grammar and operational semantics of predecessor-dependent relational powers. - Volume III: Observer-indexed representation and recursion. - Volume IV: Long-form equivalence, lossless projection and counterexample suite. - Volume V: Computer-science implementation and independent adversarial evaluation. - Volume VI: Scientific interpretation, physical measurement and quantum claim boundaries. ORM §10 names these directions; this edition does not claim that all five volumes were found or produced. A dependency register should distinguish a planned title, a retrieved definition, an executed implementation and an independently assessed claim. ## 8. Conclusion and revision control Observer Relational Mathematics makes predecessor attachment and observer context part of the research object. Its accepted expression preserves relational groups; its candidate assignments distinguish representation from possibility; and its long-form rule prevents a projected number from silently replacing the construction that produced it. Library R1 maps all ten source sections into eight research sections, adds a definition register and an explicitly editorial preservation example, links the applicable earlier definitions and records later preservation evidence under its bounded scope. Source documents and software are unchanged. No quadratic formula, native proof, physical result or external approval is invented. ### References and source edition - [ORM] Aboudy Keddeh. Observer Relational Mathematics, Publication Extension R1, 10 October 2026, §§1–10. [Source](https://docs.google.com/document/d/1ibTDjjWLeDcKFclPKWClLs1dElMsjKDPfXal9UmJWhc/edit). Original reviewed capture: 5,133 bytes; SHA-256 1ec31d7690671bf167cf8ba5a5d32a49a24f292c475a5e3afd9ec8c03ee96e50. A separately hashed paragraph recapture was made after workspace recovery; it is not represented as the original byte carrier. - [CURRENT] Aboudy Keddeh. Current author directions retained in Observation and Identity Review R3, current at 18 October 2026. Owner-supplied record. - [MATH1] Mathematical Foundations and Proof Obligations, v1.0, 13 July 2026, §§2 and 4. [Source](https://docs.google.com/document/d/1x3m7DwJbqSFMK4skvzf0pWUXauM-R_gX/edit). - [NATIVE4] Native Algebra and Artifact Verification, v4.0, 14 July 2026, §3.2. [Source](https://docs.google.com/document/d/1sz_cntJj0g1eqbSBrEGnC9gjjR1Jqp9p/edit). - [WP04] Bilateral Rebound and Recursive Geometry, KEX-WP-04, 19 July 2026, §2. [Source](https://docs.google.com/document/d/1wDHj3WDkHuL3dLHA832dciffqeXQwYRi/edit). - [CORR] Shared-Origin Research: Source Interpretation Corrections, E1, 16 October 2026, opening correction. [Source](https://docs.google.com/document/d/1Zy6UFShKONxd6EHzq3afc3UgaTfhkILJAVeOg3oHhYM/edit). Transported constructions are comparisons, not replacement native definitions. - [STUDY] From Observation to Governed Computation, R1, 18 October 2026, §§2–3 and 6; retained study and source register. - [PUBLISHING] Keddeh Research and Formal Publishing Standard, KEDDEH-STD-PUBLISHING-001, v1.0. © 2026 Aboudy Keddeh | Keddeh Systems | All rights reserved KEDDEH-RESEARCH-ORM-001 | Library R1 | Internal research · Owner review | Draft KEDDEH-RESERVED-1.0. No licence is granted. Separate written permission governs reuse, redistribution and implementation, subject to applicable law. Third-party material retains its rights. No copyright assignment, patent or trademark licence, or independent approval is asserted.