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

# BCODR-LUC-01 — Bidirectional Ball-Kernel Closure of the Root-6217 Parameter Space
## Bidirectional Kernel Closure of the Root-6217 Shape Space
### The First Arrival-Time Information Field from the Analytic Critical Ray and the $A_{\mathrm{ref}}$ Certificate Boundary

**Document ID:** `BCODR-LUC-01-v0.1`  
**Version:** v0.1  
**Date:** 2026-09-21  
**Author:** Neo.K  
**AI Collaborator:** Aletheia / ChatGPT, GPT-5.6 Sol  
**Institution:** EveMissLab / 一言諾科技有限公司  
**Target:** `ROOT6217_BARRIER_SHAPE`  
**Method:** `BCODR-v0.1`  
**Prerequisites:** LESR Paper 06–09B; BCODR-v0.1  
**Status:** First actual bidirectional parameter-space kernel field

---

# 0. Recenter

BCODR's first actual task is not to replace LESR calculus.

It first asks:

> In root-6217's remaining shape possibility space, which regions genuinely lie between the outward expansion of candidate structure and the inward contraction of certificate constraints?

Paper 08 previously had:

$$
200\to195
$$

barrier-shape responsibility boxes.

Paper 09B additionally provides an analytic primary critical ray.

This paper therefore places both sides in the same parameter-space metric for the first time.

---

# 1. Parameter Space

Cycle-11 root-6217 uses five parameters:

$$
\boxed{
z
=
(x_3,y_3,\rho_5,x_5,y_5).
}
$$

The union of all 200 parent boxes supplies the canonical normalization domain.

Let the domain in each dimension be:

$$
[\ell_j,u_j].
$$

Define:

$$
s_j=u_j-\ell_j,
$$

$$
m_j=\frac{\ell_j+u_j}{2}.
$$

Normalize:

$$
\boxed{
\widetilde z_j
=
\frac{z_j-m_j}{s_j}.
}
$$

---

# 2. Canonical Scale

This round obtains the following from actual Cycle-11 data:

$$
\ell
=
[-0.024243718609038, 0, 0, 0.012319849090351, -0.012319849090351],
$$

$$
u
=
[-0.012121859304519, 0.012121859304519, 0.026179938779915, 0.024639698180702, 0].
$$

Therefore:

$$
\boxed{
s
=
[0.012121859304519, 0.012121859304519, 0.026179938779915, 0.012319849090351, 0.012319849090351].
}
$$

In this normalized space:

$$
\widetilde{\mathcal Z}
\subset\mathbb R^5.
$$

The first kernel version uses Euclidean balls:

$$
\boxed{
B_M(p,r)
=
\{
z:
\|\widetilde z-\widetilde p\|_2\le r
\}.
}
$$

---

# 3. Why Start with This Metric?

This paper does not claim that this metric is the final natural metric of shape space.

It is simply the first BCODR kernel metric that is:

1. dimensionless;
2. coordinate-balanced;
3. replayable;
4. free of additional hyperparameters.

Future alternatives include:

- a Hessian metric;
- support-function distance;
- a certificate-sensitivity metric;
- an anisotropic learned metric.

---

# 4. Outward Seed Field

The inside-out field:

$$
\boxed{
\mathcal S_+
}
$$

uses Paper 09B's analytic primary critical ray.

Parameter:

$$
0\le\rho\le0.003.
$$

Its velocity:

$$
\boxed{
u_\star
=
5.15712624526836,
}
$$

$$
\boxed{
v_\star
=
-0.189228189906641,
}
$$

$$
\boxed{
w_\star=0.
}
$$

The ray:

$$
q=\rho u_\star,
$$

$$
\alpha_3=\pi-q,
$$

$$
x_3=x_3^0+s\cos\alpha_3,
$$

$$
y_3=s\sin\alpha_3,
$$

$$
x_5=x_5^\star,
$$

$$
y_5=\rho v_\star.
$$

---

# 5. Outward Meaning

$\mathcal S_+$ is not a shape proved to be optimal.

It represents:

$$
\boxed{
\text{the main direction in which the current analytic candidate mechanism continues from }\rho=0\text{ toward positive rotation.}
}
$$

Proof status:

```text
ANALYTIC PRIMARY BRANCH
FULL LOCAL QUADRATIC CERTIFICATE OPEN
```

---

# 6. Inward Seed Field

The outside-in field:

$$
\boxed{
\mathcal S_-
}
$$

uses the five:

$$
A_{\mathrm{ref}}
$$

shape-prune boxes that can currently genuinely be retained across targets:

$$
\boxed{
28,\ 36,\ 68,\ 144,\ 155.
}
$$

They already have target-compatible certificates for:

$$
A>A_{\mathrm{ref}}=0.8349865
$$

These regions are therefore:

$$
\boxed{
\text{certified inward exclusion seeds}.
}
$$

---

# 7. Do Not Prescribe the Radius First

Directly prescribing radii such as:

$$
r_+=r_-=0.1
$$

would introduce arbitrary BCODR hyperparameters.

This paper instead uses:

$$
\boxed{
\textbf{arrival time}.
}
$$

Imagine all kernels growing synchronously at unit normalized radius speed.

---

# 8. Outward Arrival Time

For a shape-active root box:

$$
B,
$$

define:

$$
\boxed{
T_+(B)
=
d_M
(
B,
\mathcal S_+
).
}
$$

That is:

> The radius required for the analytic critical-ray kernel to first touch box $B$.

---

# 9. Inward Arrival Time

Define:

$$
\boxed{
T_-(B)
=
d_M
(
B,
\mathcal S_-
).
}
$$

Here:

$$
\mathcal S_-
=
B_{28}
\cup
B_{36}
\cup
B_{68}
\cup
B_{144}
\cup
B_{155}.
$$

It represents:

> The radius required for the certified exclusion field to first touch $B$.

---

# 10. Meeting Radius

The synchronized radius needed for both sides to reach a cell is:

$$
\boxed{
T_\cap(B)
=
\max
\{
T_+(B),
T_-(B)
\}.
}
$$

A smaller value means earlier entry into the bidirectional interaction frontier.

---

# 11. Direction Balance

Define:

$$
\boxed{
\beta(B)
=
\frac{
T_-(B)-T_+(B)
}{
T_-(B)+T_+(B)
}.
}
$$

Then:

$$
\beta\approx1
$$

means greater proximity to the outward candidate field.

$$
\beta\approx-1
$$

means greater proximity to the inward certificate field.

$$
\beta\approx0
$$

means:

$$
\boxed{
\text{balanced bidirectional arrival distances}.
}
$$

---

# 12. Balance Information

Let:

$$
p_+(B)
=
\frac{
T_-(B)
}{
T_+(B)+T_-(B)
}.
$$

Define normalized binary entropy:

$$
\boxed{
H_B
=
\frac{
-p_+\log p_+
-(1-p_+)\log(1-p_+)
}{
\log2
}.
}
$$

Therefore:

$$
0\le H_B\le1.
$$

---

# 13. Information Interpretation

If:

$$
H_B\approx0,
$$

the cell is almost entirely close to a one-sided information field.

If:

$$
H_B\approx1,
$$

then:

$$
T_+\approx T_-.
$$

In other words:

$$
\boxed{
\text{candidate expansion and certified contraction are most nearly balanced in their geometric responsibility for this cell.}
}
$$

This is the first version of BCODR overlap information.

---

# 14. Contact Is Not Overlap

This round conducts a 5D intersection-measure audit of 195 active boxes and five certified-prune boxes.

Result:

$$
\boxed{
\text{positive-measure active/prune overlaps}=0.
}
$$

That is:

> No active root box overlaps a certified-prune box with positive five-dimensional measure.

---

# 15. Many Boundary Contacts Nevertheless Exist

A total of:

$$
\boxed{
35
}
$$

active/prune box pairs have normalized set distance:

$$
d=0
$$

but intersection 5D measure:

$$
\mu_5=0.
$$

They are therefore only:

$$
\boxed{
\text{boundary contacts}.
}
$$

This precisely verifies BCODR's original requirement for a:

$$
\boxed{
\text{minimum overlap measure gate}.
}
$$

---

# 16. Effective Overlap Rule

This paper formally distinguishes:

## Contact

$$
d(A,B)=0,
$$

but:

$$
\mu(A\cap B)=0.
$$

## Effective Overlap

$$
\boxed{
\mu(A\cap B)\ge\varepsilon_\cap>0.
}
$$

Boundary tangency therefore does not automatically become an overlap-information region.

---

# 17. Root 131: The First Zero-Radius Contact Nexus

The computation gives:

$$
\boxed{
T_+(131)=0
}
$$

and:

$$
\boxed{
T_-(131)=0.
}
$$

It simultaneously:

1. touches Paper 09B's critical ray;
2. touches certified-prune root `155`.

It is therefore labelled:

$$
\boxed{
\texttt{ZERO\_RADIUS\_CONTACT\_NEXUS}.
}
$$

---

# 18. This Does Not Prune Root 131

Both contacts currently have zero geometric thickness.

We do not have:

$$
\mu_5(B_{131}\cap B_{155})>0.
$$

Hence:

$$
\boxed{
T_+=T_-=0
\not\Rightarrow
\text{shape prune}.
}
$$

It means:

> This is the first topological contact of the two BCODR fields.

---

# 19. Consistency with the Cycle-17 Observation

In Cycle 17,

`131`

is precisely the only cell where a numerical candidate with:

$$
A<0.8349865
$$

was found.

It therefore simultaneously has:

- analytic critical-ray contact;
- certified-prune boundary adjacency;
- the historically lowest candidate.

This is not a new proof, but makes `131` an exceptionally high-information provenance node.

---

# 20. Finite-Radius Information Frontier

Excluding the contact nexus with:

$$
T_+=T_-=0
$$

the first actual finite-radius high-balance-entropy cells include:

$$
\boxed{
166, 167, 164, 165, 127, 101, 104, 103.
}
$$

These cells have:

$$
T_+>0,
\qquad
T_->0,
$$

and:

$$
H_B
$$

close to $1$.

---

# 21. Why These Cells Matter

They do not merely mean:

> The area looks low.

They indicate that the:

$$
\boxed{
\text{analytic candidate field}
}
$$

and:

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

need similar radii to reach them in normalized parameter space.

They are therefore natural candidates for:

```text
BCODR_CONFLICT_FRONTIER
```

---

# 22. Arrival-Time BCODR Does Not Depend on a Fixed Kernel Radius

For any:

$$
t\ge0,
$$

define:

$$
\mathcal C_+(t)
=
\{
B:
T_+(B)\le t
\},
$$

$$
\mathcal C_-(t)
=
\{
B:
T_-(B)\le t
\}.
$$

These are discrete representations of synchronized radial expansion.

---

# 23. Overlap at Scale $t$

Define:

$$
\boxed{
\mathcal O(t)
=
\mathcal C_+(t)
\cap
\mathcal C_-(t).
}
$$

The entire BCODR overlap evolution can consequently be scanned over:

$$
t
$$

without rebuilding models at different fixed radii.

---

# 24. First Contact vs Finite Overlap

If:

$$
T_+=T_-=0,
$$

this means only that the seed geometries already touch at their boundaries.

If:

$$
T_\cap>0,
$$

a genuinely finite-radius expansion is needed to bring that responsibility cell into the bidirectional field.

These two node classes must therefore be drawn separately.

---

# 25. Root Boxes as First-Layer Atomic Cells

The audit of Cycle-11's 200 root-6217 terminal boxes finds:

- their interiors do not overlap each other with positive measure;
- they may share boundaries.

In the first BCODR version they can therefore be regarded as:

$$
\boxed{
\text{measure-atomic parameter cells}.
}
$$

If a later kernel boundary crosses a box, split that box into children.

---

# 26. Cut Trigger

For a root box:

$$
B,
$$

if a kernel boundary:

$$
\partial C_\pm(t)
$$

crosses $B$ and the resulting subregions differ in:

$$
\mu_5
$$

by more than:

$$
\varepsilon_\mu,
$$

trigger:

```text
BCODR_CUT
```

There is no need to pre-subdivide all 195 boxes.

---

# 27. Minimum Measure Difference

After splitting, retain child regions:

$$
A,B
$$

as distinct responsibilities only if:

$$
\boxed{
\mu(A\triangle B)
\ge
\varepsilon_\mu
}
$$

or their information signatures genuinely differ.

Otherwise merge them.

---

# 28. Recomposition Gate

Two adjacent cells may enter:

```text
BCODR_MERGE_CANDIDATE
```

if:

1. their $T_+$ intervals are compatible;
2. their $T_-$ intervals are compatible;
3. their balance entropies are close;
4. their contact-topology roles coincide;
5. their certificate provenance coincides.

---

# 29. Cases That Must Not Be Merged

In particular, do not directly merge a:

```text
ZERO_RADIUS_CONTACT_NEXUS
```

with an ordinary:

```text
INWARD_CERT_BOUNDARY_CONTACT
```

The former carries both:

- outward analytic lineage;
- inward certificate lineage.

Their provenance differs.

---

# 30. First Information Vector

For every cell:

$$
B_i
$$

retain:

$$
\boxed{
\mathcal I_i
=
(
T_+,
T_-,
T_\cap,
\beta,
H_B
).
}
$$

Do not immediately compress it to a scalar score.

This prevents artificial weights from interfering prematurely with the structure.

---

# 31. Priority Score Is Only for Scheduling

The implementation uses a non-theorem scheduler:

$$
P_i
=
\frac{
H_B
}{
1+T_\cap/\operatorname{median}(T_\cap)
}.
$$

Its purpose is:

> To decide which cell to compute first.

It is not a mathematical invariant.

---

# 32. Color Encoding

For future visualization:

## Hue

Use:

$$
\beta
$$

to represent inward/outward dominance.

## Saturation

Use:

$$
H_B
$$

to represent interaction information.

## Brightness

Use proof/replay strength.

This paper first retains the numerical values; color itself is not evidence.

---

# 33. New Relationship with Paper 09C

The original plan:

$$
\text{Paper 09B}
\rightarrow
\Phi_2
$$

now becomes:

$$
\boxed{
\text{Paper 09B}
\rightarrow
\text{BCODR compression}
\rightarrow
\Phi_2
\text{ only on surviving local responsibility}.
}
$$

---

# 34. $\Phi_2$ Is Not Cancelled

Calculus remains a necessary closure operator.

It now handles only:

$$
\boxed{
\text{high-information cells that BCODR cannot directly eliminate through certificates, topology or recomposition}.
}
$$

This can greatly reduce local second-order computation.

---

# 35. Relationship with Paper 08's Local/Tail Split

Paper 08:

$$
195
=
10_{\rm local}
+
44_{\rm split}
+
141_{\rm tail}.
$$

This is only a one-dimensional classification along the:

$$
\rho
$$

axis.

BCODR adds:

$$
\boxed{
\text{five-dimensional bidirectional information classification}.
}
$$

The same `TAIL_ONLY` cell can therefore still be a high-balance-information node.

The same `SPLIT` cell may also be strongly biased inward or outward.

---

# 36. First BCODR Closure Graph

Node types in the first graph:

```text
OUTWARD_ANALYTIC_SEED
INWARD_CERTIFIED_SEED
ZERO_RADIUS_CONTACT_NEXUS
FINITE_RADIUS_CONFLICT_CELL
ONE_SIDED_CONTACT_CELL
```

Edge types:

```text
T_PLUS_ARRIVAL
T_MINUS_ARRIVAL
BOUNDARY_CONTACT
FUTURE_EFFECTIVE_OVERLAP
```

---

# 37. Graph-Theoretic Role of the Contact Nexus

`131` is now neither:

> a winner

nor:

> a prune.

It is:

$$
\boxed{
\text{first common contact node of the two provenance fields}.
}
$$

If a later child split shows pruning on one side and survival along the critical ray on the other, it naturally becomes a:

$$
\boxed{
\text{structural bridge node}.
}
$$

---

# 38. What This Paper Does Not Do

BCODR-LUC-01 does not claim that:

1. root 131 contains the exact barrier minimizer;
2. arrival-time entropy is the uniquely natural definition of mathematical information;
3. normalized Euclidean distance is the final metric;
4. the first frontier cells are necessarily the hardest to prove;
5. BCODR has proved positive-rotation closure.

---

# 39. What This Paper Actually Completes

For the first time it establishes a common parameter-space field between:

$$
\boxed{
\text{analytic candidate geometry}
}
$$

and:

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

Every active responsibility cell receives:

$$
T_+,
T_-,
T_\cap,
\beta,
H_B.
$$

---

# 40. Next Step: BCODR-LUC-02

The next round should not return immediately to $\Phi_2$.

First undertake:

$$
\boxed{
\textbf{BCODR-LUC-02 — Atomic Cut and Structural Recomposition}
}
$$

Goals:

1. cut selected high-information roots at kernel-event radii;
2. construct child membership signatures;
3. merge cells sharing only certificate/topology;
4. extract the first surviving responsibility spine;
5. then decide which spine segment genuinely needs Paper 09C.

---

# 41. Local Parallel Tasks Are Unchanged

Local work continues on:

- counter-certificate search;
- the $A_{\rm ref}$ tail certificate;
- interval audit;
- topology replay.

The new BCODR ledger can directly serve as a scheduler, prioritizing cells with high:

$$
H_B
$$

and low:

$$
T_\cap
$$

---

# 42. Canonical Result

After connecting BCODR to root-6217, the first genuinely new geometric state is not:

$$
\text{another Hessian}.
$$

It is:

$$
\boxed{
\text{two provenance fields meeting in normalized 5D parameter space}.
}
$$

Candidate structure grows outward.

Certificate boundaries grow inward.

Where they meet is no longer guessed by eye; it is recorded directly by:

$$
\boxed{
(T_+,T_-,H_B)
}
$$

---

# 43. Conclusion

BCODR-LUC-01 connects:

$$
\text{inside-out}
$$

and:

$$
\text{outside-in}
$$

to actual Lebesgue root-6217 data for the first time.

The first version finds:

1. the 195 shape-active roots can be first-layer measure-atomic cells;
2. active and certified-prune boxes have no positive-five-dimensional-measure overlap;
3. many boundary contacts nevertheless exist;
4. root 131 is the first zero-radius bidirectional contact nexus;
5. finite-radius balanced-information cells can now be identified automatically from the arrival-time field;
6. calculus can consequently be deferred to BCODR's surviving responsibility spine.

The new main line is therefore:

$$
\boxed{
\text{Analytic Seed}
\rightarrow
\text{Bidirectional Kernel Field}
\rightarrow
\text{Atomic Cut}
\rightarrow
\text{Information Separation}
\rightarrow
\text{Structural Recomposition}
\rightarrow
\text{Local Calculus}.
}
$$

---

# Canonical Source Declaration

This file is the UTF-8 Markdown canonical source of `BCODR-LUC-01-v0.1`.

The only mathematical delimiters used are `$...$` and `$$...$$`.

This paper treats the arrival-time field as BCODR's first operational realization in root-6217 parameter space; it does not claim a final unique metric or a convergence theorem.

===END===