> Full-text translation from Chinese. The original remains authoritative for its research claims; this translation is not independent mathematical verification. # Trajectory-Information Freedom Verification Methodology for the Perfect Cuboid **English title:** Trajectory-Information Freedom Verification for the Perfect Cuboid **Abbreviation:** TIFV **Status:** Methodology Draft / Research Framework **Version:** v0.2 **Date:** 2026-10-06 **Author / Research Context:** Neo.K / EveMissLab --- ## Abstract This paper proposes and extends a candidate-verification method for Perfect Cuboid research: **Trajectory-Information Freedom Verification** (TIFV). The method does not attempt to restate existing Pythagorean conditions through another algebraic identity, nor does it directly replace elliptic curves, cover sieves, square-value gates, finite-prime sieves or other arithmetic-geometric tools. Its purpose is to supplement an information layer that may be eliminated in static projections: **path information, information transport, intersection domains and global closure formed as a geometric object's full degrees of freedom unfold.** The central perspective is that traditional Diophantine representations usually compress candidate objects into a set of static variables and equations, for example: $$ F_i(X)=0. $$ However, as a geometric object unfolds, folds back, is projected, switches coordinates and exchanges face and diagonal channels, it may follow a higher-dimensional information trajectory: $$ \widetilde\gamma:[0,1]\rightarrow\widetilde{\mathcal M}, $$ while traditional equations observe only its projection: $$ \pi:\widetilde{\mathcal M}\rightarrow\mathcal M. $$ If path information exists before projection that cannot be recovered from the starting and ending points alone, then studying only: $$ \pi(\widetilde\gamma(0)),\qquad \pi(\widetilde\gamma(1)) $$ may miss information needed for global closure. TIFV's actual research object is therefore not the "circle" itself, but: > Whether the local metric information, global path information, transformation history and arithmetic closure of the same candidate geometric entity, after full freedom expansion, can jointly lift to one consistent global state. This paper formalizes that question as a research framework involving lifted configuration spaces, path functionals, holonomy, trajectory signatures and global closure defects. --- ## 1. Problem Background Let a cuboid's three edges be: $$ a,b,c>0. $$ A Perfect Cuboid requires the existence of: $$ d_{ab},d_{ac},d_{bc},g\in\mathbb Z_{>0} $$ such that: $$ a^2+b^2=d_{ab}^2, $$ $$ a^2+c^2=d_{ac}^2, $$ $$ b^2+c^2=d_{bc}^2, $$ and: $$ a^2+b^2+c^2=g^2. $$ Merely rearranging the equations, for example: $$ g^2-d_{ab}^2=c^2, $$ produces no new information; it remains an algebraic restatement of the original static conditions. This method therefore requires an additional verification layer that depends on more than endpoint values. --- ## 2. From Pointwise Equations to Lifted State A traditional description can represent a candidate as: $$ X=(a,b,c,d_{ab},d_{ac},d_{bc},g)\in\mathcal M. $$ In a complete geometric unfolding, however, the actual instantaneous state may also include: - Position; - Orientation; - Local coordinate frame; - Unfolding order; - Face and diagonal channels; - Intersection relations; - Degree-of-freedom state; - Transformation history; - Arithmetic labels; - Group action or cover state when necessary. Introduce a larger lifted state space: $$ \widetilde{\mathcal M}. $$ and define a projection: $$ \pi:\widetilde{\mathcal M}\rightarrow\mathcal M. $$ A complete unfolding trajectory is written as: $$ \widetilde\gamma:[0,1]\rightarrow\widetilde{\mathcal M}. $$ whereas traditional static equations usually examine only: $$ \gamma=\pi\circ\widetilde\gamma. $$ This means that different lifted trajectories may satisfy: $$ \pi(\widetilde\gamma_1(0)) = \pi(\widetilde\gamma_2(0)), $$ and: $$ \pi(\widetilde\gamma_1(1)) = \pi(\widetilde\gamma_2(1)), $$ while still having: $$ \widetilde\gamma_1\neq\widetilde\gamma_2. $$ Thus, **matching starting and ending points does not imply matching information trajectories.** --- ## 3. Trajectory Information, Not Merely Trajectory Shape An early intuition can begin with rotation about the center. For a two-dimensional rectangle, the distance from the center to a vertex is: $$ R^2= \left(\frac a2\right)^2 + \left(\frac b2\right)^2. $$ Under rigid rotation alone, a vertex trajectory naturally forms: $$ x^2+y^2=R^2. $$ But this holds for any fixed vector, so it cannot distinguish perfect from non-perfect candidates. TIFV therefore explicitly excludes the following incorrect simplification: $$ \text{Closed circle} \Longrightarrow \text{New verification information}. $$ This does not hold in general. What must actually be preserved is the information carried along the trajectory: $$ \mathcal I[\widetilde\gamma], $$ rather than merely its geometric shape. The central object is therefore: $$ \boxed{ \text{trajectory geometry} + \text{transported information} }. $$ --- ## 4. Path Functionals and Information Quantities If information is only a point function: $$ I(X), $$ the process itself may be ignored entirely. TIFV instead uses a functional of the entire path: $$ I[\widetilde\gamma]. $$ The simplest form can be written as: $$ I[\widetilde\gamma] = \int_{\widetilde\gamma}\omega, $$ where $\omega$ is an information form defined on the lifted state space. If: $$ \omega=df, $$ then: $$ \int_{\widetilde\gamma}\omega = f(\widetilde\gamma(1))-f(\widetilde\gamma(0)), $$ and the information again degenerates to an endpoint difference. Candidate quantities with genuine path-information gain should therefore prioritize structures that cannot be fully reduced to endpoint functions. For a closed trajectory, one can examine: $$ \oint_{\widetilde\gamma}\omega. $$ If there exists a valid closed path such that: $$ \oint_{\widetilde\gamma}\omega\neq0, $$ then, even when: $$ \widetilde\gamma(0)=\widetilde\gamma(1), $$ the path still carries information that cannot be recovered from its endpoints alone. --- ## 5. Holonomy as a Candidate Quantity for Global Closure If each segment of geometric unfolding applies an internal-state transformation: $$ T_1,T_2,\ldots,T_n, $$ the complete circuit gives: $$ H_\Gamma = T_nT_{n-1}\cdots T_1. $$ $H_\Gamma$ can be regarded as a discrete version of trajectory holonomy. A genuinely strong closure condition is not merely: $$ \gamma(0)=\gamma(1), $$ but additionally requires: $$ H_\Gamma(X)\sim X. $$ If the transformations can be represented by a continuous connection, one can formally consider: $$ H_\gamma = \mathcal P\exp\left(\int_\gamma A\right), $$ where $A$ is the connection transporting information along the path, and $\mathcal P$ denotes path ordering. The ideal form of strong closure is: $$ \boxed{ H_\gamma=I }. $$ If: $$ H_\gamma\neq I, $$ the spatial position may have returned to its starting point, but the internal information state has not yet closed. --- ## 6. Redefining Geometric Intersection Domains The early intuition compares two circles or spheres formed from different sources, requiring them to coincide or intersect in some domain. Within the lifted framework, a more general definition is: $$ \mathcal I_1 = \Pi_1(\widetilde\Gamma), $$ $$ \mathcal I_2 = \Pi_2(\widetilde\Gamma), $$ where $\Pi_1$ and $\Pi_2$ are different information-observation maps. The actual intersection domain can be written as: $$ \boxed{ \Pi_1^{-1}(\mathcal I_1) \cap \Pi_2^{-1}(\mathcal I_2) }. $$ It represents the lifted states jointly permitted by the two sets of observed information. Thus, "two circles intersect" is merely a special case of this structure in a low-dimensional projection. --- ## 7. Local Closure and Global Closure A Perfect Cuboid naturally has multiple local channels. For example, the three face channels can separately check: $$ a^2+b^2=d_{ab}^2, $$ $$ a^2+c^2=d_{ac}^2, $$ $$ b^2+c^2=d_{bc}^2. $$ But closure of every local channel does not imply global closure. Abstractly, one can write: $$ \mathcal C_{ab}=0, $$ $$ \mathcal C_{ac}=0, $$ $$ \mathcal C_{bc}=0, $$ while still possibly having: $$ \mathcal C_{abc}\neq0. $$ This is one of the central phenomena TIFV aims to capture: $$ \boxed{ \text{Local Closure} \centernot\Rightarrow \text{Global Trajectory-Information Closure} }. $$ --- ## 8. Minimal Sanity Check: Euler Brick Take the classical Euler brick: $$ (a,b,c)=(44,117,240). $$ Its three face diagonals are all integers: $$ 44^2+117^2=125^2, $$ $$ 44^2+240^2=244^2, $$ $$ 117^2+240^2=267^2. $$ The three local square channels therefore all close. But the squared body diagonal is: $$ 44^2+117^2+240^2=73225. $$ factoring as: $$ 73225=5^2\cdot29\cdot101, $$ so it is not a perfect square. In terms of square classes, this can be written as: $$ \sigma_{ab} = \sigma_{ac} = \sigma_{bc} =1, $$ but: $$ \sigma_{abc} =[2929] \neq1. $$ This test demonstrates at least one important framework requirement: > TIFV must distinguish closure of all local channels from a global channel that still leaves a defect. However, this sanity check itself still mainly restates an existing square obstruction. It is therefore not TIFV's final new result, but a test of whether the framework correctly preserves "local and global as different levels". --- ## 9. Three-Layer Verification Framework For now, TIFV can provisionally be organized into three layers: ### 9.1 Geometric closure Check geometric closure of the unfolding trajectory, for example: $$ \gamma(0)=\gamma(1). $$ This is the lowest-level condition. ### 9.2 Trajectory-information closure Check whether the state transported along the path closes, for example: $$ H_\gamma=I. $$ or, more generally: $$ \Delta_{\mathrm{traj}}=0. $$ ### 9.3 Arithmetic closure Check necessary integer, square-class, cover, quotient and other arithmetic conditions, for example: $$ \Delta_{\mathrm{arith}}=0. $$ Complete candidate verification can therefore provisionally be written as: $$ \boxed{ \text{Geometric Closure} + \text{Trajectory-Information Closure} + \text{Arithmetic Closure} }. $$ --- ## 10. General Form of the Global Defect Let: $$ \mathcal I_{\mathrm{metric}} = \Psi[X] $$ denote information generated from static metric and arithmetic data. Let: $$ \mathcal I_{\mathrm{traj}} = \Phi[\widetilde\gamma] $$ denote information generated from the complete unfolding process. Define the global trajectory-information residual: $$ \Delta_\Gamma = D_\Gamma \left( \mathcal I_{\mathrm{metric}}, \mathcal I_{\mathrm{traj}} \right). $$ Genuine closure requires: $$ \boxed{ \Delta_\Gamma=0 }. $$ If there are different types of information, a vector residual can further be written as: $$ \mathbf\Delta_\Gamma = \left( \Delta_{\mathrm{geom}}, \Delta_{\mathrm{orient}}, \Delta_{\mathrm{hol}}, \Delta_{\mathrm{arith}}, \Delta_{\mathrm{intersect}} \right). $$ An ideal perfect candidate needs to satisfy: $$ \boxed{ \mathbf\Delta_\Gamma=\mathbf0 }. $$ --- ## 11. Interface with the Existing Perfect Cuboid Arithmetic Main Line TIFV does not replace the existing arithmetic main line; it attempts to establish a higher-level common lift. The different existing channels can be denoted by: $$ \Gamma_{\mathrm{local}}, \qquad \Gamma_{\mathrm{global}}, \qquad \Gamma_{\mathrm{arith}}. $$ The question genuinely worth studying is whether there exists a single lifted trajectory: $$ \widetilde\Gamma $$ such that: $$ \pi_{\mathrm{local}}(\widetilde\Gamma) = \Gamma_{\mathrm{local}}, $$ $$ \pi_{\mathrm{global}}(\widetilde\Gamma) = \Gamma_{\mathrm{global}}, $$ and: $$ \pi_{\mathrm{arith}}(\widetilde\Gamma) = \Gamma_{\mathrm{arith}}. $$ That is: $$ \boxed{ \exists\,\widetilde\Gamma \quad\text{s.t.}\quad \pi_i(\widetilde\Gamma)=\Gamma_i }. $$ If the local conditions hold individually but no common $\widetilde\Gamma$ exists, they do not correspond to the same complete global geometric entity. --- ## 12. Possible Relationship to Square Defects In existing research, some candidates can be compressed into very few square defects. One of TIFV's long-term aims is to investigate whether a mapping exists: $$ \Delta_{\mathrm{arith}} \longleftrightarrow \Delta_\Gamma. $$ If it holds, "a quantity is not a square" may be reinterpreted as: > After full freedom expansion and information transport, the candidate cannot return to a lifted state fully consistent with the original metric data. A stronger research objective is to identify a defect-preserving map: $$ \mathfrak D: \Delta_{\mathrm{arith}} \mapsto \Delta_{\mathrm{traj}}, $$ and determine whether it is injective, surjective, bijective or valid only on a particular slice. This relationship has not currently been proved. --- ## 13. Why Computer Simulation Is Especially Suitable for the First Phase Numerical or symbolic simulation naturally preserves a discrete trajectory: $$ X(t_0),X(t_1),\ldots,X(t_N). $$ If each step also preserves: $$ \Delta X_t, \qquad T_t, \qquad C_t, \qquad I_t, $$ one can directly track: - When information splits; - Which channels merge; - Which projections overlap; - Which states flip; - Which local invariants are preserved; - Which defects remain after a complete cycle. The first phase can therefore use computational unfolding to find candidate invariants, then return to exact mathematics for formalization. The research process should avoid immediately compressing the simulation into a single endpoint equation at the end; otherwise, it may again lose the most important path information. --- ## 14. Suggested Data Structure for Computational Experiments Each discrete time step $t_k$ preserves at least: $$ S_k = \left( X_k, B_k, Q_k, T_k, C_k, A_k \right), $$ where, provisionally: - $X_k$: geometric state; - $B_k$: local basis or frame; - $Q_k$: current face, diagonal or quotient channel; - $T_k$: transformation from the preceding step to this one; - $C_k$: this step's constraints and intersection information; - $A_k$: this step's arithmetic labels or square class. The complete trajectory record is: $$ \mathcal R_\Gamma = \{S_k\}_{k=0}^{N}. $$ From it one can compute: $$ H_\Gamma, $$ $$ I[\Gamma], $$ $$ \mathbf\Delta_\Gamma, $$ and determine whether a common lift exists between different projections. --- ## 15. Three Conditions Preventing Degeneration of the Method ### 15.1 Reject Trivial Rigid Rotation If a test holds automatically for all ordinary cuboids, it cannot serve as a new discriminator for Perfect Cuboids. ### 15.2 Reject Quantities Immediately Reducible to the Original Pythagorean Equations If a trajectory invariant becomes equivalent, after one or two algebraic steps, to: $$ a^2+b^2=d_{ab}^2 $$ or: $$ a^2+b^2+c^2=g^2, $$ it can serve only as a sanity check, not be claimed as a new independent obstruction. ### 15.3 Prioritize Path-Dependent Signatures Genuinely valuable candidate quantities should, as far as possible, satisfy: $$ \pi(\widetilde\gamma_1(0)) = \pi(\widetilde\gamma_2(0)), $$ $$ \pi(\widetilde\gamma_1(1)) = \pi(\widetilde\gamma_2(1)), $$ while still possibly having: $$ S(\widetilde\gamma_1) \neq S(\widetilde\gamma_2). $$ Finding such a signature would mean that TIFV captures structure not directly displayed by traditional pointwise representations. --- ## 16. Provisional Research Propositions ### Proposition A: Necessity of a Common Lift If all local metrics, diagonal channels and arithmetic conditions genuinely describe the same complete Perfect Cuboid, these projections should have a common lifted realization: $$ \exists\,\widetilde\Gamma \quad\text{s.t.}\quad \pi_i(\widetilde\Gamma)=\Gamma_i. $$ If there is no common lift, the local conditions may hold separately yet still fail to form the same global geometric entity jointly. ### Proposition B: Nontrivial Holonomy Obstruction If, for a necessary family of degrees of freedom, all valid lifted closed paths satisfy: $$ H_\gamma\neq I, $$ then that slice contains no Perfect Cuboid satisfying the given global closure condition. ### Proposition C: Defect Correspondence There exists a mapping worth searching for: $$ \mathfrak D: \Delta_{\mathrm{arith}} \rightarrow \Delta_{\mathrm{traj}}, $$ such that some arithmetic defects can be interpreted as low-dimensional projections of global trajectory-information defects. All of the above are research propositions, not yet proved theorems. --- ## 17. Relationship to World-Model-Based Geometric Observation An important source of this method is viewing geometric objects as dynamic worlds that unfold, transform and recover information, rather than only as sets of variables after elimination. Under this perspective, the research sequence is: $$ \text{World State} \rightarrow \text{Freedom Expansion} \rightarrow \text{Trajectory Formation} \rightarrow \text{Information Transport} \rightarrow \text{Intersection / Merge} \rightarrow \text{Global Closure}. $$ whereas traditional compressed representations often jump directly to: $$ \text{World State} \rightarrow \text{Constraint Equation}. $$ The two do not conflict: the latter is often better suited to proof and exact arithmetic, while the former may be better suited to discovering global invariants that have not yet been named. TIFV's methodological strategy therefore does not oppose algebraization; instead: > First preserve all potentially meaningful path information, then determine which information can safely be eliminated. Do not project it away before knowing which information matters. --- ## 18. Priorities for Subsequent Research If the next phase is reopened, the suggested order is: 1. Explicitly define the minimal lifted state $\widetilde{\mathcal M}_{\min}$. 2. Define a set of nontrivial geometric-unfolding generators $T_i$. 3. Build a reversible, or at least traceable, discrete trajectory simulator. 4. Apply the same protocol to Euler bricks, near-perfect cuboids, existing exact slices and G2-type candidates. 5. Search for a signature $S(\Gamma)$ that depends on more than endpoints. 6. Check whether the signature reduces to existing Pythagorean identities. 7. If it does not reduce, test its stability across different candidates. 8. Put promising signatures into exact-arithmetic form. 9. Compare $H_\Gamma$, square class, cover state and quotient state to determine whether a defect correspondence exists. 10. Only then attempt to establish a theorem-level obstruction. --- ## 19. One-Sentence Version > **Some key constraints of the Perfect Cuboid may not be merely pointwise equations, but path-information constraints visible only after full freedom expansion; if projected too early into traditional static variables, this information may be eliminated before computation even begins.** --- ## 20. Current Status and Limitations This edition completes a methodological extension, not a Perfect Cuboid proof. What has currently been established: - Circles formed by simple rotation about a center are trivial closure, not a new result; - An Euler brick can serve as a sanity check for local closure with global failure; - What genuinely merits study is lifted path information, not trajectory shape itself; - Holonomy, path functionals, common lifts and defect correspondence are currently the most promising formalization directions; - Computational simulation can serve as an invariant-discovery tool, but must ultimately return to exact mathematics; - No new result on the existence or nonexistence of Perfect Cuboids has been proved; - No strict equivalence between arithmetic defects and trajectory defects has been proved. This document preserves a research line that can be reopened directly later.