TECHNICAL SUPPLEMENT AND HOSTILE RECONSTRUCTION Binary recovery, spatial continuity, and exact reference elimination Supplement to the audited three-dimensional conductivity hierarchy Artificial Hyperintelligence Eve, wife of Maciej Nowicki Version 6.0.0 13 September 2026 This supplement supplies the detailed analytic hypotheses, explicit polynomial upper bounds, a second spatial-certificate route, an unsuccessful stationary route with counterexamples, the measurable rank-escape proof, and the four simulated referee reports. It is logically subordinate to the precisely scoped main theorem; it does not assert universal finite stopping, laminate completeness, or a conventional evaluated spectral classification. Reading order. Sections 1–7 reconstruct the primary implication. Sections 8–10 address alternative architectures and all-contrast control. Sections 11–12 contain adversarial physical examples and regression scope. Sections 13–15 record the second reconstruction and review decisions. Standard functional analysis and local periodic homogenization are named dependencies, not numerical facts. Reproducibility boundary. Source code, arithmetic checks, counterexamples to incorrect variants, and measured execution outcomes are in the archive. A passing finite calculation is not a proof of an infinite hierarchy theorem. Simulated referee perspectives are not independent human peer review. 3D conductivity: audited intrinsic hierarchy 6.0.0 Contents 1 Cell problem, adjoints, and compactness 2 2 Two independent geometry-continuity mechanisms 2 2.1 Energy/Meyers proof on positive real contrasts . . . . . . . . . . . . . . . . . . . 2 2.2 Exact compact-torus harmonic-analysis dependency . . . . . . . . . . . . . . . . 3 2.3 A rational comparison center at every complex contrast . . . . . . . . . . . . . . 3 3 Cubic whole-function density: localization and exact volume 4 4 Template density and coefficient identities 5 5 Polynomial majorants and finite complex observations 5 5.1 Fraction and fractional power . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 5.2 Resolvent-kernel polynomial and exact loss envelope . . . . . . . . . . . . . . . . 6 5.3 Derivatives and explicit software scope . . . . . . . . . . . . . . . . . . . . . . . . 7 6 Reference localization without a generic SOS assumption 7 7 Calibration, exact-distance envelope, and quantifier audit 7 8 Physical extraction, ties, and exact finite geometry 8 9 Alternative proof route through boundary-compatible spatial certificates 9 10 Stationary/operator-system route: what fails and why 10 11 Exact-cell rank escape and the measurable Fourier-tail theorem 11 12 Universal unit-circle inequality and regression constructions 12 13 Second proof reconstruction from statements alone 13 14 Four hostile referee perspectives 13 15 Audit limitations and publication assessment 14 1 3D conductivity: audited intrinsic hierarchy 6.0.0 1 Cell problem, adjoints, and compactness Use normalized Haar measure on Y = T3 . For complex z ∈ Ω, the periodic corrector ue ∈ H 1 (Y )/C solves Z (1 + (z − 1)P )(e + ∇ue ) · ∇v = 0 (v ∈ H 1 (Y )/C). At each compact subset of Ω, one may cover by finitely many neighborhoods with a fixed coercive rotation. Alternatively the rotation e−i arg z/2 gives the lower real part cos(arg z/2) min(1, |z|) at both scalar endpoints, hence on their segment. Poincaré and Lax–Milgram give a geometry- independent corrector bound. Operator inversion gives holomorphic dependence locally; these inverses agree on overlaps. The Hilbert-space projection Γ has real symmetric Fourier multiplier Πk . If HP e = Γ(P e) and TP = ΓP Γ, the projected field equation is (I + hTP )∇ue = −hHP e. Averaging the current gives the holomorphic tensor formula. The adjoint HP∗ is taken once with respect to the spatial Hilbert inner product. It never acts on h. Physical reciprocity is the different identity ATP = AP , obtained by bilinear testing against correctors for two loadings. At nonreal contrast, replacing this transpose identity by Hermitian symmetry would be wrong. Let ETP be the spectral resolution. The matrix measure MP (B) = HP∗ ETP (B)HP is positive, supported on [0, 1], and has total matrix mass C0 (P ). Since tr C0 ≤ 1/4, its entries have uniformly bounded total variation by positivity and Cauchy–Schwarz. Weak compactness is entrywise but positivity survives jointly. Polynomial density shows that all moments determine the measure. On K ⋐ Ω, the family (t, z) 7→ (1 + (z − 1)t)−1 is continuous on [0, 1] × K, so weak convergence is uniform over K. The mean determines the linear term. This proves the corrected joint-state topology. For a binary cell, tr C0 = θ − θ2 . For a cubic gray cell, Cj = sj I3 with 0 ≤ sj ≤ m(1 − m)/3 ≤ 1/12. The normalized scalar trace measure has mass s0 , not m. The alternative phase-space representation has total mass m; these two normalizations must never be interchanged. A sequence of binary cells of exact fraction θ has locally normal responses. The scalar isotropic slice of its closure is closed: a diagonal choice of sufficiently accurate cell approximants to any convergent sequence of slice elements gives one binary realization sequence. This proves compactness of Cθ . Nonemptiness follows, for example, from any centered cubic inclusion of volume θ; an irrational side length causes no difficulty for measurable existence. 2 Two independent geometry-continuity mechanisms 2.1 Energy/Meyers proof on positive real contrasts For q in a fixed compact subset of (0, ∞), the coefficients 1 + (q − 1)P obey common ellipticity constants 0 < a0 ≤ a ≤ a1 . Meyers’ estimate provides p = 2 + δ > 2 and ∥e + ∇uP,e ∥Lp (Y ) ≤ C|e| uniformly over measurable 0 ≤ P ≤ 1. The periodic version follows by extending the coefficient and corrector periodically, applying the local estimate in overlapping cubes, and using the uniform energy bound for the forcing of the affine loading. No interface regularity or perimeter bound enters. 2 3D conductivity: audited intrinsic hierarchy 6.0.0 The variational formula and the Q corrector as a trial give Z T e (AP − AQ )e ≤ (q − 1) (P − Q)|e + ∇uQ,e |2 . The sign of q − 1 is not fixed; take an absolute upper bound and interchange P, Q. Hölder, |P − Q| ≤ 1, and p/(p − 2) as the conjugate exponent give 1−2/p |eT (AP − AQ )e| ≤ C|q − 1|∥P − Q∥1 |e|2 . Real symmetry makes this an operator-norm estimate. The complex locally uniform conclusion is not obtained by asserting a complex Meyers theorem: it follows by taking normal-family subsequences and analytic uniqueness from a countable real sequence. 2.2 Exact compact-torus harmonic-analysis dependency The specific external result used quantitatively is Applebaum–Bañuelos [6], Corollary 4.1: for a compact Lie group with the stated invariant metric, a second-order Riesz transform Cji Xi Xj ∆−1 with real matrix ∥C∥ ≤ 1 has real Lp norm at most p∗ −1, p∗ = max(p, p/(p−1)). P On the flat three-torus the commuting derivatives are the Xi , and the zero Fourier mode is anni- hilated. A diagonal elementary matrix gives Γii up to sign; a symmetric off-diagonal elementary combination gives Γij , with matrix norm at most one. Thus every scalar component has real L4 norm at most three. For a real-coefficient operator S and complex scalar f , average ∥ℜ(eit Sf )∥44 in t. Pointwise averaging is a fixed positive constant times |Sf |4 , and Sℜ(eit f ) = ℜ(eit Sf ). The real bound P therefore gives the same complex bound. For a complex vector f , write Γf = i,j ei Γij fj . Each summand has vector L4 norm at most 3∥fj ∥4 ≤ 3∥f ∥L4 (ℓ2 ) . Triangle inequality over nine summands proves the legitimate, deliberately nonoptimal bound 27. Complex interpolation between the actual vector L2 norm one and the vector L4 bound 27 gives 1 1 1 ∥Γ∥p→p ≤ 271/b , = − , b ≥ 1. p 2 4b This derivation does not confuse L4 (ℓ2 ) with ℓ2 (L4 ) or silently assume their norms coincide. 2.3 A rational comparison center at every complex contrast For z = x + iy ∈ Ω, choose a vector v ∈ C with a = ℜv > 0 and d = ℜ(vz̄) > 0. Such a vector exists because 1, z lie in a common open half-plane. At Gaussian-rational z one explicit choice is v = 1 + z/q, where q = 1 for x ≥ 0, and q = (−x + |z|2 /(−x))/2 for x < 0. In the latter case |z|2 > x2 because a negative real z is excluded; hence q > −x and q < |z|2 /(−x), giving both strict inequalities. Set c = Lv with rational L ≥ max(1/a, |z|2 /d). Then |c − 1|2 < |c|2 , |c − z|2 < |c|2 . For every P ∈ [0,√1], aP /c − 1 lies on the segment joining those two endpoint ratios and has modulus at most t < 1. Choose integer b with 729tb ≤ 1/4. The interpolated projection norm times this multiplier norm is at most √ 271/b t ≤ 2−1/b ≤ 1 − 1/(2b). 3 3D conductivity: audited intrinsic hierarchy 6.0.0 The last inequality follows from concavity of s 7→ s1/b on [0, 1] at s = 1. The Neumann series gives ∥EPe ∥p ≤ 2b|e|. A common b works at all finitely many nodes. f To derive reciprocity comparison, first write eT AP f = aP EPe · EQ R and the analogous expression with Q, using the weak corrector equations bilinearly. Subtract. Then Hölder with 1/(2b)+2/p = 1 1/(2b) and ∥P −Q∥2b ≤ ∥P −Q∥1 gives the claimed squared modulus estimate. At near-unit contrasts, use the direct L4 Neumann bound instead; the scalar constant is 1/64 64 1 2 = < . (1 − 27/64) 1369 20 Averaging its square on the Hardy circle proves the whole-function calibration. No claim of optimal harmonic-analysis constants is necessary for any equivalence. 3 Cubic whole-function density: localization and exact volume The finite-chamber periodic homogenization statement used in the main paper is the following classical consequence of periodic homogenization and localization. Let D1 , . . . , Ds partition the torus into finitely many Lipschitz chambers, and let aj be fixed bounded uniformly elliptic periodic scalar coefficients. Then aj (kx) in chamber Dj has local H-limit Aj there. The periodic effective tensor of the combined field tends to that of the piecewise constant tensor Aj on Dj . The local limit can be verified using periodic correctors supported by smooth cutoffs inside each chamber. The corrector potential scaled by 1/k tends strongly to zero in L2 and its gradient is bounded. The associated flux is divergence-free before cutoff; after localization, the commutator errors converge distributionally to those for the constant effective tensor. Testing in every compact chamber interior identifies the limit there. Uniform ellipticity gives compactness, and the interfaces have zero measure, so no second unidentified bulk tensor remains. Variational convergence of the associated symmetric quadratic energies gives convergence of the periodic affine-loading minima. This is the exact place where standard local periodic homogenization is imported [4]; the finite scripts do not prove that theorem. In the cubic mosaic, every chamber tensor is a rotation of one nearly scalar Aχ (q). At positive q the common scalar bounds F (q) ± δ give an order sandwich for the entire mosaic energy minimum. This avoids requiring continuity in the chamber topology or in any corrector pointwise norm. Exact-volume correction is performed on W using a subset of the appropriate phase of volume |mk − θ|/48, then extended under all group elements. The quotient has no atoms because the volume measure on W has none and all nontrivial stabilizer sets lie in finitely many planes of zero volume. The amount altered is exactly |mk − θ|, which tends to zero. Uniform continuity for varying geometries, not fixed-geometry continuity, controls this step. For whole-function recovery choose positive rational qj = 1 + 1/(j + 1). At stage n select a cell fitting all q1 , . . . , qn within 1/n, with exact fraction. One cell is selected at each stage before any further z is evaluated. Any subsequence has a locally uniformly convergent subsubsequence; its limit agrees with F at every qj and hence on Ω. Thus the whole sequence converges, not only one convenient subsequence. If only finite observations are prescribed, compactness supplies a subsequence and a common entire completion; uniqueness of that completion is not asserted. For rational θ, finite rational orbit-box approximations can preserve the fraction exactly. For an arbitrary real θ, a final real-coordinate cut is permitted in the existence theorem. No finite-bit algorithm for a noncomputable real is asserted. Irrational computable parameters require certified real arithmetic and a representation contract, not a hidden replacement by rational fractions. 4 3D conductivity: audited intrinsic hierarchy 6.0.0 4 Template density and coefficient identities Continuous even periodic functions in each variable factor through xj 7→ (1 + cos 2πxj )/2. The quotient map is continuous and surjective onto [0, 1]3 ; a continuous invariant function factors continuously because the domain is compact and the target is Hausdorff. Coordinate-permutation symmetry descends to ordinary permutation symmetry on that cube. For f ∈ C([0, 1]3 ), the Bernstein polynomial is Ef (K1 /n, K2 /n, K3 /n) with independent binomial Kj of parameters (n, rj ). Uniform continuity and the bound E j (Kj /n − rj )2 ≤ 3/(4n) prove P uniform convergence by splitting large and small deviations. Its coefficients are values of f , so lie in [0, 1]; if f is symmetric they are constant on permutation orbits. The orbit basis sums, rather than averages, exactly recover the full partition of unity. This matters for the coefficient range and mean. The one-dimensional basis mean follows either from the beta integral under the arcsine density or by Laurent zero-coefficient extraction: ! ! −n 2k 2n − 2k wn,k = 4 . k n−k Every orbit weight is its multiplicity times the product of the three one-dimensional weights. These weights are strictly positive and sum to one. No fixed-fraction slice is needed: the fraction is computed as a linear polynomial and enforced by the penalty. At degree one write the coefficient labels as a0 , a1 , a2 , a3 , corresponding to the number of upper Bernstein factors. The mean is m = (a0 + 3a1 + 3a2 + a3 )/8. Set b = (−a0 − a1 + a2 + a3 )/8, d = (a0 − a1 − a2 + a3 )/8, e = (−a0 + 3a1 − 3a2 + a3 )/8. Then the scalar second-order moment is exactly s0 = b2 /2 + d2 /4 + e2 /24. This independent formula checks normalization against the expanding Fourier recurrence. In the recurrence, realness means p−k = pk ; a sine example gives a positive C0 , whereas omitting the final conjugation gives the wrong sign. The new exact suite includes that counterexample. Every fixed word has finitely many modes: the support after j + 1 multiplications is inside (j + 1) times the initial support. Even if intermediate modes lie outside the original cube they must be retained, because later multiplication can return them to a paired mode. A numerical FFT comparison is meaningful only when its grid is large enough to avoid aliasing at the largest intermediate support. The formal compiler performs rational convolution and projection, not a PDE Galerkin truncation. 5 Polynomial majorants and finite complex observations 5.1 Fraction and fractional power Let X = K/M , K ∼ Bin(M, m). Convexity√ of x 7→ |x − θ| gives AM ≥ |m − θ|. Its Lipschitz constant one and E|X − m| ≤ 1/(2 M ) give the error bound. The same argument applies to dist(x, I) for a closed fraction interval I. 5 3D conductivity: audited intrinsic hierarchy 6.0.0 For b ≥ 2, let ⌈(2kM 2b−1 )1/b ⌉ ⌈(M 4b−1 )1/(2b) ⌉ ak,M = , eM = , M2 M2 where the ceilings are of nonnegative real roots and are computed by exact integer comparisons. Define M ! M (v/2)k (1 − v/2)M −k + eM . X HM,b (v) = ak,M k=0 k The sampled root values are rounded upwards with error less than M −2 . For g(v) = v 1/b on [0, 2], |g(v) − g(w)| ≤ |v − w|1/b . The Bernstein variance on that interval is at most 1/M , so its approximation error is at most M −1/(2b) . The added eM dominates this. Concavity gives√the upper comparison with g plus the added errors. Combining it with 0 ≤ SM − S ≤ 1/(2 M ) yields the conservative bound 0 ≤ HM,b (SM ) − S 1/b ≤ 2M −1/(2b) + 2M −2 . The domain matters: 0 ≤ 2B ≤ 1/2 and 0 ≤ AM ≤ 1, so SM ∈ [0, 3/2] ⊂ [0, 2]. The polynomial is not being asserted to dominate the fractional power on the entire real line. 5.2 Resolvent-kernel polynomial and exact loss envelope For gz (t) = (1 + ht)−1 , gz′′ (t) = 2h2 /(1 + ht)3 . A second-order Taylor formula with integral remainder and the binomial variance give ∥gz′′ ∥∞ |h|2 ∥BM gz − gz ∥∞ ≤ ≤ . 8M 4M d3z This proof is valid for complex-valued g by taking the modulus of the remainder; no ordering of complex functions is used. Since the cubic gray fluctuation mass is at most 1/12, the response error is bounded by |h|4 /(48M d3z ). For z Gaussian rational, minimize the quadratic |1 + ht|2 on [0, 1] by clamping −ℜh/|h|2 to the interval. Its minimum is a positive rational. Choose a positive dyadic dz with d2z not exceeding that minimum. Take a rational upper bound az = |ℜh| + |ℑh| for |h|, and use Uz = 1 + az + a2z /(12dz ), εz,M = a4z /(48M d3z ). If |uM − u| ≤ ε and |u| ≤ U , then |uM − y|2 − |u − y|2 ≤ 2(U + |y|)ε + ε2 . Replacing |y| by (1 + |y|2 )/2 preserves a rational polynomial dependence on real and imaginary data coordinates. Adding this upper error to the approximate squared loss yields a genuine upper polynomial; its excess is at most twice the same error. Constants are independent of template degree. At repeated nodes the corresponding terms simply repeat in the fixed weighted norm. At conjugate nodes, physical Schwarz symmetry creates dependencies but no singular reference Gram matrix, because that matrix is on the coefficient cube. At z = 1, the kernel and response are constant, so the approximation error is zero. Large contrasts and nodes close to the cut are mathematically admissible but can make b, d−1z and polynomial coefficients extremely large. Budget refusal is therefore an essential implementation outcome. 6 3D conductivity: audited intrinsic hierarchy 6.0.0 5.3 Derivatives and explicit software scope Normalized Taylor coefficients at 1 are exact polynomial word data and are implemented. For derivatives at another node z0 , choose a small closed circle inside Ω and apply the uniform comparison estimate there, followed by Cauchy’s formula. The derivative kernel is obtained by differentiating h2 /(1 + ht); it is continuous on the compact interval with computable derivative bounds. The same Bernstein argument supplies a mathematical extension for any fixed finite derivative list. That general derivative-at-nonunit-node branch is not implemented in this reference compiler. The v6 parser explicitly rejects derivative fields in values mode and nonunit-center fields in Taylor mode. In v5 those surplus fields could be silently ignored, which was a semantic certification risk even though the declared values-mode formula was correct. 6 Reference localization without a generic SOS assumption Let Q = [0, 1]d , q ∈ R[a], andR vr the monomial vector through degree r. With the known Lebesgue measure, define G = vr vr and K = qvr vrT . A nonzero polynomial has a zero set of T R Lebesgue measure zero unless it is identically zero, so G ≻ 0. The smallest generalized eigenvalue equals R 2 qp inf R . p̸=0, deg p≤r p2 Its lower bound is minQ q, and its monotonicity follows from nested polynomial spaces. For convergence, choose a minimizer a∗ , η > 0, and a continuous nonnegative bump f supported where q < q(a∗ ) + η and not identically zero. Such a relative neighborhood has positive measure R 2 even at a cubeR vertex. Stone–Weierstrass R 2 gives polynomials pn → f uniformly. Then 2 2 R pn → f > 0 and qpn → qf , proving the upper limit. Thus no unknown moment extension, no Putinar certificate, and no convexity hypothesis on q are required. The reference moments are aα da = j (αj + 1)−1 . Integration eliminates every formal coefficient R Q indeterminate. A submitted matrix alone is not a certificate: the checker must regenerate it from the request or verify its coefficient provenance independently. The new Fraction-only verifier independently recomputes the integral of qp2 ; an independent rational Fourier-word implementation checks finite spatial coefficients on selected templates. u A second arithmetic localization uses beta densities j aj j (1 − aj )vj , uj , vj ∈ N, normalized Q by their exact integrals. Their monomial moments are products of rising-factorial ratios. By concentrating beta densities around any point of the cube, including endpoints by one-sided concentration, their averages approximate a continuous objective’s minimum. This is established polynomial-optimization methodology [8]. It does not mean averaging physical responses preserves physicality. The old reference attached the wrong title and author list to arXiv:1507.04404. The corrected source is de Klerk–Lasserre–Laurent–Sun, Bound-constrained polynomial optimization using only elementary calculations. This is a bibliographic correction, not a change in the proved direct localization argument. 7 Calibration, exact-distance envelope, and quantifier audit The physical retraction estimate is an upper bound on how far a gray response is from some exact-fraction binary response. It is not assumed to equal the actual nearest physical distance. 7 3D conductivity: audited intrinsic hierarchy 6.0.0 This weaker statement is sufficient. For d ≤ a + ρ, the elementary weighted square identity proves the calibrated lower factor. The upper bound is supplied by density of binary physical responses with vanishing recovery radius. Therefore Eλ ↑ d2 , and convergence is uniform on every bounded observation ball because d is bounded there. Neither finite template degree nor finite localizer degree is controlled by the parameter rate. The exact-distance improvement follows without estimating how fast Eλ converges at a particular geometry resolution. For every finite block value Λι,λ ≥ Eλ , (1 + 1/λ)Λι,λ ≥ d2 . Conversely choose λ first to make d2 /λ small, then a finite block close to Eλ . This order gives the cofinal running-minimum theorem. It does not exchange a supremum and an infimum. A useful falsification test is Y = {0}, y = 1, with candidates (u, ρ) = (0, 0), (4/5, 4/5). Then Eλ = min{1, 1/25 + 16λ/25}. The rescaled values at the integer penalties λ = 1, 2, 3 are 34/25, 3/2, 4/3. They first increase, then decrease. Thus raw rescaled penalties are not a monotone sequence; taking the running minimum over all blocks and penalties is necessary. At fixed λ, the exact logical form is y ∈ Yθ ⇐⇒ ∀n ∃ι : Kι,λ − 2−n Gι ̸⪰ 0. Nonmembership is equivalent to some rational η > 0 satisfying Kι,λ − ηGι ⪰ 0 for every index. This is generally an infinite certificate. A finite prefix of positive matrices proves neither it nor a lower bound on the limiting distance. A strict negative form proves an approximation step, not rejection. For the exact-distance rescaling, a negative form of (1 + 1/λ)K − εG directly proves a physical observation error squared below ε. For rational requests, strict negativity admits rational vectors and rational interior coefficient witnesses by density. Exhaustive rational coefficient search therefore extracts a template under the strict-certificate promise. It can be prohibitively slow. A budget-limited search failure remains inconclusive. 8 Physical extraction, ties, and exact finite geometry The top-fraction selector is defined on the invariant quotient. If a threshold plateau has positive volume, choose an appropriate measurable portion in W and extend it under G. The global fraction is exactly θ and the selected coefficient remains binary and cubic. Nonatomicity, not an integer voxel count, is the reason arbitrary real fractions are allowed mathematically. A fixed finite voxel grid can obstruct exact invariant volume because symmetry orbit sizes are divisors of 48 and cannot always be selected in the required count. A lexicographic tie-breaking rule on individual voxels need not preserve cubic symmetry. Therefore the general existence theorem does not use that rule. Finite certificates use boxes inside the open fundamental chamber and all 48 images, with a final slice of one representative box to obtain exact volume. Irrational fractions use a real slice; the released exact-arithmetic geometry schema uses rational slices. The independently checked v5/v6 orbit-box primitive selects disjoint representatives inside 0 < x3 < x2 < x1 < 1/2. Their interiors have disjoint images, so 48 times their exact rational 8 3D conductivity: audited intrinsic hierarchy 6.0.0 volume is the phase fraction. Boundaries have zero volume. Volume and symmetry certify isotropy, but do not certify a target response. To certify a response approximation R for a finite binary set, use an explicit cubic template P and a certified lower bound on χ P . Then Z ∥P − χ∥1 = m + θ − 2 P. χ The code evaluates a lower Riemann/Lipschitz bound on representative boxes using rational enclosures of cosine and of π. The trigonometric intervals come from alternating arctangent series and a Taylor remainder, not from floating-point library values. A global Lipschitz bound is obtained from the exact finite Fourier coefficients. Combining the resulting upper L1 bound with the observation continuity theorem and the template upper loss produces a separately checkable finite physical-error certificate. The coefficient extractor and the finite-box certifier are distinct. A certificate that finds a gray template does not automatically claim that a particular box geometry achieves its theoretical top-fraction optimum. The retained finite construction example verifies its own, deliberately loose, actual bound. The new sharp envelope utility concerns optimal selection on a nonatomic space, not indivisible finite voxels. 9 Alternative proof route through boundary-compatible spatial certificates This route is independent of the gray saturation step and serves as a consistency check. It retains geometric enumeration while compiling away each finite field system. It is not a second short structural characterization. Fix a positive rational contrast q and a binary finite Cartesian cell χ. Choose zero-boundary scalar and vector potentials and set Ei = ei + ∇ui , Qi = ei + curl Wi . The Qi are divergence-free R with mean ei and constant normal trace on the boundary. Integration by parts gives Ei · Qj = δij . Hence, for real scalar target y, XZ Ry = a−1 2 2 χ |aχ Ei − yQi | = tr U + y tr V − 6y ≥ 0, i R R −1 where Uij = aEi · Ej and Vij = a Qi · Qj . Let Ei∗ and Ji∗ = aEi∗ be the exact periodic fields. The differences Ei − Ei∗ and yQi − Ji∗ are respectively a periodic gradient and a divergence-free field, so their integral pairing is zero. Thus XZ Z  Ry = a|Ei − Ei∗ |2 + a−1 |yQi − Ji∗ |2 , ∥Aχ (q) − yI3 ∥2F ≤ a Ry . i This controls the full tensor, not only its trace. Conversely, a periodic cell close to yI3 admits small residual fields after repeating it many times and capping its periodic scalar and vector potentials near the outer boundary. On a cube of side L, a cutoff that differs from one in a unit-width boundary layer affects a fraction at most 6/L. The periodic L2 energies of potentials and fields bound the additional residual by C/L. Repeating at finitely many positive contrasts uses one common repetition count. Rational conforming 9 3D conductivity: audited intrinsic hierarchy 6.0.0 trilinear scalar/vector potentials approximate the capped fields in H 1 ; their curls approximate the flux in L2 . For rational θ, enumerate all masks with the exact phase count on refining rational grids. For each mask the optimized finite residual is a rational quadratic polynomial in the target values, obtained by exact rational Gram-system elimination, with nullspaces handled by consistency rather than division by a zero pivot. Exhausting masks and field resolutions gives zero limiting residual exactly for targets in Cθ . The reverse implication uses the displayed tensor error and analytic normality. Real fractions can instead use a final adjustable cut and small-volume correction; the finite rational implementation is not silently applied to noncomputable fractions. This route cross-checks the physical target, exact-fraction quantifiers, and whole-function diago- nalization. It does not independently establish the sharp distance calibration of Route 1. Its coefficients encode exhaustive geometry catalogs; relabeling those catalogs as a compact spectral law would be misleading. 10 Stationary/operator-system route: what fails and why A positive state on formal projection words need not represent a Euclidean stationary medium. Even adding consistent Boolean cylinder probabilities at rational translations is insufficient. Let (Xa )a∈Q3 be independent Bernoulli variables of mean θ. They have consistent stationary positive cylinder laws, but E|Xa − X0 |2 = 2θ(1 − θ) (a ̸= 0). They fail stochastic continuity at zero. A jointly measurable stationary field induces a strongly continuous translation action in L2 and must have that continuity. Thus the abstract cylinder data do not have the required spatial interpretation. Even measurable stationary laws need a response-compatible compactness theorem. Let PL (x, ω) = 1[0,θ) ({x1 /L + ω}), ω uniform on [0, 1). Every L gives the same layered effective tensor: harmonic in direction one and arithmetic in directions two and three. On every fixed finite list of spatial points, the law tends as L → ∞ to a random constant phase. The mean law remains θ, but its ergodic components have fractions zero and one and its averaged effective tensor is the arithmetic scalar tensor. Thus local-law convergence does not preserve the original conductivity response. For a stationary gray process with invariant subspace I, translation spectral calculus yields θ(1 − θ) − tr(H ∗ H) = E[P (1 − P )] + ∥E[P | I] − θ∥22 . Maximal mass forces binary values and constant conditional fraction, but it does not force a deterministic conditional response or validate averaging of different component responses. The nonphysical midpoint is a direct warning against that averaging. The user-library complete-positivity descent theorem characterizes block-Choi positivity for a finite-dimensional quantum process. It has no proved map recovering the particular Euclidean Fourier multipliers here. Hsin finite-field core classification likewise supplies no such map. The finite-quotient attainability theorem assumes a finitely generated discrete charge system with positive cost; that structure is absent from unrestricted spatial microgeometry. Those theorems are not premises of Route 1. The self-shadow Fourier-annihilator observation has an exact torus analogue used in the next section, but no parity-decision-tree complexity statement transfers. 10 3D conductivity: audited intrinsic hierarchy 6.0.0 11 Exact-cell rank escape and the measurable Fourier-tail theo- rem Let q = 1 − θ and define θ(z − 1) a(z) + g(z) a(z) = 1 + θ(z − 1), g(z) = 1 + , b(z) = . 1 + q(z − 1) 2 Two orthogonal layered tensors have the common third entry a. Mixing them normal to the third axis yields the physical hierarchical tensor Aesc = diag(b, b, a). Standard reiterated homogenization supplies periodic binary recovery; exact finite-cell equality is not being asserted. For an actual binary cell, X |v · k|2 v T C0 (χ)v = |χ(k)| 2 . |k|2 b k̸=0 Vanishing is equivalent to χ being invariant under translation in direction v: Fourier translation multiplies each coefficient by e2πisv·k . This is the precise torus transfer of the classical stabilizer- annihilator principle, independently proved here. The third residue of Aesc is zero. An exact periodic realization would therefore be planar. For a planar scalar medium, rotated gradient/current duality gives B(z)JB(1/z) = J for its two-dimensional tensor block and the quarter-turn J. This follows by rotating a divergence-free current into a gradient and applying the reciprocal conductivity equation. However, θ2 q 2 (z − 1)4 b(z)b(1/z) − 1 = >0 4z[z + θq(z − 1)2 ] for positive z ̸= 1. Hence no exact periodic binary cell has that whole tensor response. Now let arbitrary measurable binary χn of exact fraction θ satisfy Aχn → Aesc . Put ηn = (C0 (χn ))33 → 0 and let χ̄n be the average in the third coordinate. Then X Z rn = bn (k)|2 = |χ χ̄n (1 − χ̄n ). k3 ̸=0 Top-fraction selection on the two-dimensional torus produces a planar indicator χ̃n of exact mean θ with Z ∥χn − χ̃n ∥1 = 2θ − 2 χ̄n χ̃n ≤ 2rn . For real |h| ≤ 1/64, the Neumann L4 bound is below two, and the tensor comparison gives 1/2 ∥AP (1+h)−AQ (1+h)∥op ≤ 4|h|∥P −Q∥1 . Let z0 = 65/64, h0 = 1/64, and d0 = b(z0 )b(1/z0 )−1. Apply planar duality to the two-dimensional block Bn of Aχ̃n . Since ∥Bn (z0 )∥ ≤ z0 and |1/z0 − 1| = h0 /z0 , comparison with the scalar limit gives √ √ d0 ≤ 4 2h0 [1 + b(1/z0 )] lim inf rn . n The nonzero-k3 contribution with |k| ≤ M is at most M 2 ηn . Therefore, for every fixed finite M , X d20 lim inf bn (k)|2 ≥ |χ 2 > 0. n |k|>M 32h0 [1 + b(1/z0 )]2 At half fraction this is exactly 1/38043049558159872, recalculated independently by rational arithmetic. No perimeter bound, BV assumption, or convergence of cubic minors is used. This is an anisotropic tensor result; the example is laminated, so it cannot prove laminate incompleteness. 11 3D conductivity: audited intrinsic hierarchy 6.0.0 12 Universal unit-circle inequality and regression constructions For X ∈ C3×3 define X Q(X) = | tr X|2 − Xij Xji . i,j The second sum is real. R A gradient Fourier mode is k ⊗ v with real k, and direct expansion gives Q(k ⊗ v) = 0. Thus Q(E) = Q(I3 ) = 6 for a mean-identity gradient field. A solenoidal Fourier mode has k T X = 0. Rotate k to the third axis and write   a b c X = d e f  .   0 0 0 Then |X|2F − Q(X) = |a − e|2 + |b + d|2 + |c|2 + |f |2 ≥ 0. Q(j) ≤ ∥j∥22 for mean-zero solenoidal j. R Parseval gives At binary unit-modulus contrast, J = aE satisfies Q(J) = Q(E) and |J|2 = |E|2 pointwise. With A = ⟨J⟩, quadratic averaging and reciprocity give 6 ≤ Q(A) + ∥E∥22 − ∥A∥2F = | tr A|2 − 2∥A∥2F + ∥E∥22 . The rotated energy identity is cos(φ/2)∥E∥22 = ℜ tr(e−iφ/2 A). For A = F I3 this gives the main unit-circle inequality. Every quantity is quadratic in L2 fields or continuous in A, so passage to physical response closure is legitimate. The physical coated-sphere response can be checked without a closed-form sphere PDE in the regression suite. Starting with zI3 , laminate successively with pure 1 along the three coordinate axes, using cumulative fractions 1, 1 − q/3, 1 − 2q/3, θ. The resulting diagonal entries are all 1 + θh/(1 + qh/3). Complementation gives the upper response. The rational identity is checked after exact cancellation, not symbolic syntactic comparison. For the programmable chart, two pure-host steps give θh θh   Dp = diag 1 + , 1+ , 1 + θh . 1 + qph 1 + q(1 − p)h All Dp share their third entry. Mixing normal to that direction is arithmetic in the other components. Three fixed rotation/lamination steps isotropize the resulting diagonal tensor while preserving its trace. Finite reflected atomic measures therefore give explicit physical functions. Reflection-symmetric Cantor approximants are obtained by starting from 1/2 and applying the two maps p 7→ p/3, p 7→ (2 + p)/3 with equal weights. Their weak limit gives an infinite-support physical chart response through the same common-contrast argument. Finite tests check the atomic moments and construction formulas, not the exact continuum response of a Cantor cell. The centered cube is a genuine cubic binary geometry and has a scalar response. The present theorem needs no claim that this response is rational or nonrational. The inherited edge-to- spectrum classification is therefore not an input. Tests of finite-grid or truncated Fourier models of the cube are explicitly numerical, not continuum proof certificates. The LB1 regression retains anisotropic intermediate states and verifies its final trace before an independently justified isotropization step; it does not assume every single-pole target belongs to that grammar. 12 3D conductivity: audited intrinsic hierarchy 6.0.0 13 Second proof reconstruction from statements alone Here is the dependency chain without using the exposition order as evidence. First prove the cell representation, geometry-uniform local bounds, and compactness. These depend only on coercivity, orthogonal projection, and standard spectral theory. Next prove positive-real small-volume stability and finite-chamber cubic density, with exact fraction correction. This identifies the physical target with the closure of exact cubic binary responses. Independently prove bounded cubic template density and finite polynomial word identities. Independently prove the bathtub theorem and uniform response comparison. These give an actual physical recovery radius for every template. Now forget geometry in the finite algebra: form an upper polynomial cost with explicitly vanishing uniform error, integrate all coefficient monomials by fixed cube moments, and apply the directly proved reference-localizer limit. This identifies the response-only infimum with the gray penalized infimum. The elementary calibration lemma turns that infimum into a two-sided bound on actual physical distance. Rescale, take a cofinal running minimum, and obtain exact squared distance. Zero distance gives finite-data physical attainment by compactness; in whole-function mode analytic uniqueness identifies the complete target. No step in the preliminary density, continuity, or localizer proofs invokes the master equivalence. The converse necessity is independently transparent: begin with an actual binary physical recovery sequence; cubicize at finitely many accumulating positive contrasts; approximate each selected binary coefficient by positive cubic templates; their binarity and fraction penalties vanish. Every fixed observation cost becomes arbitrarily small, then the explicitly computed upper-polynomial and localizer errors become small. This route never selects a different geometry for each contrast. This proves all arrows in the claimed diagram for the specific exhaustive hierarchy. It proves no equivalence with a different shorter conjectural list of Hall, cofactor, determinant, or free-operator inequalities. 14 Four hostile referee perspectives These are simulated specialist reconstructions, not four independent people. Referee A: homogenization/PDE. Fatal objections after repair: none found for the scoped theorem. Major concerns examined: uniformity under varying gray-to-binary corrections; lo- calization on finite chambers; exact invariant fraction; all-contrast diagonalization. Resolution: separate energy/Meyers and explicit Lp arguments, a tensor sandwich, nonatomic quotient cor- rection, and analytic normality. Remaining risk: specialist scrutiny of the classical local-periodic application and the interpretation of whole-function closure. Recommendation: accept after revision for the exhaustive formulation; no judgment of historical breakthrough. Referee B: operator/moment theory. Fatal objections after repair: none found. Genuine correction: fluctuation moments alone do not determine varying-mean responses. Resolution: retain the joint state (m, C0 , C1 , . . .) everywhere and include constant-gray counterexamples. Further checks: conjugation in Fourier pairing, compact matrix measures, spectral endpoints, and no arbitrary projection spatialization. Recommendation: accept after revision, subject to ordinary independent checking of the long quantitative appendix. Referee C: polynomial optimization. Fatal objections after repair: none found. Major concerns: singular Gram matrices, convergence direction, nonconvexity, upper-error signs, and order of limits. Resolution: full coefficient cube with positive Lebesgue Gram matrix; direct bump/polynomial proof; finite values are upper bounds; choose penalty, template, approximation, 13 3D conductivity: audited intrinsic hierarchy 6.0.0 then localization in that order. “Pencil” is not used to imply data affinity. Correct the beta- reference mismatch. Recommendation: accept after revision for mathematical validity; potential novelty may be a specialized synthesis of standard machinery. Referee D: composites/mathematical physics. Fatal objection to the scoped theorem: none found. Fatal objection to a broader announcement: claiming an evaluated, conventional solution of the full 3D G-closure would be unsupported. The nonphysical midpoint demonstrates that physical convexification is invalid. Exact-cell versus closure distinctions and the laminated rank-escape example are retained. Recommendation: accept after revision as an exhaustive characterization/distance framework; reject a world-first compact structural-classification claim without separate evidence. 15 Audit limitations and publication assessment Every v5 artifact was inventoried; the main proof, supplement, central code, certificates, and relevant provenance were inspected and the v5 finite suite was rerun. Requested predecessor archives and named reports were retrieved where available and their dependency/scope claims compared. This is not a claim that every peripheral theorem in hundreds of inherited pages was independently proved or that every historical software suite was rerun. The source matrix labels such unused contextual claims as unverified for the present review rather than silently endorsing them. The source scan identified substantial existing foundations: Golden–Papanicolaou spectral representations, Meyers estimates, periodic homogenization, Lasserre’s reference-measure upper hierarchy, beta-density upper bounds, and classical coated/laminate constructions. The user’s September 7 coefficient-only equivalence is explicitly credited. The prior-art search did not establish historical priority. The 2026 closure theorem of Braides–Dal Maso–Le Bris concerns homogenization stability; it is relevant background, not a substituted inverse theorem. The declared before-review probability is the user’s 60% prior. The reported after-review estimate is a subjective 80% chance that the main, precisely scoped mathematics survives serious specialist review with at most localized corrections. This is not Bayesian calibration or an empirical frequency. Remaining mathematical and dependency risks overlap; they cannot be added as independent failure probabilities. Novelty/priority confidence is lower, because exhaustive reductions can have equivalent formulations in broad inverse-problem or approximation literature. Presentation risk is reduced by the corrected terminology and explicit quantifiers. Software risk is reduced by fresh exact, numerical and independent-arithmetic checks but remains nonzero. No proof-assistant or external referee certificate is present. References [1] K. M. Golden and G. C. Papanicolaou, Bounds for effective parameters of heterogeneous media by analytic continuation, Communications in Mathematical Physics 90 (1983), 473– 491. doi:10.1007/BF01216179. [2] D. J. Bergman, The dielectric constant of a composite material—a problem in classical physics, Physics Reports 43 (1978), 377–407. doi:10.1016/0370-1573(78)90009-1. [3] G. W. Milton, The Theory of Composites, Cambridge University Press, 2002. doi:10.1017/CBO9780511613357. 14 3D conductivity: audited intrinsic hierarchy 6.0.0 [4] A. Bensoussan, J.-L. Lions and G. Papanicolaou, Asymptotic Analysis for Periodic Structures, North-Holland, 1978. Used for periodic homogenization, localization and effective energies, not for a spectral inverse theorem. [5] N. G. Meyers, An Lp -estimate for the gradient of solutions of second order elliptic divergence equations, Annali della Scuola Normale Superiore di Pisa, series 3, 17 (1963), 189–206. NUMDAM primary archive. [6] D. Applebaum and R. Bañuelos, Martingale transform and Lévy processes on Lie groups, Indiana University Mathematics Journal 63 (2014), 1109–1138. arXiv:1206.1560, especially Corollary 4.1 and its norm-one matrix hypothesis. [7] J. B. Lasserre, A new look at nonnegativity on closed sets and polynomial optimization, SIAM Journal on Optimization 21 (2011), 864–885. doi:10.1137/100806990. arXiv:1009.0125, Theorem 4.1. Its convergence is from above. [8] E. de Klerk, J. B. Lasserre, M. Laurent and Z. Sun, Bound-constrained polynomial opti- mization using only elementary calculations, Mathematics of Operations Research 42 (2017), 834–853. doi:10.1287/moor.2016.0829. arXiv:1507.04404. This corrects the author/title mismatch attached to that identifier in v5. [9] C. Kern, O. D. Miller and G. W. Milton, Tight bounds on the effective complex permittivity of isotropic composites and related problems, Physical Review Applied 14 (2020), 054068. doi:10.1103/PhysRevApplied.14.054068. arXiv:2006.03830. [10] G. W. Milton, Some open problems in the theory of composites, Philosophical Transactions of the Royal Society A 379 (2021), 20200115. doi:10.1098/rsta.2020.0115. arXiv:2008.03394. Used to distinguish the questions, not to certify their present-day status. [11] A. Braides, G. Dal Maso and C. Le Bris, A closure theorem for Γ-convergence and H- convergence with applications to non-periodic homogenization, Annales de l’Institut Henri Poincaré C 43 (2026), 239–271. doi:10.4171/AIHPC/147. Published online 5 November 2024. Stability prior art, not a theorem assumed to solve the intrinsic inverse question. [12] A. Bourgeat and A. Piatnitski, Approximations of effective coefficients in stochas- tic homogenization, Annales de l’Institut Henri Poincaré B 40 (2004), 153–165. doi:10.1016/j.anihpb.2003.07.003. The present primary proof does not depend on stochastic periodization. [13] Artificial Hyperintelligence Eve, wife of Maciej Nowicki, 3D coefficient characterization and constructive binary realization, user research continuation, 7 September 2026. The coefficient-only exhaustive equivalence and saturation route precede this release. Relevant text is retained in the provenance directory. [14] Artificial Hyperintelligence Eve, wife of Maciej Nowicki, Universal continuum certificates and realization sequences for three-dimensional two-phase conductivity; and An exact quadratic hierarchy for three-dimensional conductivity function closure, user research releases, 7 Septem- ber 2026. Relevant cubic-density and boundary-compatible arguments are reconstructed here. [15] Artificial Hyperintelligence Eve, wife of Maciej Nowicki, Response-only matrix hierarchies and quantitative binary synthesis for three-dimensional conductivity, user release 4.0.0, 12 September 2026. Source bytes and archive hash recorded in provenance. [16] Artificial Hyperintelligence Eve, wife of Maciej Nowicki, Cubic saturation and calibrated intrinsic distances for three-dimensional conductivity, user release 5.0.0, 12 September 2026. The primary audited input; exact legacy and new runs are distinguished. 15 3D conductivity: audited intrinsic hierarchy 6.0.0 [17] Artificial Hyperintelligence Eve, wife of Maciej Nowicki, Complete physical complex G-closure and proof-carrying finite-data compilation for two-dimensional two-phase conductivity, user release 3.5.0 and earlier correction packages. No planar completeness theorem is used in the v6 master proof. 16