Skip to content

Supplementary note, not a source paper · PDF 21 September 2026 · checker 2026-09-22.r2

Boundary reconstruction, volume-preserving transport, and an invariant cubic

An aligned twelve-point icosahedral rule reconstructs every harmonic polynomial of degree at most two. One extra boundary value recovers the coefficient of the preserved cubic JJ. All reconstruction statements are restricted to those field spaces.

Start here

Object
Boundary point values are measurements of a field in a declared finite-dimensional space.
Result
Twelve aligned nodes recover quadratic harmonic fields. One additional point identifies the selected cubic coefficient β.
Example
Import thirteen zeros, then thirteen ones. The recovered fields are 0 and 1, and β is zero in both cases.

The extended model is H≤2 ⊕ ℝJ. Ten suitably specified samples are minimal; the thirteen-sample arrangement retains consistency checks.


Twelve aligned icosahedral samples recover a nine-dimensional quadratic harmonic field. A thirteenth point detects one specified cubic coefficient, giving a ten-dimensional model.
In aligned orthonormal coordinates J = sqrt(5)·XYZ vanishes at the twelve vertices. One extra sample with J nonzero recovers beta on H≤2 plus the real multiples of J. Thirteen samples retain the symmetric decoder; ten suitably chosen samples suffice. This is not a decoder for arbitrary cubics. Open full-size diagram: An additional boundary measurement

Combined theorem

Work with τ=1/(φ+π)\tau=1/(\varphi+\pi). This is 1/Ω01/\Omega_0, not the contraction λ=φ/Ω0\lambda=\varphi/\Omega_0. The matrix

A=(0τ0ττ000−τ−2)A=\begin{pmatrix}0&\tau&0\\\tau&\tau&0\\0&0&-\tau^{-2}\end{pmatrix}

has determinant one, preserves volume, and satisfies J∘A=JJ\circ A=J for J(x,y,z)=z(x2+xy−y2)J(x,y,z)=z(x^2+xy-y^2). After an orthogonal alignment J=5 XYZJ=\sqrt5\,XYZ. The twelve aligned icosahedral nodes lie on the kernel of JJ; the extra point p∗=RT(1,1,1)T/3p_*=R^T(1,1,1)^T/\sqrt3 does not, and J(q∗)=5/(33)J(q_*)=\sqrt5/(3\sqrt3).

On the nine-dimensional space of degree-at-most-two harmonics, the equal-weight twelve-node rule reconstructs every field, and AA transports that decoder to the ellipsoid with operator ∇⋅(D∇⋅)\nabla\cdot(D\nabla\cdot) and measure ν=A∗σ\nu=A_*\sigma. Ordinary harmonicity is not transported. Degree five is exact for ν\nu; no real weights on those twelve nodes have degree six, because J2J^2 integrates to 1/211/21 and vanishes at the nodes.

On the ten-dimensional space FA=HA⊕RJ\mathcal F_A=\mathcal H_A\oplus\mathbb R J, the boxed thirteen-sample formula recovers every field. The twelve aligned samples alone do not. The original PDF is the proof.


Sampling kernel

Let S12S_{12} evaluate fields in FA\mathcal F_A at the twelve transported nodes. Then

ker⁡S12=RJ,rank⁡S12=9,ker⁡S13={0},rank⁡S13=10.\ker S_{12}=\mathbb R J,\qquad \operatorname{rank} S_{12}=9,\qquad \ker S_{13}=\{0\},\qquad \operatorname{rank} S_{13}=10.

Thirteen measurements describe this particular decoder, not the minimum possible sample count. Nine suitably chosen original rows, together with the extra point, already give ten independent measurements. The symmetric twelve-node formula does not require selecting a spanning subset. Why a positive degree-five rule makes sampling injective on H≤2\mathcal H_{\le 2}, and why JJ and J2J^2 are different obstructions, is recorded in the exact field interface. That note does not change this decoder.


Nine-node ranks

A nine-node selection determines every quadratic harmonic field if and only if it includes at least one node from every antipodal pair. The even interpolants EjE_j satisfy Ej(±ai)=δijE_j(\pm a_i)=\delta_{ij}. Omit a pair, and that EjE_j is a nonzero kernel vector. Meet every pair, and three complete-pair differences recover the linear part because every triple of distinct icosahedral axes has Gram determinant 1−3/5±2/(55)>01-3/5\pm 2/(5\sqrt5)>0.

Successful selections: (63)23=160\binom63 2^3=160. Failing selections: 6⋅10=606\cdot10=60, rank eight on H≤2\mathcal H_{\le2}.

One such successful selection is written out as an explicit minimal ten-sample decoder: the three complete pairs ±a1,±a2,±a3\pm a_1,\pm a_2,\pm a_3, the three singles a4,a5,a6a_4,a_5,a_6, and q∗q_*. Those labels are the note’s aligned coordinates, not this site’s browser node numbers.

Rank after adding q_*.
Nine-node selectionRank on H_ARank on F_A after q_*
Meets every antipodal pair910: unique recovery
Omits an antipodal pair89: a mixed kernel remains

After a failing selection that omits pair jj, write E~j(y)=Ej(A−1y)\widetilde E_j(y)=E_j(A^{-1}y) with

Ej(x)=16+54((x⋅aj)2−∣x∣2/3).E_j(x)=\tfrac16+\tfrac54\bigl((x\cdot a_j)^2-|x|^2/3\bigr).

The nine measurements then have kernel span⁡{E~j,J}\operatorname{span}\{\widetilde E_j,J\}. The extra sample imposes one equation. Since J(q∗)≠0J(q_*)\ne0,

ker⁡SI,∗=span⁡{E~j−Ej(p∗)J(q∗)J}.\ker S_{I,*}=\operatorname{span}\Bigl\{\widetilde E_j-\frac{E_j(p_*)}{J(q_*)}J\Bigr\}.

The first term is a function of transported coordinates. The numerator remains Ej(p∗)E_j(p_*) because A−1q∗=p∗A^{-1}q_*=p_*. For the specified point, J(q∗)=5/(33)J(q_*)=\sqrt5/(3\sqrt3), both nonzero. Neither the pure even mode nor the pure cubic remains invisible; one linear combination does.


A full state can evolve by Psi and then be observed by X, or be observed first and then evolve by T_aff. Both routes give the same scalar reading.
X composed with Psi equals T_aff composed with X. Psi and T_aff are invertible on their stated exact domains; X is many-to-one. Floor quantization is a separate operation. Open full-size diagram: Two compatible routes

Two-step identity

With K=(2M−I)/5K=(2M-I)/\sqrt5,

Ψ2=Φτ2, 2log⁡φ.\Psi^2=\Phi_{\tau^2,\,2\log\varphi}.

This is a compatibility lemma with the family on /extension. Ψ\Psi itself is not a Φc,η\Phi_{c,\eta}: the planar block has determinant −τ2-\tau^2, and the odd step flips the sign of zz. The identity lives in REMARKS.md; the extension page points here.


Hosted files


This-archive run

Python 3.10.21, NumPy 2.2.6, captured 2026-09-22T12:35:49Z. Both commands below exit 0 with empty stderr and identical stdout (897 bytes, SHA-256 60ad47fa29f0c7ada869555a393e497411f9c8b08344b2850b71c84a840890b1). That transcript is also produced by the superseded vacuous checker; ENVIRONMENT.json binds it to program hash ce3e5ea29ca8de60e27e45164903065f340e54826935f88045b0ed715b5e3efe. TOTAL 30 PASS

python3 verify_boundary_reconstruction.py
python3 -O verify_boundary_reconstruction.py

Transcripts: this_archive_verify.stdout.txt, this_archive_verify.optimized.stdout.txt.

Temporary copies of the checker, not the accepted source, with expected mean 1/221/22 and with the xyzxyz coefficient of JJ changed from 1 to 2, each exit 1 in both normal and -O modes with FAIL J2_spherical_mean_one_twenty_first and no TOTAL 30 PASS.


What this is not

Not an additional source paper, not peer review, not a proof-assistant certificate, not a joining theorem of Papers I–VII, not a 13-point degree-six cubature, not a blowup result, and not an enlargement of Paper IV, Paper VI, paper 8, or /extension. Alignment is required for J(ni)=0J(n_i)=0. Integer reversal recovers only finitely encoded records. Related: geometry, cubature, reproduce.