> Full-text translation from Chinese. The original remains authoritative for its research claims; this translation is not independent mathematical verification. # X4-DMSD P1: Exact X4 Joint Algebra **Exact X–Four-Edge Joint Algebra for Coupled Perfect-Cuboid Search** Version: v0.1 Series: X4-DMSD Phase: P1 Nature: Exact joint algebra / Pythagorean seed canonicalization / shared-edge coupling theorem Canonical source of the original: UTF-8 Markdown --- ## Abstract X4-DMSD P0 reframed Perfect Cuboid search as: $$ \text{Exact X4 Joints} \rightarrow \text{Shared-Edge Coupling} \rightarrow \text{PerfectClick}. $$ P1's task is to algebraize this "mortise-and-tenon coupling" completely. This paper first proves that a rectangular face's diagonal–edge angle and diagonal-X crossing angle can both be represented exactly by rational fingerprints, without floating-point trigonometric functions. Next, the primitive Pythagorean triple: $$ (m^2-n^2,2mn,m^2+n^2) $$ can serve as an X4 joint's canonical seed. A common integer scale does not change the joint fingerprint. The most important result of this paper is the **Triple-Joint Coupling Theorem**. Let three oriented primitive Pythagorean face joints be: $$ J_{ab}=(A,B,H_{ab}), $$ $$ J_{ac}=(A',C,H_{ac}), $$ $$ J_{bc}=(B',C',H_{bc}). $$ There exist positive rational scales: $$ k_{ab},k_{ac},k_{bc} $$ making the three share exactly: $$ a,b,c $$ if and only if: $$ \boxed{ ACB'=BC'A'. } $$ Moreover, if this identity holds, rational scales not only exist: one can directly take the integer witness: $$ \boxed{ k_{ab}=A'B', \qquad k_{ac}=AB', \qquad k_{bc}=BA'. } $$ Any compatible triple of local Pythagorean joints can therefore construct an Euler brick exactly, yielding a primitive representative after common gcd reduction. Conversely, after primitive reduction of an Euler brick's three face triples, they must satisfy this coupling identity. Thus: $$ \boxed{ \text{Euler brick} \iff \text{exactly compatible triple of oriented primitive X4 joints}. } $$ A Perfect Cuboid adds one body Pythagorean gate: $$ d_{ab}^2+c^2=g^2. $$ PerfectClick can therefore be viewed as: $$ \boxed{ \text{three face X4 joints} + \text{one body joint} } $$ an exact four-joint motif. This paper also includes an exact Python prototype, using the classical Euler brick: $$ (44,117,240) $$ to validate the entire local-to-global construction. --- # 1. Local Rectangle-X World For a rectangular face, let its ordered edge lengths be: $$ u,v>0. $$ If the diagonal: $$ h $$ satisfies: $$ u^2+v^2=h^2, $$ establish a local X4 joint: $$ J^{X4}(u,v;h). $$ "Ordered" is important. Because: $$ (u,v) $$ and: $$ (v,u) $$ are the same unlabelled rectangle shape, but may respectively correspond in a cuboid world to: $$ (a,b) $$ and: $$ (b,a). $$ --- # 2. Four-Edge Semantics A rectangle's four edges are not four independent length variables. They form two opposite-edge classes: $$ (E_u^{(1)},E_u^{(2)}), $$ $$ (E_v^{(1)},E_v^{(2)}), $$ where: $$ |E_u^{(1)}| = |E_u^{(2)}| = u, $$ $$ |E_v^{(1)}| = |E_v^{(2)}| = v. $$ X4 algebra can therefore compress four physical edge slots into: $$ (u,v) $$ plus slot/orientation metadata. --- # 3. Edge-Angle Fingerprint Let the acute angle between the face diagonal and the $u$ edge be: $$ \theta. $$ Then: $$ \cos\theta=\frac uh, $$ $$ \sin\theta=\frac vh. $$ Define: $$ \boxed{ \chi(u,v;h) = \left( \frac uh,\frac vh \right). } $$ The complementary interface for the other edge class: $$ \chi^\perp = \left( \frac vh,\frac uh \right). $$ --- # 4. Four-Edge Interface Signature The whole rectangle's four diagonal–edge interfaces can therefore be canonically represented as: $$ \boxed{ \Omega_{4E}(J) = ( \chi, \chi^\perp, \chi, \chi^\perp ). } $$ Opposite edges have identical local angle signatures. This is the exact form of "four-edge angles" in X4. --- # 5. Exact Angle Lock For two ordered directions: $$ (u_1,v_1), $$ $$ (u_2,v_2), $$ their angles are exactly equal if and only if: $$ \frac{v_1}{u_1} = \frac{v_2}{u_2}. $$ Thus: $$ \boxed{ v_1u_2=v_2u_1. } $$ There is no need at all for: $$ \arctan $$ or tolerance. --- # 6. Proposition P1-A: Cross-Product Angle Criterion For positive ordered edge pairs: $$ (u_1,v_1), (u_2,v_2), $$ the following are equivalent: $$ \theta_1=\theta_2, $$ $$ \frac{v_1}{u_1} = \frac{v_2}{u_2}, $$ $$ v_1u_2=v_2u_1. $$ Angle lock is therefore an exact integer/rational predicate. --- # 7. X Crossing Fingerprint Direction vectors of the rectangle's diagonals: $$ d_+=(u,v), $$ $$ d_-=(u,-v). $$ Define the oriented crossing-angle fingerprint: $$ \boxed{ \Xi(u,v) = \left( \frac{u^2-v^2}{u^2+v^2}, \frac{2uv}{u^2+v^2} \right). } $$ Because: $$ u^2+v^2=h^2, $$ this can also be written as: $$ \Xi(u,v) = \left( \frac{u^2-v^2}{h^2}, \frac{2uv}{h^2} \right). $$ --- # 8. Double-Angle Structure If: $$ \chi=(c,s) $$ where: $$ c=\frac uh, $$ $$ s=\frac vh, $$ then: $$ \boxed{ \Xi = (c^2-s^2,2cs). } $$ That is, the double-angle map on the rational unit circle. --- # 9. The X-Key Is Another Pythagorean Key Identity: $$ (u^2-v^2)^2+(2uv)^2=(u^2+v^2)^2. $$ The integer tuple: $$ \boxed{ XKey(u,v) = (u^2-v^2,2uv,h^2) } $$ is therefore itself a Pythagorean-triple-like object. This allows the X crossing angle directly to be: - reduce； - hash； - modularize； - indexed by DMSD. --- # 10. Acute and Oriented X-Keys If one swaps: $$ u\leftrightarrow v, $$ then: $$ u^2-v^2 $$ changes sign. Thus, define: ### Oriented X-Key Retains the sign: $$ K_X^\rightarrow. $$ ### Acute X-Key Takes: $$ |u^2-v^2|. $$ The former is used for global edge-role coupling; the latter for unlabelled shape indexing. --- # 11. Proposition P1-B: X4 Similarity Completeness For positive rectangles, the following are equivalent: 1. The ordered shapes are similar; 2. The edge ratios agree; 3. $\chi$ agrees; 4. The oriented X4 angle signatures agree. Thus: $$ \boxed{ \chi } $$ is already a complete exact key for an ordered rectangle similarity class. $\Xi$ provides a redundant but useful X-crossing certificate. --- # 12. Primitive Pythagorean Seed A primitive face: $$ u^2+v^2=h^2 $$ can be written uniquely as: $$ u_{\mathrm{odd}} = m^2-n^2, $$ $$ u_{\mathrm{even}} = 2mn, $$ $$ h = m^2+n^2, $$ where: $$ m>n>0, $$ $$ \gcd(m,n)=1, $$ $$ m\not\equiv n\pmod2. $$ --- # 13. Orientation Bit The same primitive triple has two ordered role assignments: ### Odd-First $$ (u,v) = (m^2-n^2,2mn). $$ ### Even-First $$ (u,v) = (2mn,m^2-n^2). $$ Thus, the canonical local seed is: $$ \boxed{ K_{\mathrm{seed}} = (m,n,\sigma), } $$ where: $$ \sigma\in\{\mathrm{odd\ first},\mathrm{even\ first}\}. $$ --- # 14. Proposition P1-C: Scale-Invariant Seed Recovery If: $$ (U,V,H) = k(u,v,h) $$ for: $$ k\in\mathbb Z_{>0}, $$ first divide by: $$ \gcd(U,V,H) $$ to recover the same: $$ (m,n,\sigma). $$ Thus: $$ \boxed{ \text{common scale does not duplicate X4 shape state}. } $$ --- # 15. Exact Seed Recovery A primitive triple has exactly one odd leg and one even leg. Let the odd leg be: $$ o. $$ Then: $$ m^2 = \frac{h+o}{2}, $$ $$ n^2 = \frac{h-o}{2}. $$ Thus: $$ m,n $$ can be recovered exactly as integer square roots. --- # 16. Local Joint Object P1 formally writes the local joint as: $$ \boxed{ J = ( m,n,\sigma; u,v,h; \chi,\Xi,\Omega_{4E} ). } $$ Every theorem-relevant field can be reconstructed exactly. Serialization therefore need not store a floating-point angle. --- # 17. Three Cuboid Face Joints Define: $$ J_{ab} = (A,B,H_{ab}), $$ $$ J_{ac} = (A',C,H_{ac}), $$ $$ J_{bc} = (B',C',H_{bc}). $$ Each tuple is an oriented primitive Pythagorean joint. Note: $$ A $$ and: $$ A' $$ need not be equal. They are merely the $a$-role legs in their respective primitive local shapes. The actual global edge is determined by local scale. --- # 18. Shared-Edge Scale Equations Given positive scales: $$ k_{ab}, k_{ac}, k_{bc}. $$ Global shared-edge requirements: $$ k_{ab}A = k_{ac}A', $$ $$ k_{ab}B = k_{bc}B', $$ $$ k_{ac}C = k_{bc}C'. $$ --- # 19. Pairwise Scale Ratios The first two equations give: $$ \frac{k_{ac}}{k_{ab}} = \frac{A}{A'}, $$ $$ \frac{k_{bc}}{k_{ab}} = \frac{B}{B'}. $$ The third requires: $$ \frac{k_{bc}}{k_{ac}} = \frac{C}{C'}. $$ --- # 20. Triple-Ratio Cycle Thus: $$ \frac{A}{A'} \cdot \frac{C}{C'} \cdot \frac{B'}{B} = 1. $$ That is: $$ \boxed{ ACB' = BC'A'. } $$ This is the central exact equation of X4's three-face mortise-and-tenon coupling. --- # 21. Theorem P1-D: Triple-Joint Coupling Theorem For three positive oriented local Pythagorean joints: $$ J_{ab}, J_{ac}, J_{bc}, $$ there exist positive rational scales: $$ k_{ab},k_{ac},k_{bc} $$ making the three pairs of shared edges agree exactly if and only if: $$ \boxed{ ACB' = BC'A'. } $$ --- # 22. Proof: Necessary If scales exist, from: $$ k_{ac} = k_{ab}\frac{A}{A'}, $$ and: $$ k_{bc} = k_{ab}\frac{B}{B'}, $$ substitute into the third equation: $$ k_{ac}C = k_{bc}C', $$ to obtain: $$ k_{ab}\frac{A}{A'}C = k_{ab}\frac{B}{B'}C'. $$ Cancel: $$ k_{ab}>0, $$ to get: $$ ACB' = BC'A'. $$ --- # 23. Proof: Sufficient If: $$ ACB'=BC'A', $$ take directly: $$ \boxed{ k_{ab}=A'B', } $$ $$ \boxed{ k_{ac}=AB', } $$ $$ \boxed{ k_{bc}=BA'. } $$ Then: $$ k_{ab}A = AA'B' = k_{ac}A', $$ $$ k_{ab}B = A'BB' = k_{bc}B', $$ and: $$ k_{ac}C = AB'C = BA'C' = k_{bc}C' $$ holds by the coupling identity. An integer-scale witness therefore exists directly. Q.E.D. --- # 24. This Is Stronger Than "Solving for Scales" A usual approach might first solve a rational linear system. P1-D shows that no numerical solver is needed at all. Only an integer equality is needed: $$ \boxed{ ACB' \stackrel{?}{=} BC'A'. } $$ If false: $$ \operatorname{LOCK}_{3F}=0. $$ If true: an integer construction is available directly. --- # 25. Euler-Brick Constructor When P1-D holds, define the raw global edges: $$ a = AA'B', $$ $$ b = A'BB', $$ $$ c = AB'C. $$ By compatibility: $$ AB'C = BA'C', $$ the third edge is therefore consistent across all local faces. --- # 26. Face Diagonals $$ d_{ab} = A'B'H_{ab}, $$ $$ d_{ac} = AB'H_{ac}, $$ $$ d_{bc} = BA'H_{bc}. $$ All are therefore integers. --- # 27. Theorem P1-E: A Compatible Triple Produces an Euler Brick Any three local primitive Pythagorean joints satisfying P1-D produce, via the integer scales above: $$ (a,b,c,d_{ab},d_{ac},d_{bc}) \in \mathbb Z_{>0}^6 $$ and: $$ a^2+b^2=d_{ab}^2, $$ $$ a^2+c^2=d_{ac}^2, $$ $$ b^2+c^2=d_{bc}^2. $$ This still holds after dividing out the common gcd. --- # 28. Converse Any Euler brick: $$ (a,b,c) $$ has three integer Pythagorean faces. Dividing each face by the gcd of its face triple gives three oriented primitive local joints. The original brick's three local scales are themselves a shared-edge scale witness. P1-D must therefore hold. Thus, in X4 algebra: $$ \boxed{ \text{Euler Brick} \iff \text{Compatible Triple of Primitive Oriented Face Joints}. } $$ This is a representation equivalence, not claimed as a new classical theorem. --- # 29. Validation with a Known Euler Brick Take: $$ (a,b,c) = (44,117,240). $$ Face diagonals: $$ 125, 244, 267. $$ Primitive local joints: $$ J_{ab} = (44,117,125), $$ $$ J_{ac} = (11,60,61), $$ $$ J_{bc} = (39,80,89). $$ --- # 30. Coupling Check $$ A=44, $$ $$ B=117, $$ $$ A'=11, $$ $$ C=60, $$ $$ B'=39, $$ $$ C'=80. $$ Left-hand side: $$ ACB' = 44\cdot60\cdot39 = 102960. $$ Right-hand side: $$ BC'A' = 117\cdot80\cdot11 = 102960. $$ Thus: $$ \operatorname{LOCK}_{3F}=1. $$ --- # 31. Explicit Scales P1-D gives: $$ k_{ab} = 11\cdot39 = 429, $$ $$ k_{ac} = 44\cdot39 = 1716, $$ $$ k_{bc} = 117\cdot11 = 1287. $$ This produces the original Euler brick multiplied by: $$ 429 $$ that scale. Common gcd reduction returns exactly to: $$ \boxed{ (44,117,240). } $$ The prototype has replayed this result. --- # 32. Role-Swap Negative Control If: $$ J_{bc} = (39,80,89) $$ is incorrectly swapped to: $$ (80,39,89), $$ the local Pythagorean condition still holds. But: $$ ACB' \neq BC'A'. $$ global coupling therefore fails immediately. This demonstrates: $$ \boxed{ \text{local shape validity} \neq \text{global role compatibility}. } $$ --- # 33. Body Joint Compatibility of the three face joints gives only an Euler brick. A Perfect Cuboid additionally requires: $$ a^2+b^2+c^2=g^2. $$ Because: $$ a^2+b^2=d_{ab}^2, $$ this is equivalent to: $$ \boxed{ d_{ab}^2+c^2=g^2. } $$ --- # 34. Fourth Pythagorean Joint Therefore, define the global body joint: $$ \boxed{ J_g = (d_{ab},c,g). } $$ If it closes, then: $$ \operatorname{PerfectClick}=1. $$ Equivalently, one can use: $$ (d_{ac},b,g) $$ or: $$ (d_{bc},a,g). $$ --- # 35. Proposition P1-F: One Body Joint Is Enough Given that the three face Pythagorean constraints hold, the following are mutually equivalent: $$ d_{ab}^2+c^2=g^2, $$ $$ d_{ac}^2+b^2=g^2, $$ $$ d_{bc}^2+a^2=g^2, $$ $$ a^2+b^2+c^2=g^2. $$ Only one body joint therefore needs an exact test. --- # 36. The Four-Joint Form of PerfectClick A Perfect Cuboid can therefore be rewritten as: $$ \boxed{ J_{ab} \bowtie J_{ac} \bowtie J_{bc} \bowtie J_g. } $$ The first three joints determine Euler-brick face closure. The fourth joint determines body closure. --- # 37. Global Body Angle Fingerprint The body joint also has: $$ \chi_g = \left( \frac{d_{ab}}g, \frac cg \right). $$ A Perfect Cuboid therefore ultimately remains an exact angle / ratio joint problem, not a near-square problem. --- # 38. X4 Motif Graph One can take: $$ J_{ab}, J_{ac}, J_{bc}, J_g $$ as four nodes. Shared quantities serve as typed edges: - $a$; - $b$; - $c$; - $d_{ab}$. A Perfect Cuboid becomes an exact typed motif. --- # 39. Why This Matters for DMSD P0's DMSD blocks should not index arbitrary: $$ (a,b,c). $$ P1 now provides smaller exact algebraic keys: $$ (m,n,\sigma), $$ $$ \chi, $$ $$ \Xi, $$ and the triple-coupling invariant: $$ \boxed{ ACB'-BC'A'. } $$ All of these can be used in block-level summaries. --- # 40. Block-Level Coupling Key A local-joint block can store possible primitive leg-role sets: $$ \mathcal A, \mathcal B, \mathcal H. $$ Before materialization, three blocks can test: $$ 0 \in \mathcal A\mathcal C\mathcal B' - \mathcal B\mathcal C'\mathcal A'. $$ If an exact summary proves this cannot be: $$ 0, $$ the entire hyperblock can be pruned. --- # 41. Ratio-Cycle Key Reduced ratios can also be stored: $$ R_a=\frac{A}{A'}, $$ $$ R_b=\frac{B}{B'}, $$ $$ R_c=\frac{C}{C'}. $$ Compatibility: $$ \boxed{ R_aR_c=R_b. } $$ This suits: - rational hash； - prime valuation summary； - modular projection. --- # 42. Valuation Form For any prime: $$ p, $$ the coupling identity requires: $$ v_p(A) + v_p(C) + v_p(B') = v_p(B) + v_p(C') + v_p(A'). $$ Thus, disjoint block-level valuation intervals allow sound pruning. --- # 43. Modular Form For a modulus: $$ M, $$ a necessary condition is: $$ ACB' \equiv BC'A' \pmod M. $$ DMSD blocks can therefore store residue masks for each leg role first. --- # 44. Exact Hash Canonical local-joint serialization can use: ```text m n orientation primitive_first primitive_second hyp chi x_key_oriented ``` Its hash is independent of common scale. --- # 45. Duplicate Elimination If: $$ (3,4,5) $$ and: $$ (3000,4000,5000) $$ are input, both have canonical seed: $$ (2,1,\mathrm{odd\ first}). $$ The local shape is therefore stored only once. --- # 46. The Actual Search-Space Variables After P1, the first-layer variables are not: $$ a,b,c. $$ but three instances of: $$ (m_i,n_i,\sigma_i) $$ and an exact coupling identity. The perfect gate then adds the fourth body seed or a square test. --- # 47. Search Pipeline This can be written as: $$ \boxed{ \text{Seed} \rightarrow \text{Joint} \rightarrow \text{Role Assignment} \rightarrow \text{Triple Coupling} \rightarrow \text{Euler Brick} \rightarrow \text{Body Joint} \rightarrow \text{PerfectClick}. } $$ --- # 48. P1 Prototype This artifact includes: `x4_joint_algebra.py` Implementing: - primitive seed generation; - scaled triple canonicalization; - $\chi$; - oriented / acute X-key; - four-edge interface signature; - exact angle equality; - triple coupling; - explicit scale witness; - Euler-brick constructor; - body-joint gate. --- # 49. Prototype Validation Automatic validation: - Multiple primitive seeds; - Scales: $$ 1,2,7,101; $$ - canonical seed invariance; - $\chi$ invariance; - $\Xi$ invariance; - exact angle cross-product gate; - Euler brick: $$ (44,117,240); $$ - role-swap rejection; - four-edge opposite-pair semantics; - body-joint negative control. --- # 50. Validation Boundary The prototype does not contain: - huge-scale DMSD; - block pruning; - distributed search; - a Perfect Cuboid witness; - exhaustive Euler-brick enumeration. P1 validates only the algebra itself. --- # 51. Summary of P1's Core Propositions ### P1-A Angle equality can be decided exactly by cross multiplication. ### P1-B $\chi$ is a complete key for the ordered rectangle similarity class. ### P1-C The primitive Pythagorean seed is invariant under common scale. ### P1-D The three face joints are shared-edge compatible if and only if: $$ ACB'=BC'A'. $$ ### P1-E A compatible triple generates an Euler brick exactly. ### P1-F Given three-face closure, one body Pythagorean joint suffices to determine perfect closure. --- # 52. Final Algebraic Translation of "Mortise-and-Tenon Coupling" P0's language: > A little too much is unacceptable; a little too little is unacceptable. P1 now translates it into: ### Local $$ u^2+v^2=h^2. $$ ### Angle $$ v_1u_2=v_2u_1. $$ ### X $$ \Xi \text{ exact equality}. $$ ### Triple Face Coupling $$ \boxed{ ACB'=BC'A'. } $$ ### Body $$ d_{ab}^2+c^2=g^2. $$ All are exact equalities. --- # 53. Direct Output Interface to DMSD The next-phase DMSD need not understand a geometry renderer. It needs only to read: ```text seed_key role leg_values angle_key x_key residue_summary valuation_summary coupling_key ``` Geometry has therefore been compiled into arithmetic joint algebra. --- # 54. Claim Boundary P1 has completed: - exact local X4 semantics; - four-edge interface; - angle / X fingerprints; - primitive seed canonicalization; - shared-edge scale equations; - necessary-and-sufficient triple-coupling theorem; - integer-scale witness; - Euler-brick constructor equivalence; - body fourth-joint formulation; - exact executable prototype. P1 has not yet proved: - X4-DMSD search efficiency; - DMSD block soundness; - huge-scale compression; - Perfect Cuboid existence; - any novelty claim for a new Euler-brick theorem. --- # 55. Conclusion P1 compresses X4-DMSD's central intuition: > Can three geometric pieces actually "click" together? into a very simple integer identity: $$ \boxed{ ACB'=BC'A'. } $$ If this equation holds, the three local Pythagorean X4 joints can be jointly scaled exactly into an Euler brick. If it does not, common scaling cannot repair it, however large the order of magnitude. The X4-DMSD objects genuinely worth subsequent multiscale search are therefore no longer arbitrary combinations of all Pythagorean triples, but: $$ \boxed{ \text{Joint blocks that may satisfy the triple-coupling identity.} } $$ Finally, use the fourth body joint: $$ \boxed{ d_{ab}^2+c^2=g^2 } $$ to complete: $$ \operatorname{PerfectClick}=1. $$ This is the first-version closure of Exact X4 Joint Algebra. --- ## Next Phase **X4-DMSD P2 — Shared-Edge Scale Coupling Engine** P2 should turn P1-D into a genuinely efficient join engine: 1. joint indexing; 2. role-aware keys; 3. ratio-cycle hash; 4. valuation signatures; 5. modular signatures; 6. pair join; 7. triple join; 8. duplicate quotient; 9. Euler-brick regeneration; 10. baseline comparison. Only after P2 is complete should the engine enter DMSD multiscale blocks.