> Full-text translation from Chinese. The original remains authoritative for its research claims; this translation is not independent mathematical verification.

# Perfect Cuboid Center-Axis Rational Closure Theorem

## An Exact Reformulation of the Perfect Cuboid Problem as Rational Closure on a Low-Dimensional Coupling Surface

**Series: Perfect Cuboid Global Closure**  
**Main line: Geometry Branch G**  
**Verification sub-branch: Verification Branch A**  
**Document role: Subsequent main paper / Canonical Research Anchor**  
**Version: v0.1**  
**Date: 2026-09-28**

---

# Abstract

This paper proposes and fully proves an exact equivalent reformulation of the Perfect Cuboid problem.

The classical Perfect Cuboid problem requires the existence of positive integers:

$$
a,b,c,d,e,f,g
$$

satisfying:

$$
a^2+b^2=d^2,
$$

$$
a^2+c^2=e^2,
$$

$$
b^2+c^2=f^2,
$$

$$
a^2+b^2+c^2=g^2.
$$

This paper no longer takes seven integers as the primary variables.

Let:

$$
x_a=\frac ag,
\qquad
x_b=\frac bg,
\qquad
x_c=\frac cg.
$$

For each edge and its opposite face diagonal, construct a center-axis right-triangle coupling and introduce a rational half-angle parameter:

$$
t_a,
\qquad
t_b,
\qquad
t_c.
$$

This paper proves:

> **A Perfect Cuboid exists if and only if there exist three positive rational numbers**
>
> $$
> t_a,t_b,t_c\in\mathbb Q\cap(0,1)
> $$
>
> **satisfying**
>
> $$
> \boxed{
> \left(
> \frac{1-t_a^2}{1+t_a^2}
> \right)^2
> +
> \left(
> \frac{1-t_b^2}{1+t_b^2}
> \right)^2
> +
> \left(
> \frac{1-t_c^2}{1+t_c^2}
> \right)^2
> =
> 1.
> }
> $$

This equation is called:

$$
\boxed{
\text{Center-Axis Rational Closure Equation}
}
$$

or, in abbreviated form:

$$
\boxed{
\text{CARCE}.
}
$$

This theorem compresses:

$$
\text{Seven positive integers}
+
\text{Four square relations}
$$

exactly into:

$$
\boxed{
\text{Three rational coupling parameters}
+
\text{One global closure equation}.
}
$$

If any rational triple:

$$
(t_a,t_b,t_c)
$$

satisfying CARCE is found,

an exact integer Perfect Cuboid witness can be generated mechanically.

The canonical existence target for subsequent research can therefore be rewritten as:

$$
\boxed{
\mathcal M(\mathbb Q)\neq\varnothing,
}
$$

where:

$$
\mathcal M
=
\left\{
(t_a,t_b,t_c)\in(0,1)^3:
\Phi(t_a,t_b,t_c)=0
\right\}.
$$

The currently known near-arithmetic seed:

$$
(a,b,c;g)
=
(448,495,840;1073)
$$

corresponds exactly in these coordinates to:

$$
\boxed{
T_0
=
\left(
\frac{25}{39},
\frac{17}{28},
\sqrt{\frac{233}{1913}}
\right),
}
$$

and:

$$
\Phi(T_0)=0
$$

exactly.

Thus, geometric closure is not what is currently missing.

What is truly missing is:

$$
\boxed{
T^\ast\in\mathbb Q^3\cap\mathcal M.
}
$$

This paper also provides:

- an exact equivalence proof;
- an exact integer witness generator;
- a square-defect formulation;
- a symmetric polynomial surface;
- a smoothness theorem;
- the exact arithmetic decomposition of the current seed;
- geometry-preserving dynamics;
- the positioning of the arithmetic observer;
- a future proof pipeline;
- a formal certificate interface.

---

# 1. The Classical Problem

A Perfect Cuboid requires:

$$
a,b,c,d,e,f,g\in\mathbb Z_{>0}
$$

and:

$$
a^2+b^2=d^2,
$$

$$
a^2+c^2=e^2,
$$

$$
b^2+c^2=f^2,
$$

$$
a^2+b^2+c^2=g^2.
$$

Using the usual naming convention:

- $d$ is the $ab$ face diagonal;
- $e$ is the $ac$ face diagonal;
- $f$ is the $bc$ face diagonal;
- $g$ is the body diagonal.

The last equation together with the first three can be rearranged as:

$$
a^2+f^2=g^2,
$$

$$
b^2+e^2=g^2,
$$

$$
c^2+d^2=g^2.
$$

A Perfect Cuboid can therefore also be viewed as:

> Three right triangles sharing the same hypotenuse $g$, whose three short-axis projections must also jointly satisfy a three-dimensional sphere closure.

This is the starting point of the Center-Axis formulation.

---

# 2. Normalized Center-Axis Coordinates

Divide all lengths by:

$$
g.
$$

Define:

$$
x_a=\frac ag,
$$

$$
x_b=\frac bg,
$$

$$
x_c=\frac cg.
$$

and the opposite face-diagonal ratios:

$$
y_a=\frac fg,
$$

$$
y_b=\frac eg,
$$

$$
y_c=\frac dg.
$$

Then:

$$
x_a^2+y_a^2=1,
$$

$$
x_b^2+y_b^2=1,
$$

$$
x_c^2+y_c^2=1.
$$

At the same time, the body closure is:

$$
\boxed{
x_a^2+x_b^2+x_c^2=1.
}
$$

Since all lengths are positive:

$$
0<x_i<1,
$$

$$
0<y_i<1.
$$

---

# 3. Center-Axis Angles

For the three center-axis right-triangle channels, define:

$$
\alpha,
\beta,
\gamma
\in
\left(
0,\frac{\pi}{2}
\right).
$$

such that:

$$
x_a=\cos\alpha,
$$

$$
y_a=\sin\alpha,
$$

$$
x_b=\cos\beta,
$$

$$
y_b=\sin\beta,
$$

$$
x_c=\cos\gamma,
$$

$$
y_c=\sin\gamma.
$$

The body closure therefore becomes:

$$
\boxed{
\cos^2\alpha
+
\cos^2\beta
+
\cos^2\gamma
=
1.
}
$$

This already converts the geometry of a Perfect Cuboid into a global coupling of three center-axis angles.

---

# 4. Half-Angle Rational Parameters

Define:

$$
t_a
=
\tan\frac{\alpha}{2},
$$

$$
t_b
=
\tan\frac{\beta}{2},
$$

$$
t_c
=
\tan\frac{\gamma}{2}.
$$

By the half-angle identities:

$$
\cos\alpha
=
\frac{1-t_a^2}{1+t_a^2},
$$

$$
\sin\alpha
=
\frac{2t_a}{1+t_a^2}.
$$

Similarly:

$$
\cos\beta
=
\frac{1-t_b^2}{1+t_b^2},
$$

$$
\sin\beta
=
\frac{2t_b}{1+t_b^2},
$$

and:

$$
\cos\gamma
=
\frac{1-t_c^2}{1+t_c^2},
$$

$$
\sin\gamma
=
\frac{2t_c}{1+t_c^2}.
$$

Since:

$$
0<\alpha,\beta,\gamma<\frac{\pi}{2},
$$

we have:

$$
\boxed{
0<t_a,t_b,t_c<1.
}
$$

---

# 5. Rationality Compression

The most important observation is:

If:

$$
t_i\in\mathbb Q,
$$

then:

$$
\frac{1-t_i^2}{1+t_i^2}
\in\mathbb Q
$$

and:

$$
\frac{2t_i}{1+t_i^2}
\in\mathbb Q.
$$

Thus, a rational half-angle parameter:

$$
t_i
$$

simultaneously guarantees:

$$
\boxed{
\text{edge ratio rational}
}
$$

and:

$$
\boxed{
\text{opposite face-diagonal ratio rational}.
}
$$

There is therefore no need to solve separately for:

$$
a/g
$$

and:

$$
f/g.
$$

They are automatically rationalized by the same:

$$
t_a
$$

parameter.

The same holds for all three channels.

---

# 6. Center-Axis Rational Closure Equation

Substitute the half-angle expressions into:

$$
x_a^2+x_b^2+x_c^2=1.
$$

to obtain:

$$
\boxed{
\left(
\frac{1-t_a^2}{1+t_a^2}
\right)^2
+
\left(
\frac{1-t_b^2}{1+t_b^2}
\right)^2
+
\left(
\frac{1-t_c^2}{1+t_c^2}
\right)^2
=
1.
}
$$

Define:

$$
\Phi(t_a,t_b,t_c)
=
\left(
\frac{1-t_a^2}{1+t_a^2}
\right)^2
+
\left(
\frac{1-t_b^2}{1+t_b^2}
\right)^2
+
\left(
\frac{1-t_c^2}{1+t_c^2}
\right)^2
-1.
$$

Then:

$$
\boxed{
\Phi(t_a,t_b,t_c)=0
}
$$

is CARCE.

---

# 7. Main Theorem

## Theorem 1 — Center-Axis Rational Closure Theorem

A Perfect Cuboid exists if and only if there exist:

$$
t_a,t_b,t_c
\in
\mathbb Q\cap(0,1)
$$

such that:

$$
\Phi(t_a,t_b,t_c)=0.
$$

That is:

$$
\boxed{
\text{Perfect Cuboid exists}
\iff
\mathcal M(\mathbb Q)\neq\varnothing.
}
$$

where:

$$
\mathcal M
=
\left\{
T\in(0,1)^3:
\Phi(T)=0
\right\}.
$$

---

# 8. Proof — A Perfect Cuboid Implies a Rational Point

Suppose a Perfect Cuboid exists:

$$
(a,b,c,d,e,f,g)
\in
\mathbb Z_{>0}^7.
$$

From:

$$
a^2+f^2=g^2,
$$

define:

$$
x_a=\frac ag,
$$

$$
y_a=\frac fg.
$$

Then:

$$
x_a^2+y_a^2=1.
$$

Define:

$$
t_a
=
\frac{y_a}{1+x_a}.
$$

Thus:

$$
t_a
=
\frac{f/g}{1+a/g}
=
\frac{f}{g+a}.
$$

Hence:

$$
t_a\in\mathbb Q.
$$

And since:

$$
0<\alpha<\frac{\pi}{2},
$$

we have:

$$
0<t_a<1.
$$

Similarly:

$$
t_b
=
\frac{e}{g+b}
\in
\mathbb Q\cap(0,1),
$$

and:

$$
t_c
=
\frac{d}{g+c}
\in
\mathbb Q\cap(0,1).
$$

On the other hand:

$$
\frac ag
=
\frac{1-t_a^2}{1+t_a^2},
$$

$$
\frac bg
=
\frac{1-t_b^2}{1+t_b^2},
$$

$$
\frac cg
=
\frac{1-t_c^2}{1+t_c^2}.
$$

Since:

$$
a^2+b^2+c^2=g^2,
$$

dividing by:

$$
g^2
$$

gives:

$$
\left(
\frac{1-t_a^2}{1+t_a^2}
\right)^2
+
\left(
\frac{1-t_b^2}{1+t_b^2}
\right)^2
+
\left(
\frac{1-t_c^2}{1+t_c^2}
\right)^2
=
1.
$$

Therefore:

$$
\Phi(t_a,t_b,t_c)=0.
$$

Hence:

$$
\boxed{
\text{Perfect Cuboid}
\Rightarrow
\mathcal M(\mathbb Q)\neq\varnothing.
}
$$

---

# 9. Proof — A Rational Point Implies a Perfect Cuboid

Conversely, suppose:

$$
t_a,t_b,t_c
\in
\mathbb Q\cap(0,1)
$$

and:

$$
\Phi(t_a,t_b,t_c)=0.
$$

Write each:

$$
t_i=\frac{m_i}{n_i}
$$

in lowest terms, with:

$$
0<m_i<n_i,
$$

$$
\gcd(m_i,n_i)=1.
$$

Define:

$$
P_i=n_i^2-m_i^2,
$$

$$
R_i=2m_in_i,
$$

$$
Q_i=n_i^2+m_i^2.
$$

Then:

$$
P_i^2+R_i^2=Q_i^2.
$$

and:

$$
\frac{P_i}{Q_i}
=
\frac{1-t_i^2}{1+t_i^2},
$$

$$
\frac{R_i}{Q_i}
=
\frac{2t_i}{1+t_i^2}.
$$

CARCE gives:

$$
\frac{P_a^2}{Q_a^2}
+
\frac{P_b^2}{Q_b^2}
+
\frac{P_c^2}{Q_c^2}
=
1.
$$

Let:

$$
G=Q_aQ_bQ_c.
$$

Define the integers:

$$
A=P_aQ_bQ_c,
$$

$$
B=P_bQ_aQ_c,
$$

$$
C=P_cQ_aQ_b.
$$

and define:

$$
F=R_aQ_bQ_c,
$$

$$
E=R_bQ_aQ_c,
$$

$$
D=R_cQ_aQ_b.
$$

Then:

$$
A,B,C,D,E,F,G
\in
\mathbb Z_{>0}.
$$

Multiplying:

$$
P_a^2+R_a^2=Q_a^2
$$

by:

$$
Q_b^2Q_c^2
$$

gives:

$$
A^2+F^2=G^2.
$$

Similarly:

$$
B^2+E^2=G^2,
$$

and:

$$
C^2+D^2=G^2.
$$

From CARCE:

$$
A^2+B^2+C^2=G^2.
$$

Therefore:

$$
B^2+C^2
=
G^2-A^2
=
F^2,
$$

$$
A^2+C^2
=
G^2-B^2
=
E^2,
$$

$$
A^2+B^2
=
G^2-C^2
=
D^2.
$$

Thus:

$$
\boxed{
(A,B,C,D,E,F,G)
}
$$

is a Perfect Cuboid.

Hence:

$$
\boxed{
\mathcal M(\mathbb Q)\neq\varnothing
\Rightarrow
\text{Perfect Cuboid exists}.
}
$$

Combining both directions proves the theorem.

---

# 10. Exact Witness Generator

Thus, once we obtain:

$$
t_i=\frac{m_i}{n_i},
$$

we can directly generate:

$$
P_i=n_i^2-m_i^2,
$$

$$
R_i=2m_in_i,
$$

$$
Q_i=n_i^2+m_i^2.
$$

Then let:

$$
G=Q_aQ_bQ_c.
$$

Finally:

$$
A=P_aQ_bQ_c,
$$

$$
B=P_bQ_aQ_c,
$$

$$
C=P_cQ_aQ_b,
$$

$$
D=R_cQ_aQ_b,
$$

$$
E=R_bQ_aQ_c,
$$

$$
F=R_aQ_bQ_c.
$$

The rational point itself is therefore a compact certificate.

A subsequent verifier need not even trust the Geometry Engine.

It only needs to recompute:

$$
A^2+B^2-D^2,
$$

$$
A^2+C^2-E^2,
$$

$$
B^2+C^2-F^2,
$$

$$
A^2+B^2+C^2-G^2
$$

and check whether all are exactly equal to:

$$
0.
$$

---

# 11. Integer Polynomial Certificate

The rational denominators in CARCE can also be cleared directly.

Multiplying:

$$
\frac{P_a^2}{Q_a^2}
+
\frac{P_b^2}{Q_b^2}
+
\frac{P_c^2}{Q_c^2}
=
1
$$

by:

$$
Q_a^2Q_b^2Q_c^2
$$

gives:

$$
\boxed{
P_a^2Q_b^2Q_c^2
+
P_b^2Q_a^2Q_c^2
+
P_c^2Q_a^2Q_b^2
=
Q_a^2Q_b^2Q_c^2.
}
$$

Thus, Perfect Cuboid existence is also equivalent to the existence of:

$$
m_a,n_a,
m_b,n_b,
m_c,n_c
\in
\mathbb Z_{>0}
$$

satisfying:

$$
0<m_i<n_i,
$$

$$
\gcd(m_i,n_i)=1
$$

and the single integer polynomial identity above.

This is a structured six-integer Diophantine reformulation.

---

# 12. Square-Defect Map

Now define:

$$
\Delta(x)
=
\frac{1-x}{1+x}.
$$

If:

$$
x=\cos\alpha,
$$

and:

$$
t=\tan\frac{\alpha}{2},
$$

then:

$$
\boxed{
t^2
=
\frac{1-x}{1+x}
=
\Delta(x).
}
$$

Thus:

$$
t\in\mathbb Q
$$

if and only if:

$$
\Delta(x)
$$

is a rational square.

The Perfect Cuboid problem is therefore also equivalent to:

the existence of:

$$
x_a,x_b,x_c\in\mathbb Q\cap(0,1)
$$

satisfying:

$$
x_a^2+x_b^2+x_c^2=1
$$

and:

$$
\boxed{
\Delta(x_a),
\Delta(x_b),
\Delta(x_c)
\in
\mathbb Q^2.
}
$$

This is:

$$
\boxed{
\text{Rational Sphere + Three Square-Defect Closures}.
}
$$

---

# 13. Full Connection with the Shared-Core Method

For:

$$
x=\frac ag
$$

we have:

$$
\Delta(x)
=
\frac{1-a/g}{1+a/g}
=
\frac{g-a}{g+a}.
$$

And:

$$
a^2+f^2=g^2
$$

means:

$$
f^2
=
(g-a)(g+a).
$$

Therefore:

$$
\frac{g-a}{g+a}
=
\frac{f^2}{(g+a)^2}
=
\left(
\frac{f}{g+a}
\right)^2.
$$

Hence:

$$
\boxed{
t_a
=
\frac{f}{g+a}.
}
$$

This shows that the earlier Verification Branch A's:

$$
(g-a)(g+a)
$$

shared-core square test,

and the current Geometry Branch G's half-angle coupling:

$$
t_a
$$

are actually two projections of the same arithmetic structure.

The two research lines converge exactly here.

---

# 14. Current Seed

The most important current exact-real seed is:

$$
(a,b,c;g)
=
(448,495,840;1073).
$$

Two face diagonals:

$$
e=952,
$$

$$
f=975
$$

are exact integers.

The remaining one is:

$$
d
=
\sqrt{448^2+495^2}
=
\sqrt{445729}.
$$

And:

$$
445729
=
233\cdot1913.
$$

---

# 15. The Seed's First Half-Angle Parameter

For the edge:

$$
a=448
$$

and the opposite diagonal:

$$
f=975,
$$

we obtain:

$$
t_a
=
\frac{f}{g+a}.
$$

Therefore:

$$
t_a
=
\frac{975}{1073+448}
=
\frac{975}{1521}
=
\boxed{
\frac{25}{39}
}.
$$

Correspondingly:

$$
t_a^2
=
\frac{625}{1521}.
$$

At the same time:

$$
\Delta\left(\frac{448}{1073}\right)
=
\frac{1073-448}{1073+448}
=
\frac{625}{1521}.
$$

---

# 16. The Seed's Second Half-Angle Parameter

For:

$$
b=495
$$

and:

$$
e=952,
$$

we have:

$$
t_b
=
\frac{952}{1073+495}
=
\frac{952}{1568}
=
\boxed{
\frac{17}{28}
}.
$$

Therefore:

$$
t_b^2
=
\frac{289}{784}.
$$

That is:

$$
\Delta\left(\frac{495}{1073}\right)
=
\frac{578}{1568}
=
\frac{289}{784}.
$$

---

# 17. The Seed's Third Half-Angle Parameter

For:

$$
c=840,
$$

we have:

$$
d=\sqrt{445729}.
$$

Hence:

$$
t_c
=
\frac{d}{g+c}
=
\frac{\sqrt{445729}}{1913}.
$$

Squaring:

$$
t_c^2
=
\frac{445729}{1913^2}.
$$

Since:

$$
445729
=
233\cdot1913,
$$

we have:

$$
\boxed{
t_c^2
=
\frac{233}{1913}.
}
$$

Therefore:

$$
\boxed{
t_c
=
\sqrt{\frac{233}{1913}}.
}
$$

This value is not a currently known rational parameter.

---

# 18. The Seed's Canonical Form

Thus, the current seed's position on the CARCE surface is:

$$
\boxed{
T_0
=
\left(
\frac{25}{39},
\frac{17}{28},
\sqrt{\frac{233}{1913}}
\right).
}
$$

Its squared coordinates are:

$$
\boxed{
S_0
=
\left(
\frac{625}{1521},
\frac{289}{784},
\frac{233}{1913}
\right).
}
$$

And:

$$
\boxed{
\Phi(T_0)=0
}
$$

exactly.

This means:

> Geometric closure is already complete; among the three half-angle arithmetic channels, two already have rational closure, and only the third remains to be rationalized.

---

# 19. CARCE Surface

Define:

$$
\mathcal M
=
\left\{
(t_a,t_b,t_c)\in(0,1)^3:
\Phi(t_a,t_b,t_c)=0
\right\}.
$$

Perfect Cuboid existence is now equivalent to:

$$
\boxed{
\mathcal M\cap\mathbb Q^3\neq\varnothing.
}
$$

Thus, the object of research is no longer the unbounded:

$$
\mathbb Z_{>0}^7.
$$

Instead, within the bounded cube:

$$
(0,1)^3
$$

it is an exact algebraic surface.

---

# 20. Smoothness of the Interior Surface

Let:

$$
c(t)
=
\frac{1-t^2}{1+t^2}.
$$

Then:

$$
\Phi
=
c(t_a)^2
+
c(t_b)^2
+
c(t_c)^2
-1.
$$

We have:

$$
c'(t)
=
-\frac{4t}{(1+t^2)^2}.
$$

Hence:

$$
\frac{\partial\Phi}{\partial t}
=
2c(t)c'(t)
=
-\frac{
8t(1-t^2)
}{
(1+t^2)^3
}.
$$

For:

$$
0<t<1,
$$

we have:

$$
t>0,
$$

$$
1-t^2>0.
$$

Therefore:

$$
\frac{\partial\Phi}{\partial t}<0.
$$

Thus, within:

$$
(0,1)^3
$$

we have:

$$
\nabla\Phi\neq0.
$$

By the implicit function theorem:

$$
\boxed{
\mathcal M
\text{ is a smooth two-dimensional manifold}.
}
$$

This provides a formal foundation for Geometry Dynamics.

---

# 21. Symmetric Polynomial Surface

Since:

$$
\Phi
$$

depends only on:

$$
t_a^2,
t_b^2,t_c^2,
$$

let:

$$
s_1=t_a^2,
$$

$$
s_2=t_b^2,
$$

$$
s_3=t_c^2.
$$

Then:

$$
\left(
\frac{1-s_1}{1+s_1}
\right)^2
+
\left(
\frac{1-s_2}{1+s_2}
\right)^2
+
\left(
\frac{1-s_3}{1+s_3}
\right)^2
=
1.
$$

Clearing the denominators gives the symmetric polynomial:

$$
\Psi(s_1,s_2,s_3)=0.
$$

Its explicit form is:

$$
\Psi
=
s_1^2s_2^2s_3^2
+
s_1^2s_2^2
+
s_1^2s_3^2
+
s_2^2s_3^2
+
s_1^2+s_2^2+s_3^2
$$

$$
\quad
-4s_1^2s_2s_3
-4s_1s_2^2s_3
-4s_1s_2s_3^2
-16s_1s_2s_3
$$

$$
\quad
-4s_1s_2
-4s_1s_3
-4s_2s_3
+1.
$$

This is a fully symmetric polynomial of degree $6$ in:

$$
(s_1,s_2,s_3).
$$

---

# 22. Elementary-Symmetric Compression

Let:

$$
\sigma_1=s_1+s_2+s_3,
$$

$$
\sigma_2=s_1s_2+s_1s_3+s_2s_3,
$$

$$
\sigma_3=s_1s_2s_3.
$$

The polynomial above can then be compressed into:

$$
\boxed{
\Psi
=
\sigma_1^2
+
\sigma_2^2
+
\sigma_3^2
-
6\sigma_2
-
6\sigma_1\sigma_3
-
16\sigma_3
+
1.
}
$$

Thus, the CARCE surface has an explicit permutation symmetry:

$$
S_3.
$$

This representation is suitable for future:

- symbolic factorization;
- singularity analysis;
- rational-point search;
- birational classification;
- modular obstruction;
- invariant construction.

---

# 23. The Seed Lies Exactly on the Polynomial Surface

For the current seed:

$$
s_1=\frac{625}{1521},
$$

$$
s_2=\frac{289}{784},
$$

$$
s_3=\frac{233}{1913}.
$$

Exact substitution gives:

$$
\boxed{
\Psi
\left(
\frac{625}{1521},
\frac{289}{784},
\frac{233}{1913}
\right)
=
0.
}
$$

Note:

$$
s_3\in\mathbb Q
$$

but:

$$
s_3
$$

is not a rational square.

Therefore:

$$
t_c=\sqrt{s_3}\notin\mathbb Q.
$$

This is precisely the only current half-angle arithmetic defect.

---

# 24. The Distinction Between Geometry Closure and Rational Closure

The current seed already satisfies:

$$
\Phi(T_0)=0.
$$

Hence:

$$
\boxed{
\text{There is no need to search for cuboid geometry again}.
}
$$

What is truly needed is:

$$
\boxed{
\text{Search on }\mathcal M\text{ for a rational point}.
}
$$

That is:

$$
T_0
\longrightarrow
T^\ast
$$

where:

$$
T^\ast\in\mathcal M\cap\mathbb Q^3.
$$

This is the core objective of all subsequent dynamics, visualization, and arithmetic observers.

---

# 25. Geometry-Preserving Dynamics

Since we are currently already on:

$$
\Phi=0
$$

this surface,

the primary action of the dynamics should no longer be:

$$
-\nabla\Phi.
$$

That would merely solve geometric closure again.

The new dynamics should move along:

$$
\mathcal M
$$

the tangent space of this surface.

Let the arithmetic heuristic:

$$
A(T)
$$

measure rationality complexity.

Then the unconstrained arithmetic descent:

$$
-\nabla A
$$

can be projected onto the tangent plane.

Define:

$$
P_T
=
I
-
\frac{
\nabla\Phi
\nabla\Phi^{\mathsf T}
}{
\|\nabla\Phi\|^2
}.
$$

Then:

$$
\boxed{
\dot T
=
-
P_T\nabla A(T).
}
$$

The design objective of this flow is:

$$
\frac{d}{dt}\Phi(T(t))=0
$$

while reducing, as much as possible:

$$
A(T).
$$

This is:

$$
\boxed{
\text{geometry-preserving arithmetic search}.
}
$$

---

# 26. Numerical Constraint Correction

In an actual floating-point runtime,

even if the tangent flow theoretically satisfies:

$$
\dot\Phi=0,
$$

finite precision may still cause drift.

A projection correction can therefore be added at each step:

$$
T'
=
T+\Delta T.
$$

Then use:

$$
T_{\mathrm{corr}}
=
T'
-
\frac{
\Phi(T')
}{
\|\nabla\Phi(T')\|^2
}
\nabla\Phi(T')
$$

to perform one Newton-style normal correction.

Repeat until:

$$
|\Phi|
<
\varepsilon_G.
$$

However:

$$
\varepsilon_G
$$

belongs only to the geometric numerical runtime.

The final mathematical certificate must still satisfy:

$$
\Phi=0
$$

exactly.

---

# 27. Two-Coordinate Surface Explorer

By smoothness:

$$
\frac{\partial\Phi}{\partial t_c}\neq0
$$

in the interior.

Thus, locally we can write:

$$
t_c
=
h(t_a,t_b).
$$

The software therefore need not move arbitrarily in three dimensions.

It can directly use:

$$
(t_a,t_b)
$$

as the control plane.

Each time, solve:

$$
\Phi(t_a,t_b,t_c)=0
$$

to obtain the unique local branch:

$$
t_c=h(t_a,t_b).
$$

This directly reduces the visualization to:

$$
\boxed{
\text{2D arithmetic landscape over a geometric closure surface}.
}
$$

---

# 28. Explicit Third-Coordinate Formula

Let:

$$
x_a
=
\frac{1-t_a^2}{1+t_a^2},
$$

$$
x_b
=
\frac{1-t_b^2}{1+t_b^2}.
$$

Define:

$$
u
=
1-x_a^2-x_b^2.
$$

If:

$$
0<u<1,
$$

then the positive branch is:

$$
x_c=\sqrt{u}.
$$

Also:

$$
t_c^2
=
\frac{1-x_c}{1+x_c}.
$$

Hence:

$$
\boxed{
t_c
=
\sqrt{
\frac{
1-\sqrt{
1-x_a^2-x_b^2
}
}{
1+\sqrt{
1-x_a^2-x_b^2
}
}
}.
}
$$

where:

$$
x_a
=
\frac{1-t_a^2}{1+t_a^2},
$$

$$
x_b
=
\frac{1-t_b^2}{1+t_b^2}.
$$

This nested-square form directly reveals two layers of arithmetic closure:

1. $x_c$ must be rational;
2. $t_c^2=\Delta(x_c)$ must be a rational square.

---

# 29. The Current Seed's Two-Layer Closure Status

The current seed already has:

$$
x_a=\frac{448}{1073},
$$

$$
x_b=\frac{495}{1073}.
$$

Therefore:

$$
1-x_a^2-x_b^2
=
\left(
\frac{840}{1073}
\right)^2.
$$

Thus, the first layer:

$$
\boxed{
x_c\in\mathbb Q
}
$$

already has exact closure.

The second layer:

$$
\Delta(x_c)
=
\frac{233}{1913}
$$

is not a rational square.

The seed can therefore be described more precisely as:

$$
\boxed{
\text{sphere closure PASS}
}
$$

$$
\boxed{
\text{third edge rationality PASS}
}
$$

$$
\boxed{
\text{third opposite-face half-angle square closure FAIL}.
}
$$

This provides stronger diagnostics than simply saying "one diagonal is missing."

---

# 30. The Arithmetic Observer's Actual Job

The Arithmetic Observer does not need to check the geometry again.

It should focus on:

$$
t_a,t_b,t_c
$$

and their arithmetic structure.

This may include:

## Rational reconstruction score

For a floating-point value:

$$
t
$$

find a low-height:

$$
\frac pq
$$

such that:

$$
\left|
t-\frac pq
\right|
$$

is extremely small.

## Continued-fraction depth

Observe whether certain convergents are unusually stable.

## Denominator height

Record:

$$
H(t)=\max(|p|,|q|).
$$

## Square-class score

For:

$$
s=t^2
$$

check whether the numerator / denominator after rational reconstruction are close to perfect squares.

## Radix profile

Observe whether complexity collapse appears simultaneously across multiple radix representations.

---

# 31. Arithmetic Energy Must Not Masquerade as Proof

We can define:

$$
A(T)
=
w_1A_{\mathrm{CF}}
+
w_2A_{\mathrm{height}}
+
w_3A_{\mathrm{square}}
+
w_4A_{\mathrm{radix}}.
$$

This is only a search heuristic.

Even if:

$$
A(T)\rightarrow0
$$

a Perfect Cuboid cannot be declared directly.

Only after obtaining an exact rational triple:

$$
T^\ast
$$

and verifying exactly that:

$$
\Phi(T^\ast)=0
$$

may we enter the certificate stage.

---

# 32. Exactification Pipeline

If future software discovers a candidate:

$$
\widetilde T
=
(\widetilde t_a,\widetilde t_b,\widetilde t_c),
$$

then carry out:

### Step 1

For each:

$$
\widetilde t_i
$$

perform rational reconstruction:

$$
\widetilde t_i
\leadsto
\frac{m_i}{n_i}.
$$

### Step 2

Form the exact:

$$
T^\ast
=
\left(
\frac{m_a}{n_a},
\frac{m_b}{n_b},
\frac{m_c}{n_c}
\right).
$$

### Step 3

Using arbitrary-precision rational arithmetic, compute:

$$
\Phi(T^\ast).
$$

Accept only:

$$
\boxed{
\Phi(T^\ast)=0.
}
$$

### Step 4

Generate:

$$
(A,B,C,D,E,F,G).
$$

### Step 5

Independently recompute the four integer identities.

### Step 6

Canonicalize:

$$
\gcd(A,B,C)=1.
$$

Divide out common factors where necessary.

### Step 7

Output a machine-verifiable certificate.

---

# 33. Proof Completion Condition

Following this paper,

the formal success condition of the research line can be reduced to:

$$
\boxed{
\exists\,
t_a,t_b,t_c
\in
\mathbb Q\cap(0,1)
:
\Phi(t_a,t_b,t_c)=0.
}
$$

Once this statement has a constructive witness,

the Perfect Cuboid existence proof is complete.

No additional conjectural leap is needed.

---

# 34. If the Final Rational Parameters Are Enormous

Even if:

$$
m_i,n_i
$$

are enormous,

the proof logic is unaffected.

This is because the witness generator is entirely algebraic.

Thus, one core advantage of the Geometry Branch remains:

$$
\boxed{
\text{Search can take place in a bounded coupling space,
with the final integer height left to emerge later}.
}
$$

---

# 35. The Actual Difference from Traditional Search

Traditional search primarily asks:

$$
\boxed{
\text{How high is the integer witness?}
}
$$

The CARCE formulation instead asks:

$$
\boxed{
\text{Where on }\mathcal M\text{ is a rational point?}
}
$$

That is, a shift from:

$$
\text{height expansion}
$$

to:

$$
\text{surface navigation}.
$$

If the arithmetic structure on:

$$
\mathcal M
$$

has a directional character that can be learned or observed,

then it may be possible to avoid:

$$
H\rightarrow10H\rightarrow100H
$$

and the enormous outward search expansion of this form.

---

# 36. The Theoretical Warnings That Must Be Maintained

It has not currently been proved that:

$$
\boxed{
\text{arithmetic distance}
}
$$

on:

$$
\mathcal M
$$

forms a smooth gradient.

Nor has it been proved that:

$$
\boxed{
\mathcal M(\mathbb Q)
}
$$

is nonempty.

Still less has it been proved that:

$$
\mathcal M(\mathbb Q)
$$

is dense on the real surface.

Therefore:

- dynamics is a search method;
- visualization is an observation method;
- arithmetic energy is a heuristic;
- only a CARCE rational witness constitutes a proof.

These four layers must be distinguished.

---

# 37. Subsequent Main Research Question A: Rational Point Existence

The first core question:

$$
\boxed{
\mathcal M(\mathbb Q)\neq\varnothing?
}
$$

This can be developed along directions such as:

- rational parameterization;
- birational transformation;
- algebraic surface classification;
- elliptic fibration;
- conic bundle;
- local-global tests;
- descent;
- modular obstruction;
- rational curve search;

among others.

---

# 38. Subsequent Main Research Question B: Seed-Local Rationalization

With:

$$
T_0
=
\left(
\frac{25}{39},
\frac{17}{28},
\sqrt{\frac{233}{1913}}
\right)
$$

as the center,

study:

$$
\mathcal M
$$

and its local neighborhood.

The objective is not to prove that:

$$
T^\ast
$$

must be close to:

$$
T_0.
$$

Rather, it is to test:

- whether low-height rational traces exist;
- whether rational approximants lie along special curvature directions;
- whether square-defect decreases along certain tangent directions;
- whether nearby rational slices form algebraic families.

---

# 39. Subsequent Main Research Question C: Fix Two, Solve One

Fix:

$$
t_a,t_b\in\mathbb Q.
$$

Treat:

$$
\Phi=0
$$

as an equation in:

$$
t_c
$$

the parameter to be solved for.

Since:

$$
\Phi
$$

contains only:

$$
t_c^2,
$$

we can let:

$$
s_c=t_c^2.
$$

This gives a rational algebraic equation.

Study when:

$$
s_c
$$

belongs to:

$$
\mathbb Q^2.
$$

This line directly corresponds to:

$$
\boxed{
\text{two rational channels}
\rightarrow
\text{third rational-square closure}.
}
$$

and matches the current seed exactly.

---

# 40. Subsequent Main Research Question D: Fix One Symmetry Class

Using:

$$
\Psi
$$

and its:

$$
S_3
$$

symmetry,

we can consider:

$$
s_1=s_2,
$$

or:

$$
s_1s_2=\text{constant},
$$

and other invariant slices.

These slices may reduce to:

- a conic;
- a quartic;
- a genus-$1$ curve;
- a higher-genus curve.

If a slice has a rational point,

a Perfect Cuboid can be generated directly.

---

# 41. Subsequent Main Research Question E: Arithmetic-Preserving Dynamics

Unlike general floating-point dynamics,

we can try to keep:

$$
t_a,t_b
$$

rational at all times:

$$
t_a=\frac{p_a}{q_a},
$$

$$
t_b=\frac{p_b}{q_b}.
$$

At each step, perform only a rational mutation:

$$
\frac pq
\rightarrow
\frac{p+\Delta p}{q+\Delta q}.
$$

Then solve exactly for:

$$
s_c.
$$

As soon as:

$$
s_c
$$

becomes a rational square,

the process ends.

This is a form of:

$$
\boxed{
\text{discrete rational dynamics on a continuous geometric surface}.
}
$$

---

# 42. Subsequent Main Research Question F: Height vs. Geometric Distance

Study:

$$
H(T)
$$

and:

$$
d_{\mathcal M}(T,T_0)
$$

and the relationship between them.

If points of low arithmetic height exhibit some clustering on the surface,

then the Geometry Branch may genuinely establish:

$$
\boxed{
\text{distance-guided exact search}.
}
$$

If there is no clustering at all,

then stronger algebraic invariants will be needed again.

---

# 43. Redefining G2

G2 was originally planned only as:

$$
\text{Three-X Shared-Edge Closure}.
$$

Following this paper,

G2 should be upgraded to:

$$
\boxed{
\text{CARCE Surface Explorer}.
}
$$

The core display includes:

- $t_a$;
- $t_b$;
- $t_c$;
- $\Phi$;
- $s_i=t_i^2$;
- square-defect status;
- rational reconstruction;
- denominator height;
- tangent direction;
- surface trajectory.

The Three-X cuboid view serves as the geometry visualization layer.

---

# 44. Redefining G3

G3:

$$
\boxed{
\text{Geometry-Preserving Arithmetic Dynamics}.
}
$$

Implement:

$$
\dot T
=
-
P_T\nabla A.
$$

and add:

- tangent projection;
- normal correction;
- trajectory logging;
- rationality diagnostics;
- multiple arithmetic potentials.

---

# 45. Redefining G4

G4:

$$
\boxed{
\text{Exact Rational Mutation Engine}.
}
$$

Do not use arbitrary floating-point steps.

Instead, work directly in:

$$
\mathbb Q^2
$$

and modify:

$$
t_a,t_b.
$$

At each step, solve exactly for:

$$
s_c.
$$

Classify:

- irrational $x_c$;
- rational $x_c$ but nonsquare $\Delta(x_c)$;
- rational square closure;
- an exact CARCE rational point.

---

# 46. Redefining G5

G5:

$$
\boxed{
\text{Symbolic Surface Decomposition}.
}
$$

Take:

$$
\Psi(s_1,s_2,s_3)=0
$$

as the canonical symbolic object.

Study:

- factorization under slices;
- rational curves;
- singular compactification;
- fibration;
- symmetry quotient;
- local obstructions;
- birational maps.

---

# 47. Redefining G6

G6:

$$
\boxed{
\text{Certificate Escalation}.
}
$$

For any candidate:

$$
T^\ast\in\mathbb Q^3
$$

if:

$$
\Phi(T^\ast)=0,
$$

immediately:

1. generate an integer witness;
2. perform independent big-int verification;
3. normalize to primitive form;
4. generate a JSON certificate;
5. generate a Markdown proof;
6. generate a Lean / Coq target.

---

# 48. Minimal Machine Certificate

A minimal certificate may contain only:

```text
t_a = m_a / n_a
t_b = m_b / n_b
t_c = m_c / n_c
```

and:

```text
Phi(t_a,t_b,t_c) == 0
```

The Verifier then generates for itself:

```text
P_i = n_i^2 - m_i^2
R_i = 2 m_i n_i
Q_i = n_i^2 + m_i^2
```

and:

```text
G = Q_a Q_b Q_c
```

Finally, it reconstructs all seven integer lengths.

The certificate is therefore very compact.

---

# 49. Formal Proof Layer

Once a witness appears,

the formal proof itself is very simple.

Theorem 1 has already completed the abstract part.

What remains is only for a formal checker to verify that a specific set of rational constants:

$$
t_a,t_b,t_c
$$

satisfies:

$$
\Phi=0.
$$

or to verify the generated integer witness directly.

Therefore:

$$
\boxed{
\text{The difficulty lies in discovery, not in final verification}.
}
$$

---

# 50. The Canonical Research Object Following This Paper

From this paper onward,

Geometry Branch G no longer uses:

$$
(a,b,c,d,e,f,g)
$$

as the primary search state.

The canonical state becomes:

$$
\boxed{
T=
(t_a,t_b,t_c)
}
$$

and:

$$
\boxed{
S=
(s_1,s_2,s_3)
=
(t_a^2,t_b^2,t_c^2).
}
$$

The canonical equations are:

$$
\boxed{
\Phi(T)=0
}
$$

and:

$$
\boxed{
\Psi(S)=0.
}
$$

Classical Perfect Cuboid existence:

$$
\boxed{
T\in\mathbb Q^3.
}
$$

---

# 51. Restating the Main Proposition

The Perfect Cuboid conjecture can henceforth be restated as:

> Does the CARCE smooth surface in the open cube $(0,1)^3$ contain a rational point?

That is:

$$
\boxed{
\exists
T\in
\mathbb Q^3\cap(0,1)^3
:
\Phi(T)=0?
}
$$

This statement is exactly equivalent to classical Perfect Cuboid existence.

---

# 52. What Is Currently Complete and What Remains Incomplete

## Complete

- Center-Axis formulation;
- half-angle rational compression;
- CARCE;
- exact equivalence theorem;
- integer witness generator;
- square-defect bridge;
- shared-core bridge;
- symmetric polynomial surface;
- smoothness proof;
- exact embedding of the current seed;
- proof completion criterion.

## Incomplete

- Find:
  $$
  T^\ast\in\mathbb Q^3\cap\mathcal M;
  $$
- Prove:
  $$
  \mathcal M(\mathbb Q)\neq\varnothing;
  $$
- Or prove in the opposite direction:
  $$
  \mathcal M(\mathbb Q)=\varnothing.
  $$

Thus, the classical Perfect Cuboid problem remains unsolved by this paper.

However, the problem has been compressed exactly into an explicit rational-point existence problem.

---

# 53. Research Philosophy

This research line can now be simplified to:

$$
\boxed{
\text{Geometry gives the surface.}
}
$$

$$
\boxed{
\text{Arithmetic chooses the points.}
}
$$

$$
\boxed{
\text{Exact verification decides the theorem.}
}
$$

The Geometry Engine is no longer responsible for proof.

The Arithmetic Observer is no longer responsible for generating the world.

The Verifier does not participate in heuristics.

The three are separated:

$$
\boxed{
\text{Generate}
\rightarrow
\text{Rationalize}
\rightarrow
\text{Certify}.
}
$$

---

# 54. Final Conclusion

This paper reformulates Perfect Cuboid existence exactly as:

$$
\boxed{
\mathcal M(\mathbb Q)\neq\varnothing,
}
$$

where:

$$
\mathcal M
=
\left\{
(t_a,t_b,t_c)\in(0,1)^3:
\left(
\frac{1-t_a^2}{1+t_a^2}
\right)^2
+
\left(
\frac{1-t_b^2}{1+t_b^2}
\right)^2
+
\left(
\frac{1-t_c^2}{1+t_c^2}
\right)^2
=
1
\right\}.
$$

The current seed:

$$
\boxed{
T_0
=
\left(
\frac{25}{39},
\frac{17}{28},
\sqrt{\frac{233}{1913}}
\right)
}
$$

already lies exactly on:

$$
\mathcal M.
$$

Among the three arithmetic half-angle channels:

$$
t_a\in\mathbb Q,
$$

$$
t_b\in\mathbb Q,
$$

while:

$$
t_c^2\in\mathbb Q
$$

but currently:

$$
t_c\notin\mathbb Q.
$$

Thus, the main objective of subsequent research is very clear:

$$
\boxed{
\text{On the CARCE surface, bring the third square-defect closure to a rational square,
or find any other rational point.}
}
$$

Once we find:

$$
\boxed{
T^\ast\in\mathbb Q^3\cap\mathcal M,
}
$$

we can automatically generate:

$$
\boxed{
(A,B,C,D,E,F,G)\in\mathbb Z_{>0}^7
}
$$

and complete an exact constructive proof of Perfect Cuboid existence.

---

## Canonical One-Line Target

$$
\boxed{
\exists\,
t_a,t_b,t_c\in\mathbb Q\cap(0,1)
:
\sum_{i\in\{a,b,c\}}
\left(
\frac{1-t_i^2}{1+t_i^2}
\right)^2
=
1.
}
$$

---

**End of Canonical Paper v0.1**
