Independent check of the signed moments (Lemmas 11 and 12, Theorems 16 to 19 of the note) and of package dfour (Theorem H on the family (2a’, 2b’, 2c’) without K_u)
2026-09-28
Verdicts
| item | verdict | one sentence |
|---|---|---|
| Lemma 11 | CONFIRMED | The families supported at a character are the pairs in the blocks of the partition of \(\{0,1,2,3\}\) by \(\lambda\), and the five partition types give exactly the five listed cases. |
| Lemma 12 | CONFIRMED | Redone by hand for all four families of \(y\) and \(z\) at an A-hole; the inversion and the coordinate permutations carry it to B-holes and the other axes; law × generator \(= 0\) holds over \(\mathbb Z\) on 16 cells. |
| Theorem 16 | CONFIRMED | The symbol, determinant, factorisations, the condition \(M=0\), the case analysis and the inclusion–exclusion count were all redone; exact ranks agree with the formula on 16 cells × 3 axes, and a per-character evaluation of the law reproduces the symbol on four cells. |
| Theorem 17 | CONFIRMED WITH CORRECTIONS | All five cases and the dimension count are right, and exact ranks agree on 16 cells; the remark ‘no constant on a sublattice occurs’ is right only in the sense that no \(\sigma_v\)-type constant occurs, since a constant field on all vertices is a sum of currents (correction 5). |
| Theorem 18 | CONFIRMED | The pairs of directions and the weights \(\tfrac12(f\pm g)\) reproduce the chain’s contributions to the types and to \(n\) for \(\{0,1\}\) and \(\{2,3\}\), and the other families are the same by permutation. |
| Theorem 19 | CONFIRMED WITH CORRECTIONS | The averaging argument and the six shifts on B are right, and the theorem holds exactly, with the constants, on 837 odd states of 9 cells, 2 of them not members, with negative controls; the sum on A needs no added constant (correction 6). |
| L0 | CONFIRMED | The list of six slack vectors is complete and the labels are right; on sampled states every sublattice with three types had one of the six vectors (1,148 sublattice cases). |
| L1 | CONFIRMED | The translation by \(8e_k\) fixes every chain of the other two axes on every member, thin ones included, because each pair of extents has gcd 2; the full-line case correctly uses Theorem U at the straight holes. |
| L2 | CONFIRMED | (B) re-derived from Theorem 19, and its gauge invariance checked term by term for all three gauge constants; exact on 784 member states. |
| L3 | CONFIRMED | Lemma 4 applies as used: non-negative, separable on a full product, product zero by L1, neither identically zero when the axis is two-way; its conclusion is that both functions depend on the same single coordinate. |
| L4 | CONFIRMED | The means agree because \(y\mp1\) runs over all even residues as \(y\) runs over the odd ones; exact on every state. |
| L5 | CONFIRMED WITH CORRECTIONS | All four formulas were re-derived for both signs, the induction round the circle is right, and the case ‘B is not (ii)\(_y\)’ was written out in full and holds; the constancy of the \(y\)-part of \(\sigma^B_x\) is not needed (correction 3). |
| L6 | CONFIRMED | The circle argument makes \(F_-\) and \(U_-\) constant, and then (B) gives \(\sigma^B_z = \sigma^A_z\) directly, so the inversion is not even needed. |
| L7 | CONFIRMED WITH CORRECTIONS | I derived all four rows of the class table, not just the two in the report, and the facts, \((\star)\) and the final contradiction for both residues of \(z_0\) mod 4; the permutation reduction is right; the remark that the planes \(z_0\pm2\) ‘may coincide’ is false but unused (correction 1). |
| Assembly §2.10 | CONFIRMED | Every pair (label of A, label of B) is covered: a (i) on A by L5b, a (i) on B by the inversion, equal (ii) by L6, mixed (ii) by L7. |
| Periodicity §2.11 | CONFIRMED (conditional on the record) | The logic holds given Theorem H, Lemma A and the curl note’s Theorem P; the flux identity can be replaced by the definition of zero flux (correction 4). |
| Thin members §3 | CONFIRMED | Every step holds at extent 2. Theorem M′ at extent 2 is still a solver fact, not a proof: I reproduced it as UNSAT on four thin members, with controls. |
No gap was found in Part I or Part II. Six corrections are listed in §4; none of them affects a conclusion.
1. Part I, read by hand (T1)
The symbol of \(P^x\)
- The law at an A-hole. At \(O = a + 2e_x\) the bridgeheads with \(s_x = -1\) need \(s_ys_z = +1\), which gives \(a + d_0\) and \(a + d_1\). Those with \(s_x = +1\) need \(s_ys_z = -1\), which gives \(a + 4e_x + d_2\) and \(a + 4e_x + d_3\). This is the note’s form of the law.
- The A-hole row. Put \(K = \alpha\chi\) on A and \(\beta\chi\) on B, and divide by \(\chi(O)\). Since \(\chi(d_2) + \chi(d_3) = \xi^{-1}p\) and \(\chi(d_0) + \chi(d_1) = \xi q\), the row is \(\Delta\alpha - (\xi p - \xi^{-1}q)\beta\).
- The B-hole row. At \(O = b + 2e_x\) the bridgeheads are \(b - d_3\) and \(b - d_2\) (with \(s_x = -1\)), and \(b + 4e_x - d_1\) and \(b + 4e_x - d_0\) (with \(s_x = +1\)). The row is \(-(\xi q - \xi^{-1}p)\alpha + \Delta\beta\). So \(M\) is as stated.
- The determinant. \(\Delta^2 = X_\xi^2 - 4\) and \(\Theta\Theta' = X_\xi\,pq - (p^2+q^2)\). With \(pq = X_\eta + X_\zeta\) and \(p^2+q^2 = 4 + X_\eta X_\zeta\) this gives \(\det M = (X_\xi - X_\eta)(X_\xi - X_\zeta)\).
- The factorisations. \(X_\xi - X_\zeta = \xi^{-2}(\xi^2\zeta^2 - 1)(\xi^2\zeta^{-2} - 1)\), which is \(\xi^{-2}(\chi(u_{02}) - 1)(\chi(u_{13}) - 1)\). Likewise \(X_\xi - X_\eta\) factors through \(u_{03}\) and \(u_{12}\). CONFIRMED.
- When \(M = 0\). Take \(\xi^2 = \varsigma\), so that \(\xi^{-1} = \varsigma\xi\). Then \(\xi\eta\zeta\,\Theta = \varsigma\eta^2 + \varsigma\zeta^2 - \eta^2\zeta^2 - 1 = -(\eta^2-\varsigma)(\zeta^2-\varsigma)\), and \(\xi\eta\zeta\,\Theta' = \varsigma(\eta^2-\varsigma)(\zeta^2-\varsigma)\).
- So \(M = 0\) if and only if \(\xi^2 = \eta^2 = \pm1\) (both families of \(z\)) or \(\xi^2 = \zeta^2 = \pm1\) (both families of \(y\)).
- The converse also holds: \(\chi(u_{03}) = \chi(u_{12}) = 1\) forces \(\xi^4 = 1\) and \(\xi^2 = \eta^2\). CONFIRMED, and checked with sympy (h532).
Lemma 11
The complementary pairs are exactly the two families of one axis, and a triple \(\{0,1,2,3\}\setminus\{\ell\}\) contains one family of each axis. Equality of all four \(\lambda\) makes \(\chi\) trivial on \(\Lambda\), which is generated by the \(d_i - d_j\). CONFIRMED.
Lemma 12
At the A-hole, each family leaves two terms that must be the same chain (four families; each pair lies on one chain):
| family | first term | second term | difference |
|---|---|---|---|
| \(\{0,2\}\) | \(a+(0,-2,-2)\) | \(a+(4,-2,2)\) | \(2u_{02}\) |
| \(\{1,3\}\) | \(a+(0,2,2)\) | \(a+(2,2,0)\) | \(u_{13}\) |
| \(\{0,3\}\) | \(a+(0,-2,-2)\) | \(a+(4,2,-2)\) | \(2u_{03}\) |
| \(\{1,2\}\) | \(a+(0,2,2)\) | \(a+(2,0,2)\) | \(u_{12}\) |
- \(\mathbf 1_A\) and \(\mathbf 1_B\) satisfy the law.
- The inversion maps \(\mathcal H_A\) to \(\mathcal H_B\) (using \((4,0,0) = u_{02} + u_{13} \in \Lambda\)), maps \(s\) to \(-s\), exchanges the methylenes, and maps law to law with the same sign. It fixes each family, since the bond \((a, a+d)\) goes to a bond of direction \(d\).
- The permutations of the coordinates permute \(\{d_1, d_2, d_3\}\) and fix \(d_0\).
CONFIRMED.
Theorem 16
- The case analysis. For each character:
- \(\det \ne 0\): the kernel is 0, and no family is supported.
- \(\det = 0\) and \(M \ne 0\): the kernel is a line, spanned by any supported chain, whose vector is \((1, 1/\lambda_i) \neq 0\).
- \(M = 0\): the two vectors of the two families of one axis are independent unless all \(\lambda\) are equal, and at the trivial character \(\mathbf 1_A\) and \(\mathbf 1_B\) span. The note writes this only for \(y\); \(z\) is identical.
- The span decomposes. The span of the generators is \(\Lambda\)-invariant, so it is the sum of its projections, and those are spanned by the projections of the generators.
- Real from complex. The real statement follows because the coefficients are integers and the generators are real: \(\ker_{\mathbb R}\otimes\mathbb C = \ker_{\mathbb C}\), and likewise for the span.
- The count. I redid the inclusion–exclusion:
- one condition: \(2b\gcd(a,c)\) and \(2c\gcd(a,b)\) characters;
- \(\alpha\beta\): \(2b\), and \(\gamma\delta\): \(2c\);
- cross pairs: \(\gcd(a,b,c)\) each, via \(v\mapsto v\cdot d_\ell/4\) onto \(\mathbb Z\) with the periods going to \(\pm a, \pm b, \pm c\). The four cross pairs are \(\perp d_1, d_3, d_2, d_0\).
- Any three conditions give the fourth, for example \(u_{12} = u_{02} + u_{13} - u_{03}\). The four steps generate \(\Lambda\), since the graph on \(\{0,1,2,3\}\) with edges 02, 13, 03, 12 is connected.
CONFIRMED.
Theorem 17
- The currents are solutions. \(d_r\cdot u_f = 0\) for \(r\notin f\). For \(r \in f\), a bond of direction \(d_r\) at a vertex of \(C\) is the chain’s own bond at that vertex, so both ends are on \(C\).
- The five cases.
- One family \(f\) of axis \(m\): law \(m\) has no supported family, so \(n_m = 0\). The other two laws give \(n_B = n_A/\lambda_i\). The two bonds \(r\notin f\) give \(n_A \parallel u_f\).
- Two families (axis \(m\), values \(\mu \ne \nu\)): law \(m\) is non-degenerate and the other two symbols vanish. The bond rule reduces to \((n_{Ay} + n_{Az}) = \mu(n_{By} + n_{Bz})\) and \((n_{Ay} - n_{Az}) = \nu(n_{By} - n_{Bz})\) (for \(m = x\)). That is a plane, and \((u_{01}, u_{01}/\mu)\) and \((u_{23}, u_{23}/\nu)\) are independent vectors of it.
- Three families: every law has two supported families on different axes, so \(M^k \ne 0\), \(\det = 0\) and \(n_B = n_A/\mu\). The bond rule on \(d_\ell\) gives the plane \(\perp d_\ell\).
- Trivial character: \(n_A = \lambda n_B\), three dimensions.
- The dimension. It is #chains − #relations, with relations \(0, 0, 1, 3\) in the four non-empty cases, which gives the formula. CONFIRMED.
- Pressed points.
- Does Theorem 17 need orientation? Theorem 17 is a statement about a linear system and has no hypothesis on holes. Orientation enters only in applying it to a state: by Lemma 3, \(n\) obeys all three laws at \(O\) if and only if \(c(O) = 0\), since one charged hole breaks all three laws by the same amount. So, for a frozen state, \(n\) is a sum of currents if and only if every hole is oriented. The note’s sentence ‘the moments of a state with every hole oriented are a sum of such currents’ is exactly right.
- ‘No constant on a sublattice occurs.’ See correction 5. \(c\,\mathbf 1_A\) and \(c(\mathbf 1_A - \mathbf 1_B)\) are not solutions (checked for \(e_x\mathbf 1_A\) on all 16 cells). But the constant \(e_x\) on all vertices is \(\tfrac12\sum_{C\in\{0,2\}}\tfrac12u_{02}\mathbf 1_C + \tfrac12\sum_{C\in\{1,3\}}\tfrac12u_{13}\mathbf 1_C\).
- Real from complex: as for Theorem 16.
- ‘Neither system implies the other.’ Confirmed by hand: the bond rule alone has kernel dimension 2 at a character with non-equal \(\lambda\) and 3 at the trivial one. On 16 cells the kernel of the laws alone (exact, the sum of the three kernels of Theorem 16) always exceeds the joint kernel, so the laws never imply the bond rule. The kernel of the bond rule alone, computed modulo \(p\), equals \(N+1\) on every cell, as the hand count predicts; it equals the joint kernel on \((1,1,1)\) only, which is exact there and a mod-\(p\) statement elsewhere.
Theorem 18
Take the family \(\{0,1\}\), with (C) contributions \(f\) to \(Y\) and \(-f\) to \(Z\), and \(n\) contribution \(g(0,1,1)\). Then \(D_{\pm y} = \tfrac12(f\pm g)\) and \(D_{\pm z} = \tfrac12(-f\pm g)\).
- The pair \(\{+e_y,-e_z\}\) has difference \((0,1,1) = \tfrac12u_{01}\) and weight \(\tfrac12(f+g)\).
- The pair \(\{+e_z,-e_y\}\) has weight \(\tfrac12(g-f)\).
- For \(\{2,3\}\) the pairs are \(\{+e_y,+e_z\}\) and \(\{-e_y,-e_z\}\), with weights \(\tfrac12(f+g)\) and \(\tfrac12(f-g)\).
- The constants \(\tfrac12(\kappa_k + \sigma_v\gamma_k)\) come from (C) only.
CONFIRMED.
Theorem 19
- The components. \(\tfrac12u_f\) gives \(n_x = G_{02}+G_{13}+G_{03}+G_{12}\), \(n_y = G_{01}+G_{23}+G_{03}-G_{12}\) and \(n_z = G_{01}-G_{23}+G_{02}-G_{13}\). All three are correct.
- Where each family sits. On an \(x\)-line the chain of \(\{0,2\}\) through each vertex lies in the pair of \(y\)-planes of the vertex. Its chains in that pair are the classes of \(x - z\) modulo \(4\gcd(a,c)\), and the line moves \(x - z\) by 4 at each step through \(a\) vertices, a multiple of \(\gcd(a,c)\). So the average is the mean weight over the pair. This holds on every cell.
- The shifts on B. A chain of \(\{i,j\}\) has its B vertices at its A vertices \(+\,d_i\). So at \(w\in\) B its A-plane along axis \(m\) is \(w_m - (d_i)_m\):
- \(x\): \(d_0, d_1\) have \(+1\) and \(d_2, d_3\) have \(-1\), so \(F_{01}(x-1)\) and \(F_{23}(x+1)\);
- \(y\): \(d_0, d_2\) have \(+1\) and \(d_1, d_3\) have \(-1\), so \(U_{02}(y-1)\) and \(U_{13}(y+1)\);
- \(z\): \(d_0, d_3\) have \(+1\) and \(d_1, d_2\) have \(-1\), so \(W_{03}(z-1)\) and \(W_{12}(z+1)\).
- The sum. The sum on A is exactly \(2F_{01}+2U_{02}+2W_{03}\) (correction 6).
2. Part II, read by hand (T2)
- (a) L0. The three types occur if and only if the three arcs \(\{R,g_{rp},P\}\), \(\{P,g_{pq},Q\}\) and \(\{Q,g_{qr},R\}\) each carry a unit. I checked \(\max p - \min r = R + g_{rp} + P\) and \(2 + \max r - \min q = R + Q + g_{qr}\). The two units can be on two distinct spreads (3 vectors) or on a spread and its opposite gap (3 vectors); two gaps, or both units on one slot, cover at most two arcs. The labels are right:
- \((0,0,1,0,0,1)\) has \(q = r+1\), both constant, so \(a_x \equiv \tfrac12\): this is (ii)\(_x\);
- \((0,1,0,0,1,0)\) is (ii)\(_y\);
- \((1,0,0,1,0,0)\) is (ii)\(_z\);
- (i)\(_k\) means the profile of \(k\) is constant.
- (b) L1.
- The translation fixes the chains. \((8,0,0) \equiv t(2,0,\pm2)\) needs \(t\equiv4 \bmod 2a\) and \(t\equiv0\bmod 2c\), which is solvable because \(\gcd(2a,2c) = 4\) on a member. It is the same for \(\{0,3\},\{1,2\}\) with \(\gcd(2a,2b) = 4\). At \(a = 2\) it is trivial, since \(8e_x\equiv0\). B vertices follow A vertices by \(+d_i\).
- One sign per line. A full line: each \(v, v+4e_k\) are the two rods of the straight hole \(v+2e_k\) (Law C), which is oriented, so they have the same sign. At extent 2 the two holes \(v\pm2e_k\) share the same two rods. A half line: the vertices of type \(k\) are \(v + 8m e_k\), all with the same \(n_k\).
- (c) L2.
- All three lines of (B) were re-derived from Theorem 19 with \(U_{02,13} = \tfrac12(U_+\pm U_-)\) and so on.
- The gauges are \(c_1\) (\(U_+ + c_1\), \(W_+ - c_1\)), \(c_2\) (\(F_+ + c_2\), \(W_- - c_2\)) and \(c_3\) (\(F_- + c_3\), \(U_- - c_3\)). Each enters each line of (B) either through a sum, where it cancels against its partner, or through a difference, where it cancels itself.
- (d) L3. \(\rho_\pm = (a_k \pm \sigma_k)/2 \ge 0\) because \(|n_k| \le K_k\). \(a_k\) is separable (P2) and \(\sigma_k\) is separable (Theorem 19), both on the full product of transverse residues. \(\rho_+\rho_- = 0\) by L1. When the axis is two-way, a positive vertex on a line \(\ell\) gives \(\rho_+(\ell) = a_k(\ell) > 0\), and likewise for \(\rho_-\). Lemma 4 concludes that both depend on the same single coordinate, so \(a_k = \rho_+ + \rho_-\) does too. CONFIRMED.
- (e) L5.
(a). In (i)\(_x\), \(a_x = 1 - a_y(z) - a_z(y)\) with both parts non-constant, so it depends on both coordinates, which contradicts L3. Axis \(x\) occurs, since \(\max a_x = 1\).
(b). \(U_+ = -s\,a_z + c_1\) and \(W_+ = -s\,a_y + s - c_1\). \(F_\pm\) are constant (from the planes where \(a_y\), \(a_z\) vanish). \(p_B\) is constant, so B is (i)\(_x\), (ii)\(_y\) or (ii)\(_z\).
The four formulas. Substituting \(U_+ = -s(\rho_++\rho_-) + c_1\) and \(U_- = \rho_+ - \rho_- - f_-\):
\(s\) \(y\)-part of \(\sigma^B_x\) \(\sigma^B_z\) \(+1\) \(c_1 - \rho_-(y-1) - \rho_+(y+1)\) \(\rho_+(y+1) - \rho_-(y-1)\) \(-1\) \(c_1 + \rho_+(y-1) + \rho_-(y+1)\) \(\rho_+(y-1) - \rho_-(y+1)\) In \(\sigma^B_z\) the \(x\)-part \(f_-\) cancels against the \(-f_-\) inside \(U_-\). All four match the report.
The induction. For \(s=+1\): \(|\rho_+(y+1) - \rho_-(y-1)| = \tfrac12\) with values in \(\{0,\tfrac12\}\) means exactly one of them is \(\tfrac12\). From \(\rho_\pm(y_0) = 0\) we get \(\rho_+(y_0+2) = \tfrac12\), hence \(\rho_-(y_0+2) = 0\), and so on round the \(2b\) even residues back to \(y_0\): contradiction. For \(s=-1\) the induction runs on \(\rho_-\).
Only \(|\sigma^B_z| = \tfrac12\) is used. The constancy of the \(y\)-part of \(\sigma^B_x\) (the constant \(K\)) plays no role (correction 3).
‘B is not (ii)\(_y\)’, written out.
- Set-up: B in (ii)\(_y\) has \(a^B_y \equiv \tfrac12\), so \(|\sigma^B_y| = \tfrac12\) on every B \(y\)-line. On A, \(\sigma^A_y = f_+ + W_-(z) =: \tau'(z)\) with \(|\tau'| = a^A_y(z)\), since \(F_+ \equiv f_+\).
- Put \(\rho'_\pm = (a^A_y \pm \tau')/2 \in \{0,\tfrac12\}\), with \(\rho'_+\rho'_- = 0\). Then \(W_- = \rho'_+ - \rho'_- - f_+\) and \(W_+ = -s(\rho'_+ + \rho'_-) + c_2\).
- By (B), \(\sigma^B_y = f_+ + \tfrac12[W_+(z-1) - W_+(z+1)] + \tfrac12[W_-(z-1) + W_-(z+1)]\). The \(x\)-part is \(f_+\), because \(F_\pm\) are constant. This reduces to \(\rho'_+(z+1) - \rho'_-(z-1)\) for \(s=+1\) and to \(\rho'_+(z-1) - \rho'_-(z+1)\) for \(s=-1\): the same shape as \(\sigma^B_z\) above.
- Since \(a^A_y(z_0) = 0\) for some even \(z_0\) in (i)\(_x\), the same induction round the \(2c\) even residues gives a contradiction.
The report’s ‘the same argument with \(y\) and \(z\) exchanged’ is correct. It does not need its own remark about the \(z\)-part of \(\sigma^B_x\) either.
- (f) L6.
- On A, \(F_+\) and \(U_+\) are constant.
- On B, the \(x\)-part of \(\sigma^B_y\) is \(f_+ + \tfrac12[F_-(x-1)-F_-(x+1)]\), which is constant. Summed round the odd residues it gives \(\kappa = 0\), so \(F_-\) is constant on the even residues. Likewise \(U_-\).
- So \(\sigma^A_z\) is a constant of modulus \(\tfrac12\).
- The inversion step is correct: \(n'(\iota v) = n(v)\) satisfies the bond rule, because the bond \((a, a+d)\) goes to the bond \((\iota(a+d), \iota a)\) of direction \(d\). I also checked on 504 sampled states that the inverted state satisfies (T2), oddness and the bond rule.
- The inversion is not needed: with \(F_\pm\) and \(U_\pm\) constant, (B) gives \(\sigma^B_z = f_- + u_- = \sigma^A_z\) directly. That is one-way on A and B with the same sign, and it makes L4 unnecessary in this case. It holds exactly in all 112 case-(ii) states.
- (g) L7.
- The class table. I derived the table for all four B classes (h539):
- \(c_0'\): \(+b^{c_0}(y'{-}1,z'{-}1) - b^{c_1}(y'{+}1,z'{+}1) - b^{c_2}(y'{-}1,z'{+}1) - b^{c_3}(y'{+}1,z'{-}1)\);
- \(c_1'\): \(-b^{c_0}(y'{+}1,z'{+}1) + b^{c_1}(y'{-}1,z'{-}1) - b^{c_2}(y'{+}1,z'{-}1) - b^{c_3}(y'{-}1,z'{+}1)\);
- \(c_2'\): \(-b^{c_0}(y'{-}1,z'{+}1) - b^{c_1}(y'{+}1,z'{-}1) + b^{c_2}(y'{-}1,z'{-}1) - b^{c_3}(y'{+}1,z'{+}1)\);
- \(c_3'\): \(-b^{c_0}(y'{+}1,z'{-}1) - b^{c_1}(y'{-}1,z'{+}1) - b^{c_2}(y'{+}1,z'{+}1) + b^{c_3}(y'{-}1,z'{-}1)\).
- The classes of the A values. \(E_x(0,+), E_y(0,+), E_z(0,+) \in c_0\); \(E_x(0,-), E_y(2,+), E_z(2,-) \in c_1\); \(E_x(2,-), E_y(0,-), E_z(2,+) \in c_2\); \(E_x(2,+), E_y(2,-), E_z(0,-) \in c_3\).
- The facts. \(|b^c_x| = \tfrac12[z\in Z_x]\). On \(Z_x\cap Z_c\), \(a_y = 0\) gives \(e^c_x \equiv e^c_z(z)\). \(|b^B_x| = \tfrac12\). \((\star)\) holds.
- The conclusion, for both residues of \(z_0\):
- \(z_0\equiv0\): the classes are \(\{c_1,c_2\}\). The \(c_0'\) vertex at \(z' = z_0+1\) gives \(2b = -t - \tilde t\), and the \(c_2'\) vertex at \(z' = z_0-1\) gives \(2b = -t + \tilde t\).
- \(z_0\equiv2\): the classes are \(\{c_0,c_3\}\). \(c_0'\) at \(z_0-1\) gives \(t - \tilde t\), and \(c_2'\) at \(z_0+1\) gives \(-t - \tilde t\).
- The reduction. \(S_3\) acts freely and transitively on the six ordered pairs of distinct axes. A permutation maps a member to a member (its extents permuted), preserves A and B (parity and coordinate sum), permutes \(d_1, d_2, d_3\) with \(d_0\) fixed, permutes the types, preserves (T2), and maps the label (ii)\(_k\) to (ii)\(_{\pi k}\).
- Thin members. On a member the planes \(z_0\pm2\) are distinct, since \(4c \ge 8\) and they differ by 4 (correction 1).
- The class table. I derived the table for all four B classes (h539):
- (h) The assembly.
- Label of A in (i): covered by L5b.
- Label of B in (i): covered by the inversion, which is a symmetry of odd frozen states on the same cell (checked on states).
- Both in (ii), equal: covered by L6. Mixed: impossible by L7.
- L4 then gives one sign for A and B together, using that both carry type \(k\) (§2.1, M′).
- (i) Thin members. At extent 2:
- L1 was checked above.
- Lemma 3 and the holes: the methylenes are distinct modulo 8.
- Theorem 19: a line of 2 vertices meets each of the 2 chains of a family once.
- L5 and L6: circles of \(2b \ge 4\) even residues.
- L7: all B classes exist, and the planes are distinct.
- Theorem P on thin members: confirmed by check8.
- Periodicity §2.11.
- \(c(0,2,2) \equiv c(0,2,-2)\) modulo \((0,0,4c)\), so \((0,2c,2c)\in\Lambda_x\) is nonzero.
- Zero flux by definition (curl note, after Lemma A) means equal numbers of \(\pm\) moments on each axis of each sublattice, so a one-way axis with a vertex is excluded directly.
3. Computations (T3)
My own scripts are h530 to h539 in scratch_h.
- h530 is the library: geometry, chains by my own walk, holes, the bond-rule sign recovery, the line data, the profiles, the slack and the labels.
- Imports. They import only
icemix.lattice.build,a4_typemodel.TypeModel(for the hexagon axes, the encoding of (T2), the sign field and the odd selectors) andh32_cap. Nothing from h440–h448 or h480–h485 was read, imported or run. - Environment. Every command ran from
scratch_hwith the statedPYTHONPATHandTMPDIRand the project.venvPython. - Exactness. Every claim below is exact:
- integers and
Fractions; - ranks modulo \(p = 2^{31}-1\) with the sandwich argument: law × generator \(= 0\) is checked over \(\mathbb Z\), and rank\(_p \le\) rank\(_\mathbb Q\), so equality of \(N - \mathrm{rank}_p(\text{law})\) and \(\mathrm{rank}_p(\text{generators})\) proves kernel = span over \(\mathbb Q\);
- the exception is h532’s per-character check, which is in floating point with a tolerance of \(10^{-9}\) and is a consistency test only.
- integers and
| command | what it tested | verdict | wall |
|---|---|---|---|
h531_ranks.py 1,1,1 1,1,2 2,2,2 |
Th 16 (3 axes), Th 17, laws/bond implications, \(e_x\mathbf1_A\) | all OK; bond ⇒ laws only on (1,1,1) | 0.8 s |
h531_ranks.py 1,2,3 2,3,3 3,3,3 2,2,4 |
same | all OK | 1.1 s |
h531_ranks.py 2,4,6 4,3,3 6,2,3 5,2,4 4,4,4 |
same | all OK | 5.8 s |
h531_ranks.py 1,1,5 2,2,6 4,4,6 2,6,10 |
same | all OK | 20.9 s |
h532_symbol.py 1,2,3 2,2,2 3,3,3 2,4,6 |
sympy identities; law applied to \(\chi\mathbf1_A\), \(\chi\mathbf1_B\) for every extension \(\chi\) = the symbol; \(M=0\) / \(\det=0\) ⇔ support conditions; \(\sum\dim\ker/16\) = formula | ALL OK (0 mismatches in 5,696 extensions) | 2.5 s |
h533_states.py 2,2,2 (h451, h471 odd) --sym |
full battery (U, joint system, L1, Th 19 with 2 negative controls, (B), L4, profiles, L0, L3, labels, S, L5/L6 facts, symmetry images) | 78 states: all pass; S 63/63; NEG all-shifts fails 77/78, NEG \(y\)-shifts fails 43/78 | 1.1 s |
h533_states.py 2,4,6 (h451, h471) --sym |
same | 88 states all pass; S 71/71; NEG 87/88, 62/88 | 1.6 s |
h533_states.py 2,6,10 (h482) |
same | 118 all pass; S 90/90; NEG 118/118 | 3.1 s |
h533_states.py 2,2,6 (h482) --sym; 2,2,4 (h451) --sym; 4,6,10 (h451, h471, h482); constrained (h482c) on 2,2,2 / 2,4,6; exit code 1 at the end because a named file h482c…2_2_6_s1 did not exist |
same | 145, 56, 41 (13 inputs without sign field skipped), 51, 66 states all pass; S 111/111, 42/42, 11/11, 30/30, 38/38 | < 2 s each |
h533_states.py 2,2,6 (h482c s2) |
same, case (ii)\(_z\) | 54 pass; S 41/41; L6 facts 41/41 | 0.3 s |
h534_sample.py 4,2,6 3 60 900 |
pre-flight, own odd samples | 3 SAT | 1.1 s |
h534_sample.py 4,2,6 120 280 901 |
own odd samples (T2 + sign + odd, random type assumptions) | 84 SAT, 36 UNSAT, 0 TIMEOUT | 9.7 s |
h533_states.py 4,2,6 (own) --sym |
full battery on own states | 87 states all pass; S 77/77; NEG 87/87, 42/87 | < 2 s |
h534_sample.py 3,3,3 3 60 902; 3,3,3 40 200 903 |
non-member samples for Th 19 | 3; 39 SAT | 1.1 s; 2.1 s |
h534_sample.py 4,3,3 3 60 904 (6 assumptions); 4,3,3 30 200 905 2 |
non-member samples | 0 SAT (3 UNSAT); 14 SAT, 16 UNSAT, 11 distinct | 1.7 s; 51.9 s |
h533_states.py 3,3,3 (own; first run crashed on an unlabelled slack, script fixed) |
Th 19, U, joint system on a cubic cell | 42 states: U, joint system, Th 19, L4 all pass; NEG 42/42 | 0.3 s |
h533_states.py 4,3,3 (own) |
Th 19 on a cell with a coprime pair | 11 states all pass; NEG 11/11 | 0.1 s |
h535_l7.py 2,2,2 120 |
L7: 6 ordered mixed pairs, 6 controls without the third type, 3 equal-pair controls | 6 UNSAT, 9 SAT, models re-checked | 1.2 s |
h535_l7.py C 280, C = 2,4,6 / 4,2,6 / 2,6,10 |
same | 0 deviations each | 1.3, 1.3, 2.4 s |
h535_l7.py 4,6,10 280 |
same, thick member | 0 deviations | 8.0 s |
h536_breakS.py 2,2,2 120 (three runs while the controls were designed) |
Statement S: odd + sign + three types on A and B + ‘sets of constant profiles differ’ | Q UNSAT; C1, C3 (×3), C5 SAT with exact labels matching the encoding | 0.6 s each |
h536_breakS.py C 280, C = 2,4,6 / 4,2,6 / 2,2,6 (one loop) |
same | Q UNSAT on all three (37.2, 41.8, 1.9 s); all controls SAT; C2 and C4 UNSAT (no expectation) | 57.3, 68.2, 6.6 s |
h537_constsets.py on saved states of 4 cells |
encoding control: are there states whose sets of constant profiles differ? | yes, only in states with two types per sublattice | 2 s |
h538_mprime.py 2,2,2 120 |
M′ at extent 2 (type model), 6 queries + 12 controls | 6 UNSAT, 12 SAT | 0.9 s |
h538_mprime.py C 250, C = 2,4,6 / 4,2,6 / 2,6,10 (one loop) |
same | 0 deviations each | 10.0, 10.0, 62.0 s |
h539_classtable.py |
the L7 class table for all four B classes | every group is \(\pm b^c_x\) | < 1 s |
Totals
- Part I. Theorem 16 was checked on 16 cells × 3 axes and Theorem 17 on 16 cells, all equal to the formulas: (1,1,1), (1,1,2), (1,1,5), (1,2,3), (2,2,2), (2,2,4), (2,2,6), (2,3,3), (3,3,3), (2,4,6), (4,3,3), (6,2,3), (5,2,4), (4,4,4), (4,4,6) and (2,6,10). These include thin cells, cells with a coprime pair, cubic cells and members.
- Theorem 19. It holds exactly, with its constants, on 837 odd states: 784 on seven members and 53 on (3,3,3) and (4,3,3). Reversing all six shifts makes it fail on 773 of the 837; reversing only the \(y\)-shifts makes it fail on 379 (it cannot fail where the \(U\)-functions are constant, as in every constrained case-(ii) state).
- Part II. On 784 odd states of seven members, 87 of them sampled by me on (4,2,6):
- Theorem U, the joint system, L1 (one sign per line, and \(n_k\) 8-periodic), L2 and L4 have 0 failures;
- 574 states have three types, with labels equal on A and B and axis \(k\) one-way in all 574 (Statement S);
- L0 holds in 1,148 of 1,148 sublattice cases, and L3 in 1,140 of 1,140 two-way cases;
- the L5 facts (\(F_\pm\), \(U_\pm\) or \(W_\pm\) constant as appropriate) hold in 462 of 462 case-(i) states, and the L6 facts (\(\sigma_k\) constant and equal on A and B) in 112 of 112 case-(ii) states.
- Solver. L7 is UNSAT for all six ordered pairs on five members, with controls SAT. The search for a counterexample to Statement S is UNSAT on four members, and the encoding controls are SAT. No query hit its cap; no result is ‘no verdict’.
Observations
These are not needed for the verdicts.
- C4. ‘The sets of constant profiles differ, three types on A and on B’, without requiring oddness, is UNSAT on (2,2,2), (2,4,6), (4,2,6) and (2,2,6), with the sign field in the model. So case equality does not use oddness beyond M′.
- C2. ‘The sets differ’ with oddness but with no condition on types is also UNSAT on all four cells. So on these cells even an odd state with an empty axis has the same set of constant profiles on A and B. Different slack vectors can still occur, as twochain reported.
- Cubic cells. On (3,3,3), all 38 sampled odd states with three types had the same slack vector on A and B.
4. Corrections and gaps
- (dfour §2.10, ‘Which members’). ‘In L7 the planes \(z_0\pm2\) may coincide (extent 2 along \(z\), 8 planes)’ is false. On every member \(4c \ge 8\), and \(z_0 + 2 \not\equiv z_0 - 2\). The statement is not used.
- (dfour §2.4, the remark). ‘\(\sigma_k^S = 0\) on that plane (L1)’: L1 is not needed, since \(|\sigma_k| \le a_k\) always.
- (dfour L5b). The constancy of the \(y\)-part of \(\sigma^B_x\) (in (ii)\(_z\)), and of the \(z\)-part (in (ii)\(_y\)), is derived but not used. The contradiction follows from \(|\sigma^B_z| = \tfrac12\) (respectively \(|\sigma^B_y| = \tfrac12\)) alone. This is a simplification, not an error.
- (dfour §2.11). The flux identity is not needed. The curl note defines zero flux as equal numbers of \(+\) and \(-\) moments on each axis of each sublattice, which excludes a one-way axis with a vertex at once.
- (note, after Theorem 17). ‘No constant on a sublattice occurs’ should say that no constant on one sublattice alone (no \(\sigma_v\) term, unlike (C)) occurs. A constant vector field on all vertices is a solution and a sum of currents, for example \(e_x = \tfrac12\sum_{C\in\{0,2\}\cup\{1,3\}}\tfrac12u_C\mathbf 1_C\).
- (note, after Theorem 19). ‘Their sum on A is \(2F_{01}(x)+2U_{02}(y)+2W_{03}(z)\) up to a constant’: the identity is exact, with no constant.
- (note, Theorem 16 proof; wording). The case \(M=0\) is written for both families of \(y\). The case of both families of \(z\) (\(\lambda_0 = \lambda_3\), \(\lambda_1 = \lambda_2\)) is the same and should be named.
- (dfour L6, simplification). The inversion is not needed in L6: with \(F_\pm\) and \(U_\pm\) constant, (B) gives \(\sigma^B_z = \sigma^A_z\).
No gap.
5. What I could not check
- Dependencies taken from the record. Theorem U on the family and Theorem P were taken as given (check8). Theorem M′ was taken from the record: at extent 2 I tested it by solver only (h538), I did not prove it, and the note’s own caveat stands. (C), Lemma A, Theorem P of the curl note, the flux identity, and Lemma 4 were read but not re-proved; Lemma 4’s proof is short and was read line by line.
- The corpus figures in the note. The 1,357 corpus states and the ‘86 of 1,357’ figure were not recomputed.
- Real states in the special case of Theorem 21. None exist (check8, C3); not relevant here.
6. Rules
- Wrong Python, once. I once used the system
python3(not the.venv) for a text substitution in my own new script h536. No computation was run with it. - Worst-case run length. Two shell loops ran three solver batches in sequence, with caps summing to more than ten minutes: h536 (3 × 280 s) and h538 (3 × 250 s). They actually took 132 s and 82 s. The pre-flight for h536 was on (2,2,2) only (0.6 s), which under-predicted (2,4,6) by a factor of about 100. Each batch was a single solver process, one at a time.
- Edits to my own new scripts. I edited h536 with
sed -iand the Edit tool. No existing file was modified or deleted. Git was not touched. - Other rules.
- One attempt to run
pswas refused by the sandbox (harmless). - No heredocs, no
python -, and nothing written to /tmp; states and this report are in<repo>/.tmp. - cubethree’s scripts and report were not read, run or touched.
- No query of the form ‘odd and all six directions’, or equivalent to Theorem H, was run. The Statement S search asks for different sets of constant profiles on A and B, which is a condition on types.
- One attempt to run