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

# The First-Manifestation Problem: From Rational Closure to the Minimal Primitive Cuboid

## The First-Manifestation Problem: From Rational Closure to the Minimal Primitive Cuboid

**Series: Global Closure Theory of the Perfect Cuboid**  
**Paper: 06 / 08**  
**Status: Research introductory draft / Phase 0 — Conceptual Closure**  
**Date: 2026-09-28**

---

## Abstract

The first five papers have decomposed the Perfect Cuboid research process, moving from brute-force integer search to the continuously closed world, the scale quotient space, constraint-induced differentiation, radix observation, and the certification pipeline from floating-point candidates to exact rational closure. This paper enters the final question of the first research stage:

> If rational closure for the Perfect Cuboid truly exists, what does the ‘first’ perfect cuboid mean?

Since all Perfect Cuboid equations are homogeneous quadratics, the existence of one integer solution implies the existence of all its positive-integer multiples. Thus, a ‘minimal integer solution’ without primitive reduction has no clear mathematical meaning; what must actually be compared are different shapes in the scale quotient space, with each rational shape assigned a unique primitive integer representative.

This paper establishes:

$$
\mathcal P
=
\left\{
P=(a,b,c,d,e,f,g)\in\mathbb Z_{>0}^{7}
:
F(P)=0,
\;
\gcd(a,b,c,d,e,f,g)=1
\right\}
$$

and the canonical primitive solution space after quotienting out permutations of the three axes. If we specify:

$$
a\le b\le c,
$$

and let:

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

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

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

then automatically:

$$
d\le e\le f<g.
$$

A primitive shape can therefore be uniquely canonicalized into an ordered seven-tuple.

This paper further explains that, under the existence assumption, the well-ordering of the positive integers implies that for any proper height taking positive-integer values, such as the space diagonal:

$$
H_g(P)=g,
$$

there must be at least one minimal primitive solution. Since:

$$
g
$$

is strictly greater than the other six positive components,

we have:

$$
H_{\max}(P)=g.
$$

Thus, ‘the minimal maximum coordinate’ and ‘the minimal space diagonal’ define the same ordering.

However, ‘finding a primitive solution’ and ‘proving that it is the first’ are two different propositions. The former requires only an exact witness; the latter also requires excluding all primitive solutions with:

$$
g<g_\ast
$$

. This paper therefore decomposes first manifestation into:

$$
\text{Existence Certificate}
+
\text{Minimality Certificate}.
$$

In addition, this paper establishes a bidirectional canonical correspondence between normalized rational shapes and primitive integer representatives, explaining that if a rational point exists in the:

$$
g=1
$$

gauge, the least common multiple of all its reduced denominators gives an integer representative; dividing by the overall gcd then gives the unique primitive representative.

Finally, this paper defines various heights, search lower bounds, and the distinction between a first hit and the true minimum, and establishes a formal handoff to the next paper, ‘After the First Solution: Arithmetic Freedom of the Perfect Cuboid’: first manifestation answers only existence and the minimal witness; it does not answer the number, density, generation laws, or degrees of freedom of primitive shapes at all.

---

## 1. Once a Solution Is Found, Scale Immediately Ceases to Carry Information

The Perfect Cuboid equations are:

$$
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.
$$

If:

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

is a positive-integer solution,

then for any:

$$
k\in\mathbb Z_{>0},
$$

we have:

$$
kP
=
(ka,kb,kc,kd,ke,kf,kg)
$$

which is still a solution.

This is because:

$$
(ka)^2+(kb)^2
=
k^2(a^2+b^2)
=
(kd)^2,
$$

and the other three equations follow in the same way.

Thus, once one solution exists,

there immediately exist:

$$
P,2P,3P,4P,\ldots.
$$

Therefore:

$$
\boxed{
\text{raw integer solution count}
}
$$

is not the first quantity truly worth studying.

---

## 2. Primitive reduction

For any integer solution:

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

define:

$$
h(P)
=
\gcd(a,b,c,d,e,f,g).
$$

Let:

$$
P_{\mathrm{prim}}
=
\frac{1}{h(P)}P.
$$

Then:

$$
P_{\mathrm{prim}}\in\mathbb Z_{>0}^{7},
$$

and:

$$
\gcd(P_{\mathrm{prim}})=1.
$$

By homogeneity:

$$
F(P)=0
$$

implies:

$$
F(P_{\mathrm{prim}})=0.
$$

Thus, every integer solution orbit:

$$
\{kP_{\mathrm{prim}}:k\in\mathbb Z_{>0}\}
$$

contains a unique primitive representative.

Hence:

$$
\boxed{
\text{integer solution}
\rightarrow
\text{unique primitive scale representative}
}
$$

---

## 3. Uniqueness of the Primitive Representative

Suppose:

$$
P
$$

and:

$$
Q
$$

are both primitive integer solutions,

and:

$$
Q=\lambda P
$$

for some:

$$
\lambda\in\mathbb Q_{>0}.
$$

Write:

$$
\lambda=\frac mn
$$

with:

$$
\gcd(m,n)=1.
$$

Since:

$$
Q=\frac mnP
$$

is an integer vector,

we have:

$$
n
$$

divides:

$$
P
$$

component by component.

But:

$$
\gcd(P)=1.
$$

Therefore:

$$
n=1.
$$

Similarly:

$$
P=\frac1mQ
$$

is an integer vector,

so:

$$
m
$$

divides:

$$
Q
$$

component by component.

From:

$$
\gcd(Q)=1,
$$

we obtain:

$$
m=1.
$$

Hence:

$$
\lambda=1
$$

and:

$$
P=Q.
$$

Therefore:

$$
\boxed{
\text{Each rational scale class has at most one primitive integer representative}
}
$$

Before axis permutations are handled, this uniqueness applies to fixed coordinate labels.

---

## 4. Edge-Length Permutations Still Create Duplicates

The three axes of a cuboid have no natural labels.

If:

$$
(a,b,c)
$$

is a set of edge lengths,

then any:

$$
\sigma\in S_3
$$

gives:

$$
(a_{\sigma(1)},a_{\sigma(2)},a_{\sigma(3)})
$$

which describes the same unlabeled cuboid.

Primitive reduction is therefore not enough.

A canonical permutation is also needed.

This paper uses:

$$
\boxed{
a\le b\le c
}
$$

as the canonical edge ordering.

---

## 5. Canonical face-diagonal ordering

Under:

$$
a\le b\le c
$$

this ordering,

define:

$$
d=\sqrt{a^2+b^2},
$$

$$
e=\sqrt{a^2+c^2},
$$

$$
f=\sqrt{b^2+c^2}.
$$

Then:

$$
a^2+b^2
\le
a^2+c^2
\le
b^2+c^2.
$$

Therefore:

$$
d\le e\le f.
$$

And:

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

so:

$$
f<g.
$$

Thus, a canonical primitive tuple automatically satisfies:

$$
\boxed{
a\le b\le c,
\qquad
d\le e\le f<g.
}
$$

This gives the tuple:

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

a stable canonical serialization.

---

## 6. Canonical primitive solution space

Define:

$$
\mathcal P_{\mathrm{can}}
=
\left\{
P\in\mathbb Z_{>0}^{7}
:
F(P)=0,
\;
\gcd(P)=1,
\;
a\le b\le c
\right\}.
$$

This set has simultaneously removed:

- overall scale redundancy;
- permutation redundancy of the three axes.

Thus:

$$
\boxed{
\mathcal P_{\mathrm{can}}
}
$$

is the primitive Perfect Cuboid shape set in the precise sense used in the rest of this paper.

If:

$$
\mathcal P_{\mathrm{can}}=\varnothing,
$$

then no Perfect Cuboid exists.

If:

$$
\mathcal P_{\mathrm{can}}\neq\varnothing,
$$

then the original conjecture is true.

---

## 7. Rational Shape Space and Primitive Integer Space

Return to the normalization:

$$
g=1.
$$

Let:

$$
x=\frac ag,
$$

$$
y=\frac bg,
$$

$$
z=\frac cg.
$$

If:

$$
P\in\mathcal P_{\mathrm{can}},
$$

then:

$$
x,y,z\in\mathbb Q_{>0}
$$

and:

$$
x^2+y^2+z^2=1.
$$

Moreover:

$$
\sqrt{x^2+y^2},
$$

$$
\sqrt{x^2+z^2},
$$

$$
\sqrt{y^2+z^2}
$$

also all belong to:

$$
\mathbb Q.
$$

Thus, every primitive integer solution produces a canonical rational shape.

In the opposite direction,

if we find:

$$
Q=
(x,y,z,u,v,w,1)
\in\mathbb Q_{>0}^{7}
$$

satisfying all the exact equations,

we can clear denominators to obtain an integer solution,

and then perform primitive reduction.

There is therefore a natural correspondence:

$$
\boxed{
\text{canonical rational shape class}
\leftrightarrow
\text{canonical primitive integer solution}
}
$$

---

## 8. From a Normalized Rational Shape Back to an Integer Representative

Suppose:

$$
Q=
\left(
\frac{p_1}{q_1},
\frac{p_2}{q_2},
\ldots,
\frac{p_6}{q_6},
1
\right)
$$

where each fraction is reduced.

Let:

$$
L=
\operatorname{lcm}(q_1,\ldots,q_6).
$$

Then:

$$
LQ
$$

is an integer vector.

Let:

$$
Y=LQ.
$$

Next, let:

$$
h=\gcd(Y).
$$

Then:

$$
P=\frac Yh
$$

is a primitive integer representative.

Thus:

$$
\boxed{
Q
\rightarrow
LQ
\rightarrow
\frac{LQ}{\gcd(LQ)}
}
$$

is a deterministic canonical scaling pipeline.

---

## 9. If Only the Three Normalized Edges Are Stored

There is actually no need to store:

$$
u,v,w.
$$

As long as we have:

$$
(x,y,z)\in\mathbb Q_{>0}^{3}
$$

satisfying:

$$
x^2+y^2+z^2=1
$$

and:

$$
x^2+y^2\in\mathbb Q^2,
$$

$$
x^2+z^2\in\mathbb Q^2,
$$

$$
y^2+z^2\in\mathbb Q^2,
$$

we can recover:

$$
u,v,w.
$$

If:

$$
x=\frac{p_x}{q_x},
$$

$$
y=\frac{p_y}{q_y},
$$

$$
z=\frac{p_z}{q_z},
$$

let:

$$
L=\operatorname{lcm}(q_x,q_y,q_z).
$$

Then:

$$
A=Lx,
$$

$$
B=Ly,
$$

$$
C=Lz
$$

are all integers.

Also, since:

$$
x^2+y^2+z^2=1,
$$

we have:

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

Thus:

$$
G=L
$$

is already an integer space diagonal.

If the three pairwise sums are also all rational squares,

then the corresponding face diagonals multiplied by:

$$
L
$$

are integers as well.

Finally, perform primitive reduction.

---

## 10. Primitive Representatives and Normalized Denominators

For a canonical primitive solution:

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

consider the normalized tuple:

$$
Q=
\left(
\frac ag,
\frac bg,
\frac cg,
\frac dg,
\frac eg,
\frac fg,
1
\right).
$$

Each fraction can be reduced individually,

so an individual denominator need not be:

$$
g.
$$

However, the least common multiple of all reduced denominators must divide:

$$
g.
$$

Let that least common multiple be:

$$
L.
$$

Then:

$$
LQ
$$

is an integer solution.

Since:

$$
P
$$

is the primitive integer representative of the same rational shape class,

and the primitive representative is unique,

the primitive reduction:

$$
\operatorname{prim}(LQ)
$$

must return:

$$
P.
$$

Therefore:

$$
\boxed{
\text{normalized denominator data}
}
$$

can recover the primitive shape,

but no individual denominator should be equated directly with:

$$
g.
$$

---

## 11. What Does ‘First’ Mean?

Once:

$$
\mathcal P_{\mathrm{can}}\neq\varnothing,
$$

an ordering still needs to be specified.

Without an ordering,

‘first’ has no mathematical meaning.

We can define a height:

$$
H:
\mathcal P_{\mathrm{can}}
\rightarrow
\mathbb Z_{>0}.
$$

and then seek:

$$
P_\ast
\in
\operatorname*{arg\,min}_{P\in\mathcal P_{\mathrm{can}}}
H(P).
$$

Different choices of:

$$
H
$$

may give different ‘first’ solutions.

---

## 12. Space-Diagonal Height

One of the most natural choices is:

$$
H_g(P)=g.
$$

This is because:

$$
g
$$

is the longest geometric length in the entire cuboid.

And:

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

Therefore:

$$
\max(a,b,c,d,e,f,g)=g.
$$

Hence:

$$
\boxed{
H_{\max}(P)=H_g(P)=g.
}
$$

Thus, ‘the minimal maximum coordinate’ and ‘the minimal space diagonal’ are exactly the same.

This is a very convenient canonical height.

---

## 13. Maximum-Edge Height

We can also define:

$$
H_c(P)=c
$$

since:

$$
a\le b\le c.
$$

It seeks:

> A primitive cuboid whose longest edge is as short as possible.

However:

$$
\arg\min c
$$

need not be the same as:

$$
\arg\min g
$$

in general.

This is because, for different shape ratios:

$$
g=\sqrt{a^2+b^2+c^2}
$$

and:

$$
c
$$

have different relative sizes.

Thus:

$$
\boxed{
\text{minimum edge scale}
\neq
\text{minimum diagonal scale}
}
$$

and in general these cannot be assumed to coincide.

---

## 14. Volume height

We can also define:

$$
H_V(P)=abc.
$$

It seeks the smallest volume among primitive cuboids.

Likewise:

$$
\arg\min abc
$$

need not equal:

$$
\arg\min g.
$$

If the first publicly discovered solution is called ‘minimal’,

it must be made clear whether this refers to:

$$
g,
$$

$$
c,
$$

$$
abc,
$$

or some other ordering.

---

## 15. Surface-area height

We can define:

$$
H_S(P)=ab+ac+bc.
$$

The actual surface area is:

$$
2H_S(P).
$$

This is also a natural positive-integer height.

But its ordering and that of:

$$
g
$$

need not agree either.

---

## 16. Lexicographic ordering

If we want a completely unique ‘first tuple’,

we can use the lexicographic ordering directly:

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

Or, more reasonably, first order by:

$$
g
$$

and then break ties with:

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

For example, define:

$$
P_1\prec P_2
$$

if:

1. $$g_1<g_2$$;
2. If $$g_1=g_2$$, compare $$c_1<c_2$$;
3. Then compare $$b$$;
4. Then compare $$a$$.

In this way:

$$
\mathcal P_{\mathrm{can}}
$$

if nonempty,

must have a unique lexicographic minimum.

---

## 17. Well-Ordering Guarantees That a Minimal Solution Exists

Suppose:

$$
\mathcal P_{\mathrm{can}}\neq\varnothing.
$$

Consider:

$$
G=
\{g(P):P\in\mathcal P_{\mathrm{can}}\}
\subset
\mathbb Z_{>0}.
$$

Since:

$$
G
$$

is a nonempty set of positive integers,

the well-ordering principle gives:

the existence of:

$$
g_{\min}=\min G.
$$

Thus, there is at least one:

$$
P
$$

such that:

$$
g(P)=g_{\min}.
$$

If a finite tie-break ordering is also used,

we can select a unique:

$$
P_{\min}.
$$

The conditional proposition is therefore:

$$
\boxed{
\mathcal P_{\mathrm{can}}\neq\varnothing
\Rightarrow
\text{A canonical first primitive cuboid exists}
}
$$

This does not prove:

$$
\mathcal P_{\mathrm{can}}\neq\varnothing.
$$

It only says:

> Once a solution exists, a first solution under a well-ordered height must exist.

---

## 18. The First Solution Is Not a Limit Concept, but a Discrete Minimum Element

This is very different from continuous shape space.

Within:

$$
\mathcal S_{\mathbb R}
$$

we may have:

$$
X_n\rightarrow X^\ast
$$

without there necessarily being a ‘first’ real shape.

By contrast, primitive integer space:

$$
\mathcal P_{\mathrm{can}}
$$

is a discrete set.

Thus, once a height:

$$
H:\mathcal P_{\mathrm{can}}\rightarrow\mathbb Z_{>0}
$$

is fixed,

well-ordering can be used to discuss a minimum element.

Therefore:

$$
\boxed{
\text{first manifestation is an arithmetic notion}
}
$$

rather than a purely topological notion.

---

## 19. A First Hit Is Different from the True Minimum

Suppose a searcher first finds:

$$
P_{\mathrm{hit}}.
$$

We can only say:

$$
\boxed{
\text{first discovered by this process}
}
$$

We cannot directly say:

$$
\boxed{
\text{mathematically smallest}
}
$$

To prove that:

$$
P_{\mathrm{hit}}
$$

is minimal under:

$$
H_g
$$

this height,

we must also prove:

$$
\nexists P\in\mathcal P_{\mathrm{can}}
$$

such that:

$$
g(P)<g(P_{\mathrm{hit}}).
$$

Therefore:

$$
\boxed{
\text{discovery order}
\neq
\text{mathematical order}
}
$$

---

## 20. Existence Certificates and Minimality Certificates

This gives two entirely different kinds of certificate.

### Existence Certificate

Give:

$$
P_\ast
$$

and verify exactly:

$$
F(P_\ast)=0.
$$

This suffices to prove:

$$
\mathcal P_{\mathrm{can}}\neq\varnothing.
$$

### Minimality Certificate

We also need to prove:

$$
\forall P\in\mathcal P_{\mathrm{can}},
$$

if:

$$
g(P)<g(P_\ast),
$$

then a contradiction follows.

Thus:

$$
\boxed{
\text{Existence}
}
$$

compared with:

$$
\boxed{
\text{Minimality}
}
$$

is usually much easier.

---

## 21. Once the First Witness Is Found, the Conjecture Is Solved

The research objectives need to be clearly distinguished here.

If we find any:

$$
P\in\mathcal P_{\mathrm{can}},
$$

the Perfect Cuboid existence question is finished.

There is no need to prove that it is minimal first.

That is:

$$
\boxed{
\exists P
}
$$

and:

$$
\boxed{
P=P_{\min}
}
$$

are two different theorems.

Thus, if an enormous candidate gives an exact PASS,

we should immediately separate:

$$
\text{existence theorem}
$$

from:

$$
\text{minimality program}
$$

as different research tasks.

---

## 22. Two Meanings of First Manifestation

This paper therefore distinguishes:

### Weak First Manifestation

A primitive Perfect Cuboid found and certified for the first time by humans or an algorithm.

This is a historical / computational event.

### Strong First Manifestation

The truly minimal canonical primitive Perfect Cuboid under a prespecified height:

$$
H
$$

as specified above.

This is a mathematical ordering problem.

Therefore:

$$
\boxed{
\text{first discovered}
\neq
\text{first ordered}
}
$$

---

## 23. If the First Witness Is Large, Minimality May Be Much Harder than Existence

Suppose the first exact discovery gives:

$$
g_\ast\approx10^{1000}.
$$

Then proving that it is:

$$
g
$$

-minimal

requires excluding:

$$
1\le g<g_\ast.
$$

Even with strong sieving methods,

this may be an enormous computational problem.

Thus, a formal publication can initially state:

$$
\text{Existence: PROVED},
$$

while:

$$
\text{Minimality: OPEN}.
$$

with no contradiction at all.

---

## 24. A Search Lower Bound Is Not a Minimality Proof Unless Its Range Is Complete

Suppose a program has searched:

$$
g\le H_0
$$

without finding a solution.

Only if the search algorithm has been proved to have:

- enumerated all canonical primitive candidates;
- omitted no equivalence class;
- used exact arithmetic;
- a clearly defined range;

can we obtain:

$$
\boxed{
g_{\min}>H_0
}
$$

This is a legitimate lower bound.

If a heuristic search simply fails to find a solution,

the same conclusion cannot be drawn.

We must therefore distinguish:

$$
\boxed{
\text{search absence}
}
$$

from:

$$
\boxed{
\text{certified exclusion}
}
$$

---

## 25. Certified lower bound

Define:

$$
L_g
$$

as the height up to which exclusion has been proved.

If:

$$
\forall P\in\mathcal P_{\mathrm{can}},
\quad
g(P)>L_g,
$$

then:

$$
L_g
$$

is a certified lower bound.

If we also find:

$$
P_\ast
$$

such that:

$$
g(P_\ast)=L_g+1,
$$

we immediately obtain:

$$
g_{\min}=L_g+1.
$$

More generally,

if we have excluded:

$$
g<g_\ast
$$

and:

$$
P_\ast
$$

exists,

then:

$$
P_\ast
$$

under:

$$
g
$$

-ordering is a minimal solution.

---

## 26. Height interval

When a discovery has not yet been proved minimal,

we can maintain:

$$
L_g<g_{\min}\le U_g,
$$

where:

$$
L_g
$$

is a certified lower bound,

$$
U_g
$$

comes from the smallest currently known exact witness.

Thus:

$$
\boxed{
g_{\min}\in(L_g,U_g]
}
$$

forms an arithmetic search interval that can be narrowed progressively.

If:

$$
L_g=U_g-1,
$$

minimality is complete.

---

## 27. First Manifestation and Radix Representation

Paper 4 established:

$$
\mathcal O_B.
$$

A primitive solution:

$$
P
$$

itself consists of integers,

so in any:

$$
B
$$

it has a finite representation.

Thus, primitive integer first manifestation exists independently of the radix.

However, its digit complexity:

$$
L_B(P)
$$

depends strongly on:

$$
B.
$$

We can therefore additionally ask:

> In which radix is the first primitive cuboid represented most concisely?

This is a representation question,

not an existence question.

---

## 28. Radix Minimality Is Not Arithmetic Minimality

For example, we can define:

$$
H_B(P)=L_B(P).
$$

Then:

$$
\arg\min H_B
$$

may differ from:

$$
\arg\min g
$$

completely.

A numerically large solution,

if it happens to have, in some:

$$
B
$$

a very short digit pattern,

may have very low representation complexity.

Therefore:

$$
\boxed{
\text{numerical height}
\neq
\text{representation height}
}
$$

and the two must be studied separately.

---

## 29. Primitive Height and Shape Complexity

For a normalized shape:

$$
Q=[P],
$$

we can define its primitive height:

$$
H_{\mathrm{prim}}(Q)
=
g(P),
$$

where:

$$
P
$$

is:

$$
Q
$$

its unique canonical primitive integer representative.

In this way:

$$
H_{\mathrm{prim}}
$$

becomes an arithmetic complexity on rational shape classes.

That is:

$$
\boxed{
\text{shape}
\rightarrow
\text{minimum integer realization scale}
}
$$

---

## 30. This Height Can Be Enormous

Two rational points that are very close in Euclidean shape space

can have very different primitive heights.

For example:

$$
Q_1\approx Q_2
$$

does not mean:

$$
H_{\mathrm{prim}}(Q_1)
\approx
H_{\mathrm{prim}}(Q_2).
$$

This is because rational denominators may change dramatically.

This is an important separation between arithmetic geometry and ordinary geometry.

Hence:

$$
\boxed{
\text{geometric nearness}
\not\Rightarrow
\text{arithmetic nearness}
}
$$

---

## 31. First-manifestation landscape

On rational shape points,

we can imagine a function:

$$
H_{\mathrm{prim}}:
\mathcal S_{\mathbb Q}
\rightarrow
\mathbb Z_{>0}.
$$

If:

$$
\mathcal S_{\mathbb Q}\neq\varnothing,
$$

then:

$$
H_{\mathrm{prim}}
$$

forms a highly rugged arithmetic landscape.

The first-manifestation problem is:

$$
\boxed{
\min_{Q\in\mathcal S_{\mathbb Q}}
H_{\mathrm{prim}}(Q)
}
$$

This is entirely different from minimizing a smooth function in real shape space.

---

## 32. The Denominator Profile of a Primitive Shape

For:

$$
Q=
\left(
\frac ag,
\frac bg,
\frac cg
\right)
$$

define the reduced denominators:

$$
q_a,
q_b,q_c.
$$

They can form a denominator profile:

$$
\mathcal D(Q)
=
(q_a,q_b,q_c).
$$

Further, examine the prime valuations:

$$
v_p(q_a),
$$

$$
v_p(q_b),
$$

$$
v_p(q_c).
$$

These quantities may have a strong relationship with:

$$
H_{\mathrm{prim}}(Q)
$$

this height.

Thus, the radix / prime-support observation of Paper 4 can directly serve first-manifestation search.

---

## 33. The Prime Signature of a Primitive Solution

For:

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

define the prime support of all components:

$$
\Pi(P)
=
\bigcup_{x\in P}
\{p:p\mid x\}.
$$

We can also store a valuation matrix:

$$
V(P)
=
\left(
v_p(a),v_p(b),\ldots,v_p(g)
\right)_p.
$$

If a first solution exists,

its valuation profile may be very special.

However:

$$
\boxed{
\text{smallest }g
}
$$

need not correspond to:

$$
\boxed{
\text{simplest prime factorization}
}
$$

The prime signature is therefore a side observable,

not the canonical first ordering.

---

## 34. Symmetry case

If:

$$
a=b,
$$

then:

$$
d^2=2a^2.
$$

If:

$$
a,d\in\mathbb Z_{>0},
$$

this requires:

$$
d=a\sqrt2,
$$

which cannot be an integer.

Thus, a primitive Perfect Cuboid must satisfy:

$$
a\neq b.
$$

Similarly:

$$
a\neq c,
$$

$$
b\neq c.
$$

Under the canonical ordering:

$$
\boxed{
a<b<c.
}
$$

Thus, a genuine Perfect Cuboid cannot lie on the:

$$
S_3
$$

symmetry boundary.

This allows the canonical fundamental domain to be restricted further to the interior:

$$
a<b<c.
$$

---

## 35. The Diagonals Are Also Strictly Ordered

From:

$$
a<b<c,
$$

we obtain:

$$
a^2+b^2
<
a^2+c^2
<
b^2+c^2.
$$

Hence:

$$
d<e<f.
$$

and:

$$
f<g.
$$

Thus, any canonical tuple of a nondegenerate integer Perfect Cuboid must satisfy:

$$
\boxed{
a<b<c<g,
\qquad
d<e<f<g.
}
$$

Note that:

$$
c
$$

and:

$$
d
$$

need not have a fixed relative order.

Thus, all seven quantities cannot simply be put into one total ordering.

---

## 36. Necessary canonical inequalities

The verifier can directly include:

$$
0<a<b<c,
$$

$$
0<d<e<f<g.
$$

These are not complete sufficient conditions,

but can quickly eliminate permutation duplicates and symmetric degeneracies.

Moreover:

$$
d>b,
$$

$$
e>c,
$$

$$
f>c,
$$

because each face diagonal is greater than its corresponding edges.

These inequalities can form cheap filters for the first-manifestation searcher.

---

## 37. Ratio bounds

From:

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

and:

$$
a<b<c,
$$

we obtain:

$$
c^2<g^2<3c^2.
$$

Therefore:

$$
\boxed{
1<\frac gc<\sqrt3.
}
$$

Also, since:

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

we have:

$$
c<f<\sqrt2\,c.
$$

Although these basic ratio bounds do not solve the problem,

they can be used for:

- normalization consistency;
- candidate sanity checks;
- height conversion.

---

## 38. A Rough Comparison of $g$-Height and $c$-Height

Since:

$$
c<g<\sqrt3\,c,
$$

we have:

$$
H_c(P)<H_g(P)<\sqrt3\,H_c(P).
$$

Thus, if we already have:

$$
c>L_c,
$$

we can obtain:

$$
g>L_c.
$$

In the opposite direction,

if:

$$
g\le U_g,
$$

then:

$$
c<U_g.
$$

Bounds for different heights can be converted into one another,

but cannot fully replace one another.

---

## 39. First-manifestation search space

Fix:

$$
g=G.
$$

Then:

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

Thus:

$$
(a,b,c)
$$

lies on an integer three-dimensional sphere of radius:

$$
G
$$

as specified above.

We also require:

$$
a^2+b^2,
$$

$$
a^2+c^2,
$$

$$
b^2+c^2
$$

to all be squares.

Thus, for fixed:

$$
G,
$$

first-manifestation search can be divided into:

1. Enumerate integer sphere points;
2. Canonicalize:
   $$
   a<b<c;
   $$
3. Check the three pairwise square conditions.

This is a completely exact finite problem.

Thus, to prove:

$$
g_{\min}>G_0,
$$

one can theoretically perform, for every:

$$
1\le G\le G_0
$$

an exhaustive exact exclusion.

The actual computational cost is another matter.

---

## 40. The Sphere-Shell View at Fixed $g$

For each:

$$
G,
$$

define:

$$
\mathcal L_G
=
\left\{
(a,b,c)\in\mathbb Z_{>0}^{3}
:
a<b<c,
\;
a^2+b^2+c^2=G^2
\right\}.
$$

Perfect Cuboid candidates are:

$$
\mathcal C_G
=
\left\{
(a,b,c)\in\mathcal L_G:
a^2+b^2,
a^2+c^2,
b^2+c^2
\text{are all squares}
\right\}.
$$

Thus:

$$
\mathcal C_G\neq\varnothing
$$

if and only if at height:

$$
G
$$

there exists a canonical primitive candidate; a primitive check then determines whether it is a new shape.

The first:

$$
G
$$

such that:

$$
\mathcal C_G\neq\varnothing
$$

is:

$$
g_{\min}.
$$

---

## 41. A Primitive Check Is Still Indispensable within a Fixed Shell

Even if:

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

satisfies all the equations,

it is still possible that:

$$
\gcd(P)>1.
$$

Then it is merely a multiple of some smaller primitive solution.

Thus, within:

$$
\mathcal C_G
$$

we must still check:

$$
\gcd(P)=1.
$$

If:

$$
h>1,
$$

the true primitive height is:

$$
\frac Gh.
$$

Thus, if we traverse:

$$
G
$$

in increasing order,

a nonprimitive hit will not be the first primitive manifestation.

---

## 42. A Primitive-Only Parameterization Can Avoid Scale Duplicates

Another approach is to require in advance:

$$
\gcd(a,b,c)=1
$$

Is this sufficient?

If:

$$
\gcd(a,b,c)=1,
$$

then the gcd of the entire seven-tuple must also be:

$$
1.
$$

This is because any number dividing:

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

of course also divides:

$$
a,b,c.
$$

Therefore:

$$
\boxed{
\gcd(a,b,c)=1
\Rightarrow
\gcd(P)=1.
}
$$

Conversely,

if the entire tuple is primitive,

then:

$$
\gcd(a,b,c)=1
$$

must also hold.

Thus, for a Perfect Cuboid:

$$
\boxed{
\gcd(P)=1
\iff
\gcd(a,b,c)=1.
}
$$

The primitive check can therefore examine only the three edges.

---

## 43. This Makes the Minimal Certificate Smaller

A canonical primitive certificate can therefore actually store only:

$$
(a,b,c)
$$

and require:

$$
a<b<c,
$$

$$
\gcd(a,b,c)=1.
$$

Then compute:

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

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

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

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

All four right-hand sides must be perfect squares.

This is:

$$
\boxed{
\text{Minimal Primitive Certificate}
=
(a,b,c).
}
$$

---

## 44. First Manifestation Can Be Ordered Entirely by Triples

We can therefore define directly:

$$
\mathcal E
=
\left\{
(a,b,c)\in\mathbb Z_{>0}^{3}
:
a<b<c,
\;
\gcd(a,b,c)=1,
\;
a^2+b^2,
a^2+c^2,
b^2+c^2,
a^2+b^2+c^2
\in\mathbb Z^2
\right\}.
$$

where:

$$
\mathbb Z^2
=
\{n^2:n\in\mathbb Z\}.
$$

Perfect Cuboid existence is equivalent to:

$$
\boxed{
\mathcal E\neq\varnothing.
}
$$

And:

$$
g(a,b,c)
=
\sqrt{a^2+b^2+c^2}
$$

on:

$$
\mathcal E
$$

takes positive-integer values.

Thus, first manifestation:

$$
P_{\min}
$$

can be defined entirely by:

$$
\min_{(a,b,c)\in\mathcal E}g(a,b,c)
$$

.

---

## 45. The Triple Set in the Rational Version

Normalized rational shapes can be written as:

$$
\mathcal E_{\mathbb Q}
=
\left\{
(x,y,z)\in\mathbb Q_{>0}^{3}
:
x<y<z,
\;
x^2+y^2+z^2=1,
\;
x^2+y^2,
x^2+z^2,
y^2+z^2
\in\mathbb Q^2
\right\}.
$$

Then:

$$
\mathcal E\neq\varnothing
\iff
\mathcal E_{\mathbb Q}\neq\varnothing.
$$

Each:

$$
Q\in\mathcal E_{\mathbb Q}
$$

has a unique primitive integer representative:

$$
\operatorname{Prim}(Q)\in\mathcal E.
$$

We can therefore define:

$$
H_{\mathrm{prim}}(Q)
=
g(\operatorname{Prim}(Q)).
$$

First manifestation is:

$$
\boxed{
\min_{Q\in\mathcal E_{\mathbb Q}}
H_{\mathrm{prim}}(Q).
}
$$

---

## 46. First Manifestation and Constraint Trajectories

Paper 3 produces a continuous trajectory:

$$
X_0\rightarrow X_1\rightarrow\cdots.
$$

Paper 5 reconstructs some:

$$
X_n
$$

as:

$$
Q_n\in\mathbb Q^3.
$$

If:

$$
Q_n\in\mathcal E_{\mathbb Q},
$$

we obtain:

$$
P_n=\operatorname{Prim}(Q_n).
$$

The searcher can therefore maintain:

$$
U_g
=
\min_n g(P_n)
$$

as the current best known exact upper bound.

Whenever a smaller primitive witness is found,

update:

$$
U_g.
$$

---

## 47. Minimality Feedback Can Constrain the Generator in Return

If the current:

$$
U_g
$$

is known,

then for any candidate shape:

$$
Q
$$

if its primitive height after reconstruction satisfies:

$$
H_{\mathrm{prim}}(Q)\ge U_g,
$$

it may be a new solution,

but will not improve the first-manifestation upper bound.

Thus, if the research objective switches to ‘finding the minimum’,

the searcher can be given:

$$
H_{\mathrm{prim}}
$$

pressure.

But if the research objective is ‘finding more shapes’,

this bias should not be used.

Thus:

$$
\boxed{
\text{existence mode}
\neq
\text{minimality mode}
\neq
\text{enumeration mode}.
}
$$

---

## 48. Three Search Modes

### Mode E: Existence

Objective:

$$
\exists P.
$$

Any exact primitive solution is a success.

### Mode M: Minimality

At least one solution is known,

and the objective is:

$$
\min g(P).
$$

An upper bound and exhaustive lower exclusion are needed.

### Mode X: Expansion

There is no longer any particular preference for small:

$$
g.
$$

The objective is to discover more inequivalent primitive shapes,

and study the solution-space structure.

Starting with Paper 7, the primary focus moves to:

$$
\boxed{
\text{Mode X}
}
$$

---

## 49. Finding the Minimal Solution Does Not Mean Finding a Generation Law

Even if in the future we complete:

$$
P_{\min},
$$

we still do not know:

- whether there are only finitely many primitive shapes;
- whether there are infinitely many;
- whether a one-parameter family exists;
- whether a solution-preserving map exists;
- the height distribution of solutions;
- whether there are common patterns across different radices;
- whether primitive solutions form multiple disconnected arithmetic families.

Thus:

$$
\boxed{
\text{minimum}
}
$$

is only a boundary fact.

It is not a theory of the solution space.

---

## 50. Specify Precisely Which Kind of ‘Infinitely Many Solutions’ Is Meant

If a primitive solution exists:

$$
P,
$$

then:

$$
kP
$$

gives infinitely many raw integer solutions.

Thus:

$$
\boxed{
\text{raw integer solutions infinite}
}
$$

holds immediately, conditionally.

However:

$$
\boxed{
\text{primitive solution classes infinite}
}
$$

is an entirely different question.

It is possible that:

$$
|\mathcal P_{\mathrm{can}}|=1,
$$

or that the number is finite but greater than:

$$
1,
$$

or that it is infinite.

Thus, Paper 7 will no longer use the vague phrase ‘infinitely many solutions’,

but will explicitly distinguish:

$$
\text{scaling infinity}
$$

from:

$$
\text{shape infinity}.
$$

---

## 51. The Boundary Between First Manifestation and Arithmetic Freedom

The first-manifestation problem asks only:

$$
\min H(P).
$$

The arithmetic-freedom problem asks how large:

$$
\mathcal P_{\mathrm{can}}
$$

is as a whole.

The two are logically independent.

Even if:

$$
P_{\min}
$$

is enormous,

solutions after it may be extremely dense.

Conversely,

even if:

$$
P_{\min}
$$

is small,

it may be the only primitive shape.

Therefore:

$$
\boxed{
\text{first height}
\not\Rightarrow
\text{solution density}.
}
$$

---

## 52. Preview of the Height Counting Function

Papers 7 and 8 will use:

$$
N_g(H)
=
\#\left\{
P\in\mathcal P_{\mathrm{can}}
:
g(P)\le H
\right\}.
$$

If:

$$
\mathcal P_{\mathrm{can}}=\varnothing,
$$

then:

$$
N_g(H)=0
$$

for all:

$$
H.
$$

If a first solution exists,

then:

$$
N_g(H)=0
$$

for:

$$
H<g_{\min},
$$

and:

$$
N_g(g_{\min})\ge1.
$$

How:

$$
N_g(H)
$$

grows thereafter

is the core of the second expansion.

---

## 53. The Role of First Manifestation in the Counting Function

If:

$$
g_{\min}
$$

exists,

it is merely the point where:

$$
N_g(H)
$$

first jumps from:

$$
0
$$

to a positive value.

That is:

$$
\boxed{
g_{\min}
=
\min\{H:N_g(H)>0\}.
}
$$

This provides a very clean unified formulation.

Paper 6 studies:

$$
\text{first jump}.
$$

Paper 8 studies:

$$
\text{growth after the first jump}.
$$

---

## 54. The Limited Meaning of First Manifestation as a Phase-Transition Point

In the language of ‘manifestation’,

we can view:

$$
H
$$

as an integer realization scale.

When:

$$
H<g_{\min}
$$

we have:

$$
N_g(H)=0.
$$

When we reach:

$$
H=g_{\min}
$$

we have:

$$
N_g(H)>0.
$$

Thus:

$$
g_{\min}
$$

is the first threshold of primitive arithmetic realization.

However, this is only a discrete counting threshold,

and should not be equated too closely with a physical phase transition.

This paper calls it:

$$
\boxed{
\text{first arithmetic manifestation threshold}
}
$$

---

## 55. The Order of Search Strategy Should Change

Before existence is settled:

1. Prioritize finding any exact witness;
2. There is no need to seek the minimum first;
3. Store the current smallest upper bound;
4. Accumulate certified lower bounds at the same time.

Once the first witness appears:

1. The existence branch ends;
2. The minimality branch continues;
3. The expansion branch starts immediately.

That is:

$$
\boxed{
\text{one discovery}
\rightarrow
\text{research tree bifurcation}.
}
$$

---

## 56. The Publication Package for a First Witness

If there really appears a:

$$
P_\ast,
$$

the minimal publication package should include:

### A. Canonical primitive tuple

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

### B. Exact identities

The four square identities.

### C. Primitive proof

$$
\gcd(a,b,c)=1.
$$

### D. Canonical ordering

$$
a<b<c.
$$

### E. Independent verifier

At least a second exact implementation.

### F. Reproducible source

Preserve the original integer tuple and verifier source.

There is no need to include a minimality claim first.

---

## 57. What Else Is Needed to Claim ‘Minimal’?

The additional requirements are:

### G. Height definition

For example:

$$
H_g(P)=g.
$$

### H. Complete exclusion range

Prove that for all:

$$
g<g_\ast
$$

no primitive solution exists.

### I. Search completeness proof

Explain why enumeration or sieving has omitted no valid class.

### J. Exact exclusion verification

Every pruning rule must be proved to be a necessary condition.

Only after all four items are complete

can we move from:

$$
\text{a solution}
$$

to:

$$
\text{the minimal solution under }H_g.
$$

---

## 58. Heuristic Pruning and Proof-Safe Pruning

For a minimality search,

every pruning rule should be labeled:

### Proof-safe

If the rule excludes a candidate,

it can be proved mathematically that the candidate cannot be a solution.

### Heuristic-only

It indicates only that the candidate is not worth prioritizing,

but cannot be used for minimality exclusion.

To establish a certified lower bound:

$$
L_g,
$$

we can use only:

$$
\boxed{
\text{proof-safe pruning}
}
$$

or complete enumeration.

---

## 59. Radix Pruning Must Meet the Same Standard

The carry / residue patterns of Paper 4 can greatly reduce the search through pruning.

However, to use them to prove:

$$
g_{\min}>H,
$$

each radix obstruction must establish:

$$
\text{candidate violates necessary condition}
\Rightarrow
\text{candidate impossible}.
$$

A branch cannot be excluded merely because it looks unstable at finite precision.

Thus:

$$
\boxed{
\text{radix heuristic}
}
$$

and:

$$
\boxed{
\text{radix theorem}
}
$$

must be kept separate.

---

## 60. The Role of the Constraint Generator in Minimality

A constraint generator is not suitable for proving a lower bound on its own,

because it does not guarantee coverage of all shapes.

But it is very well suited to providing:

$$
U_g.
$$

That is:

> Find smaller exact witnesses.

The architecture can therefore naturally divide responsibilities:

### Generative side

Continually reduce:

$$
U_g.
$$

### Exhaustive / proof side

Continually increase:

$$
L_g.
$$

Finally, if:

$$
L_g+1=U_g,
$$

the two sides close.

This is a very clear bidirectional bounding architecture.

---

## 61. Lower–upper closure

Maintain:

$$
L_g<U_g.
$$

The generator drives:

$$
U_g\downarrow.
$$

The proof-oriented search drives:

$$
L_g\uparrow.
$$

Finally:

$$
L_g+1=U_g.
$$

then:

$$
\boxed{
g_{\min}=U_g.
}
$$

This can be called:

$$
\boxed{
\text{First-Manifestation Interval Closure}
}
$$

---

## 62. If No Witness Is Ever Found

If there is only:

$$
L_g\rightarrow\infty
$$

a sequence of proofs of this kind,

but still no:

$$
U_g,
$$

nonexistence still cannot be declared directly at any finite stage.

Unless a uniform theorem is obtained:

$$
\forall g,
$$

all heights are impossible.

Thus:

$$
\boxed{
\text{unbounded sequence of finite exclusions}
}
$$

and:

$$
\boxed{
\text{global nonexistence proof}
}
$$

are still different.

---

## 63. If a Witness Is Found, Existence Requires No Extrapolation

Conversely,

as long as one:

$$
P_\ast
$$

gives an exact PASS,

we immediately have:

$$
\exists P.
$$

There is no asymptotic argument.

There is no probabilistic extrapolation.

There is no:

$$
H\rightarrow\infty.
$$

The existence proposition is therefore very amenable to a witness.

This is why Paper 5 assigns such importance to the exact verifier.

---

## 64. A Canonical Database Key for First Manifestation

Each primitive shape can use only:

$$
(a,b,c)
$$

as its key,

with the canonical ordering:

$$
a<b<c.
$$

For example:

```text
PC:a:b:c
```

The complete data then derive:

$$
d,
e,
f,
g.
$$

In this way, scaling copies automatically avoid duplication.

If many solutions are obtained in the future,

the counting database of Papers 7 and 8 can be indexed directly by:

$$
(a,b,c)
$$

this triple.

---

## 65. Minimality under Alternative Heights Can Coexist

Even if:

$$
P_g
$$

minimizes:

$$
g,
$$

we can separately define:

$$
P_c
$$

as minimizing:

$$
c,
$$

$$
P_V
$$

as minimizing:

$$
abc,
$$

$$
P_S
$$

as minimizing:

$$
ab+ac+bc.
$$

They may be the same,

or they may be different.

Thus, if multiple primitive shapes exist in the future,

‘the minimal Perfect Cuboid’ should preferably always be accompanied by:

$$
\boxed{
\text{with respect to which height?}
}
$$

This paper recommends the default:

$$
H_g=g.
$$

---

## 66. Why Using $g$ as the Default Is the Cleanest Choice

The reasons include:

1. $$g$$ is the only one of the seven quantities that must be the largest;
2. $$g$$ is a natural geometric quantity for the overall three-dimensional scale;
3. At fixed $$g$$, candidates lie on an integer sphere shell;
4. $$g$$ is a positive integer;
5. It corresponds perfectly to the normalized gauge $$g=1$$;
6. The counting function:
   $$
   N_g(H)
   $$
   has a natural definition.

Thus, in subsequent work in this series, unless otherwise specified,

‘height’ defaults to:

$$
\boxed{
H(P)=g.
}
$$

---

## 67. From the $g=1$ World to the $g=g_{\min}$ Manifestation

Paper 2 places all shapes in:

$$
g=1.
$$

Paper 6 asks instead:

> By how much must a rational shape be scaled to become a primitive integer world for the first time?

For:

$$
Q\in\mathcal E_{\mathbb Q},
$$

define:

$$
\lambda_{\mathrm{prim}}(Q)
$$

as the unique positive proportional scale making:

$$
\lambda Q
$$

a primitive integer tuple.

Under:

$$
g(Q)=1
$$

this normalization,

the primitive space diagonal is:

$$
g(\operatorname{Prim}(Q))
=
\lambda_{\mathrm{prim}}(Q).
$$

Therefore:

$$
\boxed{
H_{\mathrm{prim}}(Q)
=
\lambda_{\mathrm{prim}}(Q)
}
$$

in the:

$$
g=1
$$

gauge has a very direct meaning:

> It is the magnification factor required for this shape's first integer manifestation.

---

## 68. This Makes ‘Expansion by Scaling Up’ Precise

For a rational shape:

$$
Q,
$$

starting from:

$$
g=1
$$

this normalization,

take:

$$
\lambda_{\mathrm{prim}}(Q)
$$

Then:

$$
\lambda_{\mathrm{prim}}(Q)Q
$$

becomes a primitive integer solution.

Thus:

$$
\boxed{
\text{first manifestation scale}
=
\text{primitive scaling factor}
}
$$

This agrees exactly with the intuition at the beginning of this series:

> First find an exact shape in the normalized world, then scale it up to its first integer manifestation.

---

## 69. The First-Manifestation Scale Is a Shape Invariant

If:

$$
Q'
=
\mu Q
$$

is merely another rational scale of the same shape,

primitive reduction ultimately returns to the same:

$$
P.
$$

Thus:

$$
H_{\mathrm{prim}}
$$

is essentially a shape-class invariant,

and is simply easiest to interpret, in the:

$$
g=1
$$

gauge, as a scale factor.

---

## 70. Once a First Solution Exists, the Next Question Is Not ‘Scale Up Again’

This is because:

$$
2P_{\min},
3P_{\min},\ldots
$$

are all just the same shape.

The true next step is to find:

$$
Q\not\sim P_{\min}
$$

with:

$$
F(Q)=0.
$$

that is, a new primitive shape class.

Thus, after:

$$
\boxed{
\text{first manifestation}
}
$$

this first manifestation,

the research focus immediately shifts from:

$$
\text{scale}
$$

to:

$$
\text{shape multiplicity}.
$$

---

## 71. The Entry Point to the Second Expansion

Suppose:

$$
P_1
$$

is the first primitive shape.

Then define:

$$
\mathcal T(P_1)
$$

If there exists a solution-preserving transformation:

$$
F(P)=0
\Rightarrow
F(\mathcal T(P))=0,
$$

and:

$$
\mathcal T(P)\not\sim P,
$$

then:

$$
P_1
\rightarrow
P_2
\rightarrow
P_3
\rightarrow\cdots
$$

may unfold an entire arithmetic family.

This is precisely the core subject of Paper 7.

---

## 72. This Paper's Core Logical Chain

If:

$$
\mathcal E_{\mathbb Q}\neq\varnothing,
$$

then:

$$
\mathcal E\neq\varnothing.
$$

If:

$$
\mathcal E\neq\varnothing,
$$

then by well-ordering:

$$
\exists g_{\min}.
$$

Thus:

$$
\boxed{
\mathcal E_{\mathbb Q}\neq\varnothing
\Rightarrow
\exists\text{ canonical first primitive manifestation}.
}
$$

However, the genuinely unknown part is still the first antecedent:

$$
\boxed{
\mathcal E_{\mathbb Q}\overset{?}{\neq}\varnothing.
}
$$

This series does not misstate a conditional inference as an existence proof.

---

## 73. This Paper's Formal Definitions

### Definition 1: Primitive Perfect Cuboid

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

satisfying:

$$
F(P)=0
$$

and:

$$
\gcd(a,b,c)=1.
$$

### Definition 2: Canonical Primitive Perfect Cuboid

In addition to Definition 1, require:

$$
a<b<c.
$$

### Definition 3: Default Height

$$
H(P)=g.
$$

### Definition 4: First Manifestation

If:

$$
\mathcal P_{\mathrm{can}}\neq\varnothing,
$$

then:

$$
P_{\min}
\in
\operatorname*{arg\,min}_{P\in\mathcal P_{\mathrm{can}}}
g(P),
$$

and use a lexicographic tie-break to obtain a unique tuple.

### Definition 5: First-Manifestation Scale

For a:

$$
g=1
$$

normalized rational shape:

$$
Q,
$$

define:

$$
\lambda_{\mathrm{prim}}(Q)
=
g(\operatorname{Prim}(Q)).
$$

---

## 74. The Conditional Theorems Obtained in This Paper

### Theorem A: Primitive Representative Uniqueness

Each rational Perfect Cuboid shape class has at most one canonical primitive integer representative.

### Theorem B: First Manifestation Existence under Nonemptiness

If:

$$
\mathcal P_{\mathrm{can}}\neq\varnothing,
$$

then, under:

$$
g
$$

-height, a minimal canonical primitive solution exists.

### Theorem C: Maximum-Coordinate Equivalence

For any Perfect Cuboid:

$$
\max(a,b,c,d,e,f,g)=g.
$$

Thus:

$$
H_{\max}=H_g.
$$

### Theorem D: Strict Edge Asymmetry

Any positive-integer Perfect Cuboid must have:

$$
a,b,c
$$

pairwise distinct.

Under the canonical ordering:

$$
a<b<c.
$$

### Theorem E: Existence / Minimality Separation

An exact primitive witness suffices to prove existence, but not to prove minimality.

---

## 75. The MVP of First-Manifestation Research

If the pipeline of Paper 5 produces an exact witness in the future:

$$
P_\ast,
$$

immediately carry out:

### Step 1

Canonicalize:

$$
a<b<c.
$$

### Step 2

Primitive reduction:

$$
\gcd(a,b,c)=1.
$$

### Step 3

Record:

$$
U_g=g(P_\ast).
$$

### Step 4

Compare with the existing certified:

$$
L_g
$$

lower bound.

### Step 5

If:

$$
L_g+1=U_g,
$$

minimality PASS.

Otherwise:

$$
\text{Existence PASS},
$$

$$
\text{Minimality OPEN}.
$$

These statuses must be clearly separated.

---

## 76. If Multiple Exact Solutions Are Found at Once

Canonicalize them all:

$$
P_1,\ldots,P_n.
$$

After removing duplicates,

compute:

$$
U_g
=
\min_i g(P_i).
$$

The other solutions should not be discarded.

This is because they immediately become the initial data for the arithmetic freedom studied in Paper 7.

In particular, we can study:

$$
P_i
\rightarrow P_j
$$

and whether there exist between them:

- rational maps;
- recurrences;
- shared parameters;
- shared prime signatures;
- shared radix patterns.

---

## 77. First Manifestation Should Not Become an Excessive Bias

If the generator seeks only to minimize:

$$
g
$$

this height,

it may miss many larger exact solutions that manifest more easily.

Thus, while existence remains unsettled,

the most reasonable strategy may be:

$$
\boxed{
\text{First seek any witness}
}
$$

rather than:

$$
\boxed{
\text{First seek the minimal witness}.
}
$$

Only once some witness exists

can it be used to establish:

$$
U_g.
$$

---

## 78. After Discovery, Push the Height Downward

This produces a very natural strategy:

### Phase E

First find:

$$
P_0.
$$

### Phase M1

Set:

$$
U_g=g(P_0).
$$

### Phase M2

Search:

$$
g<U_g.
$$

If we find:

$$
P_1,
$$

then:

$$
U_g\leftarrow g(P_1).
$$

Repeat:

$$
U_g^{(0)}
>
U_g^{(1)}
>
U_g^{(2)}
>\cdots.
$$

Since:

$$
U_g
$$

is a positive integer,

a strictly descending chain must be finite.

Thus, if a smaller solution can be found at each step until no further reduction is possible,

the remaining difficulty is only:

> How can we prove that the final ‘no further reduction is possible’ is true, rather than the searcher merely failing to find one?

This still requires certified lower exclusion.

---

## 79. The Difference Between Descent and Minimality

The:

$$
U_g\downarrow
$$

above is a search strategy,

not a mathematical infinite-descent proof.

A genuine infinite descent requires a theorem:

$$
P\mapsto P'
$$

such that every solution can produce:

$$
g(P')<g(P).
$$

If such a theorem exists,

it would directly imply that no solution exists.

However, this paper currently discusses only:

> Given certain known witnesses, try to find smaller witnesses.

The two must not be confused.

---

## 80. Conclusion

This paper completes the formal bridge from exact rational closure to first primitive manifestation.

Once a Perfect Cuboid exists,

scaling automatically gives infinitely many raw integer solutions:

$$
P,2P,3P,\ldots.
$$

The truly meaningful basic object is therefore:

$$
\boxed{
\text{canonical primitive shape}
}
$$

Its definition can be compressed to three edges:

$$
(a,b,c)\in\mathbb Z_{>0}^{3},
$$

satisfying:

$$
a<b<c,
$$

$$
\gcd(a,b,c)=1,
$$

and:

$$
a^2+b^2,
$$

$$
a^2+c^2,
$$

$$
b^2+c^2,
$$

$$
a^2+b^2+c^2
$$

all being integer squares.

The default height of this series is:

$$
\boxed{
H(P)=g.
}
$$

because:

$$
g
$$

must be the largest of the seven components.

If the canonical primitive solution space is nonempty,

the well-ordering of the positive integers guarantees that:

$$
\boxed{
g_{\min}
}
$$

must exist.

However:

$$
\boxed{
\text{Finding a solution}
\neq
\text{Proving that it is the minimal solution}.
}
$$

First-manifestation research must therefore be divided into:

$$
\boxed{
\text{Existence Certificate}
}
$$

and:

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

In the normalized:

$$
g=1
$$

world,

every rational Perfect Cuboid shape:

$$
Q
$$

has a unique primitive scaling:

$$
\lambda_{\mathrm{prim}}(Q),
$$

making:

$$
\lambda_{\mathrm{prim}}(Q)Q
$$

a canonical primitive integer realization.

Therefore:

$$
\boxed{
\text{first manifestation scale}
=
\text{primitive integer realization scale}.
}
$$

If a first exact witness appears in the future,

the Perfect Cuboid existence question is finished.

And the genuinely larger research then begins:

> Besides this shape, how many others are there?

> Do solution-preserving transformations exist?

> Are primitive shapes finite, countably sparse, curve families, or endowed with greater arithmetic freedom?

This is the second stage that the next paper:

# After the First Solution: Arithmetic Freedom of the Perfect Cuboid

will enter.

---

## Contents of the Series

1. **Reframing the Perfect Cuboid: It Is Not Primarily an Integer Search Problem**
2. **The Continuous World and the Scale Quotient Space: The Topological Starting Point of the Perfect Cuboid**
3. **Common Initial State and Constraint-Induced Differentiation**
4. **The Radix as an Observation Operator: Radix–Carry Global Closure**
5. **From Floating-Point Approximation to Exact Rational Closure**
6. **The First-Manifestation Problem: From Rational Closure to the Minimal Primitive Cuboid**
7. **After the First Solution: Arithmetic Freedom of the Perfect Cuboid**
8. **Upper and Lower Bounds of the Solution Space and a Second Expansion**

---

**End of Paper 06**