Introduction
Throughout, K K K is algebraically closed of characteristic zero. We write M n = M n ( K ) M_n=M_n(K) M n = M n ( K ) and s l n = s l n ( K ) \mathfrak{sl}_n=\mathfrak{sl}_n(K) sl n = sl n ( K ) . For a polynomial f f f in m m m original variables, let
Val n ( f ) = { f ( A 1 , … , A m ) : A i ∈ M n } \operatorname{Val}_n(f)=\{f(A_1,\ldots,A_m): A_i \in M_n\} Val n ( f ) = { f ( A 1 , … , A m ) : A i ∈ M n }
be its set of single values, and write S f = Val n ( f ) S_f=\operatorname{Val}_n(f) S f = Val n ( f ) . No linear span or Zariski closure is taken in this notation. An ordinary multilinear polynomial uses each of its m m m distinct original variables exactly once in every word. It is proper if substituting 1 1 1 for any variable gives zero in the free algebra, equivalently if it is invariant under adding a scalar to any input. Let J J J denote the two-sided commutator ideal of the unital free associative algebra.
The L’vov–Kaplansky conjecture predicts that the actual image of an ordinary multilinear polynomial on M n M_n M n is one of { 0 } \{0\} { 0 } , K I n K I_n K I n , s l n \mathfrak{sl}_n sl n , and M n M_n M n (see [2 ] ). We studied the quartic case by repeated-input restrictions in [5 ] . Tang gives a quartic classification in [9 Theorem 1.1] . In [6 Theorem A] , we classify the images in degrees four through six, starting with proper sextics.
Here we fix the second commutator layer and allow arbitrary degree. For n ≥ 3 n \ge3 n ≥ 3 we determine the images and construct local fibers for proper multilinear polynomials in J 2 ∖ J 3 J^2 \setminus J^3 J 2 ∖ J 3 .
Theorem 1.1 (The proper second layer in every size at least three). Let f f f be an ordinary proper multilinear polynomial in m m m distinct original variables, and suppose f ∈ J 2 ∖ J 3 f \in J^2 \setminus J^3 f ∈ J 2 ∖ J 3 . For every fixed n ≥ 3 n \ge3 n ≥ 3 its actual image is
Val n ( f ) = { s l n ( K ) , tr f is identically zero on M n ( K ) m , M n ( K ) , tr f is not identically zero on M n ( K ) m . \operatorname{Val}_n(f)=
\begin{cases}
\mathfrak{sl}_n(K), & \operatorname{tr} f \text{ is identically zero on } M_n(K)^m,\\
M_n(K), & \operatorname{tr} f \text{ is not identically zero on } M_n(K)^m.
\end{cases} Val n ( f ) = { sl n ( K ) , M n ( K ) , tr f is identically zero on M n ( K ) m , tr f is not identically zero on M n ( K ) m . Put h = tr f h=\operatorname{tr} f h = tr f and g = f − n − 1 h I n g=f-n^{-1}hI_n g = f − n − 1 h I n . There is an input a ∈ M n m a \in M_n^m a ∈ M n m with f ( a ) = N f(a)=N f ( a ) = N , rank N = 1 \operatorname{rank}N=1 rank N = 1 and N 2 = 0 N^2=0 N 2 = 0 , such that
rank ( d g a ) = n 2 − 1 , h ∣ g − 1 ( N ) ≠ 0 in O g − 1 ( N ) , a if h ≢ 0. \operatorname{rank}(d g_a)=n^2-1,\qquad h|_{g^{-1}(N)}\ne0\text{ in }\mathcal{O}_{g^{-1}(N),a}\quad\text{if }h\not\equiv0. rank ( d g a ) = n 2 − 1 , h ∣ g − 1 ( N ) = 0 in O g − 1 ( N ) , a if h ≡ 0. At this input the map to s l n \mathfrak{sl}_n sl n is smooth with local fiber dimension m n 2 − n 2 + 1 mn^2-n^2+1 m n 2 − n 2 + 1 if h = 0 h=0 h = 0 . If h ≠ 0 h\ne0 h = 0 , the map to M n M_n M n is flat with local complete-intersection fiber of dimension m n 2 − n 2 mn^2-n^2 m n 2 − n 2 .
These assertions hold for f + R f+R f + R for every proper ordinary multilinear R ∈ J 3 R\in J^3 R ∈ J 3 in the same variables. The trace and the input a a a are taken for the complete polynomial f + R f+R f + R .
The proof uses complete restrictions to two active variables. § 6 treats a nonzero restriction with one common passive matrix. If all such restrictions vanish, Id ( U T 3 ) = J 3 \operatorname{Id}(UT_3)=J^3 Id ( U T 3 ) = J 3 (see [3 Theorem 2.1] ) gives a nonzero pair of symbols with independent diagonal passive matrices. § 7 treats that pair in an étale chart of the original source. The alternating polynomial s 4 s_4 s 4 belongs to this second case.
The two local conditions in Theorem 1.1 hold at the same original input. If the restriction has nonzero trace, its full differential is surjective at a rank-one square-zero input. If h ≠ 0 h\ne0 h = 0 and its restriction is zero, the first nonzero term in the transverse expansion of h h h gives a bilinear test on the two full active matrices. Theorems 6.2 and 7.2 give a nilpotent input at which this test is nonzero and the traceless differential along the restriction is surjective. Solving g = N g=N g = N in those tangent directions leaves the transverse variables unchanged. The selected term therefore survives on the exact fiber g − 1 ( N ) g^{-1}(N) g − 1 ( N ) (see Section 6.4 and Proposition 7.14). A correction in J 3 J^3 J 3 can change this term even though it vanishes on the restriction. The input is selected after the correction is included in h h h . The local-image criterion of § 2 then gives the stated sets of values.
§ 3 gives coordinates for the proper second quotient and the vanishing lemma for restrictions with few active variables. § 4 constructs the one-order operators. § 5 gives the size-three two-symbol construction and its traceful extension to larger sizes. § 6 and § 7 treat the common-background and independent-diagonal restrictions, respectively. § 8 formulates the remaining local-fiber questions and relates them to the higher-degree results in [6 , 7 , 8 ] .
Local fibers and actual images
A single local condition for arbitrary degree
For noncentral-valued f f f define the target vector space
V f = { s l n ( K ) , tr f = 0 , M n ( K ) , tr f ≠ 0. V_f=
\begin{cases}
\mathfrak{sl}_n(K), & \operatorname{tr}f=0,\\
M_n(K), & \operatorname{tr}f\ne0.
\end{cases} V f = { sl n ( K ) , M n ( K ) , tr f = 0 , tr f = 0.
Interior and closure in the next theorem use the Zariski topology on V f V_f V f .
Theorem 2.1 (Local characterization). Let f f f be noncentral-valued and multilinear. With N = E 12 N=E_{12} N = E 12 ,
S f = V f ⟺ N ∈ Int V f ( S f ) ⟺ N ∉ V f ∖ S f ‾ V f . S_f=V_f \Longleftrightarrow N\in\operatorname{Int}_{V_f}(S_f)\Longleftrightarrow N\notin\overline{V_f\setminus S_f}^{\,V_f}. S f = V f ⟺ N ∈ Int V f ( S f ) ⟺ N ∈ / V f ∖ S f V f .
Consequently L K LK L K , for this field class and all degrees and sizes, is equivalent to the middle condition for every noncentral-valued f f f . Moreover, N ∈ S f N\in S_f N ∈ S f already holds for every such f f f ; the issue is coverage of a neighborhood, not merely the existence of a nilpotent value.
Proof. First note that S f S_f S f is invariant under conjugation and multiplication by nonzero scalars, and contains zero. If tr f ≠ 0 \operatorname{tr} f \ne0 tr f = 0 , then K I n ⊆ S f K I_n \subseteq S_f K I n ⊆ S f . To see this, choose Weyl matrices U , V U,V U , V with U V = q V U UV=qVU U V = q V U , U n = V n = I U^n=V^n=I U n = V n = I , where q q q is a primitive n n n th root. The U a V b U^aV^b U a V b form a basis, and only its degree-zero element has nonzero trace. Expand a nonzero-trace evaluation multilinearly in that basis. Some basis tuple has nonzero output trace. All words at this tuple have the same total ( Z / n Z ) 2 (\mathbb{Z}/n\mathbb{Z})^2 ( Z / n Z ) 2 degree, so their sum is a multiple of one basis element. It must be a nonzero multiple of I I I . Scaling one input gives all scalars. If tr f ≡ 0 \operatorname{tr} f \equiv0 tr f ≡ 0 , the only scalar in V f V_f V f is zero, already in S f S_f S f .
Here is the elementary degeneration underlying the result. Every nonscalar W W W has a similar representative ( u v w Z ) \left(\begin{smallmatrix} u & v \\ w & Z \end{smallmatrix}\right) ( u w v Z ) with v ≠ 0 v \ne0 v = 0 . For otherwise every row covector would be a left eigenvector, forcing W W W to be scalar. The polynomial curve
R ( t ) = ( t u v t 2 w t Z ) = t ( t − 1 0 0 I ) W ( t 0 0 I ) ( t ≠ 0 ) R(t)=\begin{pmatrix}tu&v\\t^2w&tZ\end{pmatrix}
=t\begin{pmatrix}t^{-1}&0\\0&I\end{pmatrix}W\begin{pmatrix}t&0\\0&I\end{pmatrix}\qquad(t\ne0) R ( t ) = ( t u t 2 w v tZ ) = t ( t − 1 0 0 I ) W ( t 0 0 I ) ( t = 0 )
has nonzero rank-one square-zero limit R ( 0 ) R(0) R ( 0 ) , conjugate to N N N . If W ∈ s l n W\in\mathfrak{sl}_n W ∈ sl n , the whole curve lies in s l n \mathfrak{sl}_n sl n . Suppose an open neighborhood O O O of N N N in V f V_f V f lies in S f S_f S f . After a fixed conjugation the curve passes through N N N . Its inverse image of O O O is an open subset of A 1 \mathbb{A}^1 A 1 containing zero, hence contains some nonzero t t t . Conjugation and scalar invariance now give W ∈ S f W\in S_f W ∈ S f . The scalar discussion completes S f = V f S_f=V_f S f = V f . The reverse implication and the closure formulation are immediate from the definition of interior. Central-valued polynomials have image either zero or K I n K I_n K I n by multilinearity, so the asserted equivalence with LK follows.
Finally, a nonscalar value has, after conjugation, a nonzero off-diagonal entry. Expand its inputs in matrix units. Some matrix-unit tuple gives an output with a nonzero off-diagonal entry. Regard these units as directed edges. Any nonzero word is an Euler trail using the same edges. An open trail has uniquely determined initial and terminal vertices, so every nonzero word in this tuple is a multiple of the same off-diagonal unit. The output is therefore a nonzero multiple of E i j E_{ij} E ij , i ≠ j i\ne j i = j . Scaling and conjugation give N N N itself. □
This argument is independent of degree, properness, and a chosen coefficient family. We use it as a characterization and make no priority claim for the local reformulation. The proof also applies to a restricted evaluation domain whenever its image has the stated conjugation and scalar invariance, and all the required scalar targets have separately been obtained.
Corollary 2.2 (Two sufficient certificates). Let d = dim V f d=\dim V_f d = dim V f and q = m n 2 q=mn^2 q = m n 2 . Either of the following suffices for S f = V f S_f=V_f S f = V f :
There is a ∈ f − 1 ( N ) a\in f^{-1}(N) a ∈ f − 1 ( N ) with rank ( d f a : M n m → V f ) = d \operatorname{rank}(df_a:\mathbb{M}_n^m\to V_f)=d rank ( d f a : M n m → V f ) = d .
There is a ∈ f − 1 ( N ) a\in f^{-1}(N) a ∈ f − 1 ( N ) with
dim O f − 1 ( N ) , a = q − d . \dim O_{f^{-1}(N),a}=q-d. dim O f − 1 ( N ) , a = q − d . In particular the required fiber dimension is ( m − 1 ) n 2 (m-1)n^2 ( m − 1 ) n 2 in the traceful case and ( m − 1 ) n 2 + 1 (m-1)n^2+1 ( m − 1 ) n 2 + 1 in the trace-zero case.
Proof. The first condition makes f f f smooth at a a a . Smooth morphisms are open [11 ] ; restricting to the smooth locus produces the neighborhood required in Theorem 2.1 . For the second, the local rings of source and target at these closed points are regular of dimensions q , d q,d q , d . The source is Cohen–Macaulay, so the displayed dimension equality implies flatness by miracle flatness [12 ] . The flat locus is open [13 ] , and flat morphisms locally of finite presentation are open [14 ] . Apply Theorem 2.1 again. Over algebraically closed K K K , a nonempty fiber of a finite-type scheme over a K K K -point has a K K K -point, so this yields actual matrix evaluations. □
The first condition implies the second, but neither is claimed necessary for polynomial surjectivity. In particular, generic full rank only proves dominance; it does not locate an open image neighborhood at N N N . The distinction is real even for invariant constructible cones: { 0 } ∪ { A : det A ≠ 0 } \{0\}\cup\{A:\det A\ne0\} { 0 } ∪ { A : det A = 0 } is dense, contains every scalar, and omits N N N . It is an illustration of the logical issue, not a claimed polynomial image.
The rank-one attainment used in Theorem 2.1 is already in Kanel-Belov–Malev–Rowen: see Lemma 5 on p. 6 of arXiv:1005.0191v3, the author version cited in [15 ] , and its explicit restatement for arbitrary n n n in Lemma 2 on p. 2 of arXiv:1306.4389v3 [16 ] . These locators refer to the specified preprint versions.
Higher-order trace on a smooth traceless fiber
Proposition 2.3 (Exact local trace criterion). Let f : M n m → M n f:M_n^m\to M_n f : M n m → M n be multilinear, let h = tr f h=\operatorname{tr}f h = tr f and g = f − n − 1 h I g=f-n^{-1}hI g = f − n − 1 h I . Suppose f ( a ) = N f(a)=N f ( a ) = N is nonzero rank-one square-zero and rank ( d g a ) = n 2 − 1 \operatorname{rank}(dg_a)=n^2-1 rank ( d g a ) = n 2 − 1 . Put Y = g − 1 ( N ) Y=g^{-1}(N) Y = g − 1 ( N ) and Q = m n 2 Q=mn^2 Q = m n 2 . The following conditions are equivalent:
h ∣ Y ≠ 0 h|_Y\ne0 h ∣ Y = 0 in O Y , a \mathcal{O}_{Y,a} O Y , a ;
dim O f − 1 ( N ) , a = Q − n 2 \dim\mathcal{O}_{f^{-1}(N),a}=Q-n^2 dim O f − 1 ( N ) , a = Q − n 2 ;
f f f is flat at a a a .
Each implies Val n ( f ) = M n \operatorname{Val}_n(f)=M_n Val n ( f ) = M n . In formal local coordinates on Y Y Y , a nonzero leading term of any positive weighted degree suffices for (1). No upper bound on the order of the first nonzero term is asserted.
Proof. The rank assumption makes Y Y Y smooth at a a a , with regular local domain R = O Y , a R=\mathcal{O}_{Y,a} R = O Y , a of dimension Q − n 2 + 1 Q-n^2+1 Q − n 2 + 1 . Since h ( a ) = 0 h(a)=0 h ( a ) = 0 , its restriction lies in the maximal ideal. If it is nonzero, it is a nonzerodivisor and dim R / ( h ) = Q − n 2 \dim R/(h)=Q-n^2 dim R / ( h ) = Q − n 2 . If it is zero, the dimension stays Q − n 2 + 1 Q-n^2+1 Q − n 2 + 1 . Since f − 1 ( N ) f^{-1}(N) f − 1 ( N ) is cut out in Y Y Y by h = 0 h=0 h = 0 , this proves (1)⇔ \Leftrightarrow ⇔ (2). Miracle flatness proves (2)⇒ \Rightarrow ⇒ (3), and the dimension formula for flat local maps gives the converse. Corollary 2.2 proves surjectivity. Completion is faithfully flat, so a nonzero formal leading term detects a nonzero element of R R R . □
This is the local-ring form of the higher-order mechanism. The compatible algebraic degeneration tools in Glazer–Hendel [10 Proposition 2.10 and Corollaries 2.12–2.15] provide a framework for proving flatness from weighted initial maps. In the present one-equation fiber problem, the preceding elementary argument suffices; no convolution or Waring decomposition is needed.
For clarity, the corrected higher terms can be defined recursively. Let K a = ker d g a K_a=\ker dg_a K a = ker d g a and choose a linear right inverse R a : s l n → T a ( M n m ) R_a:\mathfrak{sl}_n\to T_a(M_n^m) R a : sl n → T a ( M n m ) of d g a dg_a d g a . The formal implicit function construction gives unique homogeneous maps v r : K a → s l n v_r:K_a\to\mathfrak{sl}_n v r : K a → sl n of degree r ≥ 2 r\ge2 r ≥ 2 such that
ϕ ( u ) = a + u + R a ∑ r ≥ 2 v r ( u ) , g ( ϕ ( u ) ) = N . \phi(u)=a+u+R_a\sum_{r\ge2}v_r(u),\qquad g(\phi(u))=N. ϕ ( u ) = a + u + R a r ≥ 2 ∑ v r ( u ) , g ( ϕ ( u )) = N .
They are obtained by
v r ( u ) = − [ degree r ] ( g ( a + u + R a ∑ 2 ≤ j < r v j ( u ) ) − N ) . v_r(u)=-[\text{degree }r]\left(\,g\left(a+u+R_a\sum_{2\le j<r}v_j(u)\right)-N\right). v r ( u ) = − [ degree r ] ( g ( a + u + R a 2 ≤ j < r ∑ v j ( u ) ) − N ) .
The trace germ to test is H ( u ) = h ( ϕ ( u ) ) H(u)=h(\phi(u)) H ( u ) = h ( ϕ ( u )) , not h ( a + u ) h(a+u) h ( a + u ) . If d h a = 0 dh_a=0 d h a = 0 , its first two possibly nonzero homogeneous terms are
H 2 ( u ) = 1 2 d 2 h a ( u , u ) , H_2(u)=\frac{1}{2}d^2h_a(u,u), H 2 ( u ) = 2 1 d 2 h a ( u , u ) ,
H 3 ( u ) = 1 6 d 3 h a ( u , u , u ) − 1 2 d 2 h a ( u , R a d 2 g a ( u , u ) ) . H_3(u)=\frac{1}{6}d^3h_a(u,u,u)-\frac{1}{2}d^2h_a\left(u,R_a d^2g_a(u,u)\right). H 3 ( u ) = 6 1 d 3 h a ( u , u , u ) − 2 1 d 2 h a ( u , R a d 2 g a ( u , u ) ) .
Thus an uncorrected cubic derivative cannot in general certify the trace on the fiber. For positive weights on u u u , a nonzero initial form of H H H certifies Proposition 2.3 . If the entire germ is zero, this particular seed is not flat; this does not rule out another seed or surjectivity by another construction.
Coordinates in the second layer
Coordinates on the proper second layer
Let A = K ⟨ x 1 , … , x m ⟩ A=K\langle x_1,\ldots,x_m\rangle A = K ⟨ x 1 , … , x m ⟩ be the unital free associative algebra, J J J its two-sided commutator ideal, and P m P_m P m its multilinear component. Write P m p r o p \mathcal{P}^{\mathrm{prop}}_m P m prop for the proper subspace, consisting of polynomials killed by every unit deletion. All quotients in this subsection are free-algebra quotients; no matrix-identity ideal is imposed. Put
Q m p r o p = J 2 ∩ P m p r o p J 3 ∩ P m p r o p . \mathcal{Q}^{\mathrm{prop}}_m=\frac{J^2\cap\mathcal{P}^{\mathrm{prop}}_m}{J^3\cap\mathcal{P}^{\mathrm{prop}}_m}. Q m prop = J 3 ∩ P m prop J 2 ∩ P m prop .
For a subset S ⊆ [ m ] S\subseteq[m] S ⊆ [ m ] of size at least two, set a = min S a=\min S a = min S and, for j ∈ S ∖ { a } j\in S\setminus\{a\} j ∈ S ∖ { a } , define the left-normed comb
b S , j = [ x j , x a , x i 1 , … , x i ∣ S ∣ − 2 ] , i 1 < ⋯ < i ∣ S ∣ − 2 , { i 1 , … , i ∣ S ∣ − 2 } = S ∖ { a , j } . b_{S,j}=[x_j,x_a,x_{i_1},\ldots,x_{i_{|S|-2}}],\qquad i_1<\cdots<i_{|S|-2},\qquad\{i_1,\ldots,i_{|S|-2}\}=S\setminus\{a,j\}. b S , j = [ x j , x a , x i 1 , … , x i ∣ S ∣ − 2 ] , i 1 < ⋯ < i ∣ S ∣ − 2 , { i 1 , … , i ∣ S ∣ − 2 } = S ∖ { a , j } .
Proposition 3.1. For m ≥ 4 m\geq4 m ≥ 4 , the classes
b S , j b S c , ℓ , ∣ S ∣ , ∣ S c ∣ ≥ 2 , j ∈ S ∖ { min S } , ℓ ∈ S c ∖ { min S c } , b_{S,j}b_{S^c,\ell},\qquad|S|,|S^c|\geq2,\qquad j\in S\setminus\{\min S\},\qquad\ell\in S^c\setminus\{\min S^c\}, b S , j b S c , ℓ , ∣ S ∣ , ∣ S c ∣ ≥ 2 , j ∈ S ∖ { min S } , ℓ ∈ S c ∖ { min S c } , form a basis of Q m p r o p \mathcal{Q}^{\mathrm{prop}}_m Q m prop . In particular its ordered-bipartition components are independent, and
D m : = dim Q m p r o p = ∑ p = 2 m − 2 ( m p ) ( p − 1 ) ( m − p − 1 ) D_m:=\dim\mathcal{Q}^{\mathrm{prop}}_m=\sum_{p=2}^{m-2}\binom{m}{p}(p-1)(m-p-1) D m := dim Q m prop = p = 2 ∑ m − 2 ( p m ) ( p − 1 ) ( m − p − 1 ) = 2 m − 2 ( m 2 − 5 m + 4 ) + 2 m − 2. (1) =2^{m-2}(m^2-5m+4)+2m-2. \tag*{(1)} = 2 m − 2 ( m 2 − 5 m + 4 ) + 2 m − 2. (1)
Proof. We first compute the dimension without assuming independence of the proposed products. Use the multigrading by the occurrences of the original letters, and put
s = t 1 + ⋯ + t m , C = ∏ i = 1 m ( 1 − t i ) − 1 , H A = ( 1 − s ) − 1 , B = 1 + ( s − 1 ) C . s=t_1+\cdots+t_m,\qquad C=\prod_{i=1}^{m}(1-t_i)^{-1},\qquad H_A=(1-s)^{-1},\qquad B=1+(s-1)C. s = t 1 + ⋯ + t m , C = i = 1 ∏ m ( 1 − t i ) − 1 , H A = ( 1 − s ) − 1 , B = 1 + ( s − 1 ) C .
Order the letters. For each word w w w whose proper prefixes are nondecreasing but which is not itself nondecreasing, let g w = w − sort ( w ) g_w=w-\operatorname{sort}(w) g w = w − sort ( w ) . Its leading word in degree-lexicographic order is w w w . These leading words are prefix-free. Reduction at the first nonordered prefix decreases the order and terminates at the sorted representative. Therefore the g w g_w g w generate J J J as a right ideal. Prefix-freeness makes their right multiples have distinct leading words, proving
J = ⨁ w g w A , ∑ w t deg w = H J / H A = B . J=\bigoplus_w g_wA,\qquad\sum_w t^{\deg w}=H_J/H_A=B. J = w ⨁ g w A , w ∑ t d e g w = H J / H A = B .
Because J r − 1 J^{r-1} J r − 1 is also a left ideal, the same decomposition gives J r = ⨁ w g w J r − 1 J^r=\bigoplus_w g_wJ^{r-1} J r = ⨁ w g w J r − 1 . Consequently
H J r = B r H A , H J r / J r + 1 = B r C . H_{J^r}=B^rH_A,\qquad H_{J^r/J^{r+1}}=B^rC. H J r = B r H A , H J r / J r + 1 = B r C .
On a nonempty squarefree support of size p p p , the coefficient of B B B is p − 1 p-1 p − 1 , and its constant coefficient is zero.
The PBW decomposition orders the original generators before a basis of the derived free Lie algebra. It expresses A A A as the vector-space tensor product of sorted commutative monomials and the proper algebra. This decomposition respects each J r J^r J r . Indeed, the derivations ∂ i ( x j ) = δ i j \partial_i(x_j)=\delta_{ij} ∂ i ( x j ) = δ ij preserve J J J , hence every J r J^r J r ; on a multilinear component they are unit deletions. Successive coefficient extraction uses these derivations and the projections f ↦ f − x i ∂ i f f\mapsto f-x_i\partial_i f f ↦ f − x i ∂ i f , as well as multiplication by original generators, all of which preserve the ideal filtration. Thus removing the sorted singleton factors divides the squarefree exponential generating series by e x e^x e x . Since the squarefree series of B B B is
B ( x ) = ∑ p ≥ 2 ( p − 1 ) x p p ! = ( x − 1 ) e x + 1 , B(x)=\sum_{p\geq2}(p-1)\frac{x^p}{p!}=(x-1)e^x+1, B ( x ) = p ≥ 2 ∑ ( p − 1 ) p ! x p = ( x − 1 ) e x + 1 ,
the series for the proper second layer is B ( x ) 2 B(x)^2 B ( x ) 2 . Taking its x m / m ! x^m/m! x m / m ! coefficient gives both expressions in (1) .
It remains to prove spanning. The proper algebra is generated by nontrivial free Lie commutators, each a linear combination of combs. Modulo J 2 J^2 J 2 , Jacobi moves the least letter of a comb into its initial bracket. Later adjoint letters can be reordered: interchanging adjacent ones has an error of the form [ L , [ x , y ] ] [L,[x,y]] [ L , [ x , y ]] , a difference of two products of nontrivial commutators. The resulting one-factor normal forms are exactly b S , j b_{S,j} b S , j . Their classes are independent modulo J 2 J^2 J 2 : in U T 2 UT_2 U T 2 , set x j = E 12 x_j=E_{12} x j = E 12 and every other letter of S S S equal to diag ( 1 , 0 ) \operatorname{diag}(1,0) diag ( 1 , 0 ) . The selected comb is a nonzero multiple of E 12 E_{12} E 12 , and every other canonical comb begins with two equal diagonal inputs and vanishes. Since J 2 J^2 J 2 vanishes on U T 2 UT_2 U T 2 , this isolates every coefficient. Now express a proper element of J 2 J^2 J 2 as a sum of products of combs. After normalizing its one-factor terms, their canonical remainder must be zero by that independence. Modulo J 3 J^3 J 3 , only two-factor terms remain. Normalize each factor modulo J 2 J^2 J 2 ; its error multiplied by the other factor lies in J 3 J^3 J 3 . The displayed products therefore span. Their number is the first expression in (1), already proved to be the dimension, so they are a basis. □
Lemma 3.2 (Vanishing on common-background sources). If an ordinary multilinear polynomial lies in J r J^r J r , then its restriction with fewer than r r r active original slots and every other slot equal to one common matrix D D D is identically zero. The identity holds for every D D D , not just diagonal matrices, and all derivatives tangent to that linear source vanish.
Proof. Expand a member of J r J^r J r as a sum of products of r r r commutator-ideal factors with possible word contexts and take its original multihomogeneous component. The original variable sets in each term are disjoint. Fewer than r r r active variables leave one ideal factor with only passive inputs. It is evaluated in the commutative algebra K [ D ] K[D] K [ D ] and is zero. This proves an identity on the entire linear restriction, and differentiation within that restriction preserves zero. No assertion is made about transverse derivatives. □
Ordered symbols and smooth nilpotent values
Write H n = { A ∈ M n : A i i = 0 for every i } \mathcal{H}_n = \{A \in M_n : A_{ii} = 0 \text{ for every } i\} H n = { A ∈ M n : A ii = 0 for every i } for the hollow subspace in the fixed basis. Every traceless matrix is similar to a hollow matrix, by the prescribed-diagonal theorem of Fillmore [1 ] .
Ordered words and mixed differential depths
The fixed-depth hypothesis can be removed when the complete specialization has one order of its two active letters. The following statement does not require homogeneity.
Theorem 4.1. Let 0 ≠ F ( u , v , w ) = ∑ a r s t u r v s w t ∈ K [ u , v , w ] 0 \ne F(u,v,w) = \sum a_{rst}u^rv^sw^t \in K[u,v,w] 0 = F ( u , v , w ) = ∑ a r s t u r v s w t ∈ K [ u , v , w ] , and put
H F ( D , A , B ) = ∑ a r s t D r A D s B D t . H_F(D,A,B) = \sum a_{rst}D^rAD^sBD^t. H F ( D , A , B ) = ∑ a r s t D r A D s B D t . For n ≥ 3 n \ge3 n ≥ 3 , let V F \mathcal{V}_F V F be the union of the conjugates of H F ( D , A , B ) H_F(D,A,B) H F ( D , A , B ) , where D D D is regular diagonal and A , B ∈ H n A,B \in\mathcal{H}_n A , B ∈ H n . Then
V F = { M n ( K ) , F ( u , v , u ) ≠ 0 , s l n ( K ) , F ( u , v , u ) = 0. \mathcal{V}_F =
\begin{cases}
M_n(K), & F(u,v,u) \ne0, \\
\mathfrak{sl}_n(K), & F(u,v,u) = 0.
\end{cases} V F = { M n ( K ) , sl n ( K ) , F ( u , v , u ) = 0 , F ( u , v , u ) = 0. Proof. Suppose first that F ( u , v , u ) ≠ 0 F(u,v,u) \ne0 F ( u , v , u ) = 0 . Number the indices cyclically and put A = ∑ i E i , i − 1 A = \sum_i E_{i,i-1} A = ∑ i E i , i − 1 and D = diag ( d 1 , … , d n ) D = \operatorname{diag}(d_1,\ldots,d_n) D = diag ( d 1 , … , d n ) . Then
( H F ( D , A , B ) ) i j = F ( d i , d i − 1 , d j ) B i − 1 , j . (2) \left(H_F(D,A,B)\right)_{ij} = F(d_i,d_{i-1},d_j)B_{i-1,j}. \tag*{(2)} ( H F ( D , A , B ) ) ij = F ( d i , d i − 1 , d j ) B i − 1 , j . (2) Each F ( d i , d i − 1 , d i ) F(d_i,d_{i-1},d_i) F ( d i , d i − 1 , d i ) is a nonzero polynomial. Each F ( d i , d i − 1 , d i + 1 ) F(d_i,d_{i-1},d_{i+1}) F ( d i , d i − 1 , d i + 1 ) is also nonzero, since n ≥ 3 n \ge3 n ≥ 3 and its three indices are distinct. Choose D D D outside the zero set of the product of these polynomials and the differences d i − d j d_i-d_j d i − d j . The source coordinates B i − 1 , i B_{i-1,i} B i − 1 , i and B i − 1 , i + 1 B_{i-1,i+1} B i − 1 , i + 1 are distinct hollow coordinates. Equation (2) therefore realizes every matrix supported on the diagonal and the forward cyclic band, by one hollow B B B . Set the wrap entry to zero to obtain any upper Jordan form. This proves V F = M n \mathcal{V}_F = M_n V F = M n .
Now suppose that F ( u , v , u ) = 0 F(u,v,u) = 0 F ( u , v , u ) = 0 . Write F = ( u − w ) G F = (u-w)G F = ( u − w ) G , where G ≠ 0 G \ne0 G = 0 . The exact word identity
H F ( D , A , B ) = [ D , H G ( D , A , B ) ] H_F(D,A,B) = [D,H_G(D,A,B)] H F ( D , A , B ) = [ D , H G ( D , A , B )] shows that every value is traceless. For fixed diagonal D D D , this commutator is hollow. We show that every hollow target occurs. For a column j j j , the off-diagonal part of H G H_G H G is a linear function of the n − 1 n-1 n − 1 entries B k j B_{kj} B k j , k ≠ j k \ne j k = j . Its matrix, with row and column indices different from j j j , is
M i k ( j ) = { G ( d i , d k , d j ) A i k , i ≠ k , 0 , i = k . M_{ik}^{(j)} =
\begin{cases}
G(d_i,d_k,d_j)A_{ik}, & i \ne k, \\
0, & i = k.
\end{cases} M ik ( j ) = { G ( d i , d k , d j ) A ik , 0 , i = k , i = k .
For pairwise distinct i , k , j i,k,j i , k , j , the coefficient G ( d i , d k , d j ) G(d_i,d_k,d_j) G ( d i , d k , d j ) is nonzero. A derangement of the n − 1 ≥ 2 n-1 \ge2 n − 1 ≥ 2 indices contributes a nonzero monomial to det M ( j ) \det M^{(j)} det M ( j ) . Distinct derangements give distinct monomials in the independent entries A i k A_{ik} A ik , so they cannot cancel. Thus every det M ( j ) \det M^{(j)} det M ( j ) is a nonzero polynomial in D D D and hollow A A A . Their product with the differences d i − d j d_i-d_j d i − d j is nonzero. Choose one pair ( D , A ) (D,A) ( D , A ) where this product does not vanish. All column maps are then invertible simultaneously. Given T ∈ H n T \in\mathcal{H}_n T ∈ H n , prescribe the off-diagonal entries of H G H_G H G to be T i j / ( d i − d j ) T_{ij}/(d_i-d_j) T ij / ( d i − d j ) and solve these column systems for one hollow B B B . This gives H F ( D , A , B ) = T H_F(D,A,B)=T H F ( D , A , B ) = T . Every traceless matrix is similar to a hollow matrix, proving the second assertion. □
Corollary 4.2. Let 0 ≠ P ( s , t ) = ∑ p r s s r t s ∈ K [ s , t ] 0 \ne P(s,t)=\sum p_{rs}s^rt^s \in K[s,t] 0 = P ( s , t ) = ∑ p r s s r t s ∈ K [ s , t ] , and put
H P ( D , A , B ) = ∑ p r s ( a d D r A ) ( a d D s B ) . H_P(D,A,B)=\sum p_{rs}(ad_D^r A)(ad_D^s B). H P ( D , A , B ) = ∑ p r s ( a d D r A ) ( a d D s B ) . For n ≥ 3 n \ge3 n ≥ 3 , the union of the conjugates of its values with D D D regular diagonal and A , B ∈ H n A,B \in\mathcal{H}_n A , B ∈ H n is M n M_n M n if P ( s , − s ) ≠ 0 P(s,-s) \ne0 P ( s , − s ) = 0 , and is s l n \mathfrak{sl}_n sl n if P ( s , − s ) = 0 P(s,-s)=0 P ( s , − s ) = 0 . If P P P is homogeneous, these conditions are equivalent to P ( 1 , − 1 ) ≠ 0 P(1,-1) \ne0 P ( 1 , − 1 ) = 0 and P ( 1 , − 1 ) = 0 P(1,-1)=0 P ( 1 , − 1 ) = 0 , respectively.
Proof. Apply Theorem 4.1 to F ( u , v , w ) = P ( u − v , v − w ) F(u,v,w)=P(u-v,v-w) F ( u , v , w ) = P ( u − v , v − w ) . This substitution is injective, and F ( u , v , u ) = P ( u − v , v − u ) F(u,v,u)=P(u-v,v-u) F ( u , v , u ) = P ( u − v , v − u ) . □
An ordered symbol with nonzero trace specialization
Lemma 4.3 (An ordered symbol with nonzero trace specialization). Let h ( u , v , w ) = ∑ a , b , d h a b d u a v b w d ∈ K [ u , v , w ] h(u,v,w)=\sum_{a,b,d}h_{abd}u^av^bw^d \in K[u,v,w] h ( u , v , w ) = ∑ a , b , d h ab d u a v b w d ∈ K [ u , v , w ] satisfy h ( u , v , u ) ≠ 0 h(u,v,u)\ne0 h ( u , v , u ) = 0 . For n ≥ 3 n \ge3 n ≥ 3 , the morphism
H h : M n ( K ) × s l n ( K ) × s l n ( K ) ⟶ M n ( K ) , H h ( D , A , B ) = ∑ a , b , d h a b d D a A D b B D d , H_h:M_n(K)\times\mathfrak{sl}_n(K)\times\mathfrak{sl}_n(K)\longrightarrow M_n(K),\qquad H_h(D,A,B)=\sum_{a,b,d}h_{abd}D^a A D^b B D^d, H h : M n ( K ) × sl n ( K ) × sl n ( K ) ⟶ M n ( K ) , H h ( D , A , B ) = a , b , d ∑ h ab d D a A D b B D d , has a nonzero rank-one square-zero value at a point where its differential is onto M n ( K ) M_n(K) M n ( K ) .
Proof. For a diagonal D = diag ( d 1 , … , d n ) D=\operatorname{diag}(d_1,\ldots,d_n) D = diag ( d 1 , … , d n ) , entrywise multiplication gives
( H h ( D , A , B ) ) i ℓ = ∑ j = 1 n A i j B j ℓ h ( d i , d j , d ℓ ) . (3) \bigl(H_h(D,A,B)\bigr)_{i\ell}=\sum_{j=1}^{n}A_{ij}B_{j\ell}h(d_i,d_j,d_\ell). \tag*{(3)} ( H h ( D , A , B ) ) i ℓ = j = 1 ∑ n A ij B j ℓ h ( d i , d j , d ℓ ) . (3) Let D ⊆ K n \mathcal{D}\subseteq K^n D ⊆ K n be the open set defined by pairwise distinct d i d_i d i and
h ( d 1 , d j , d 1 ) ≠ 0 ( 2 ≤ j ≤ n ) . h(d_1,d_j,d_1)\ne0\qquad(2\le j\le n). h ( d 1 , d j , d 1 ) = 0 ( 2 ≤ j ≤ n ) . It is nonempty: each displayed factor is a nonzero polynomial by h ( u , v , u ) ≠ 0 h(u,v,u)\ne0 h ( u , v , u ) = 0 , and the product of these factors and the pairwise differences is nonzero in the polynomial ring K [ d 1 , … , d n ] K[d_1,\ldots,d_n] K [ d 1 , … , d n ] . Put q ^ = ( 0 , q 2 , … , q n ) t ≠ 0 \widehat{q}=(0,q_2,\ldots,q_n)^{\mathsf{t}}\ne0 q = ( 0 , q 2 , … , q n ) t = 0 , take A A A hollow, and set B = q ^ e 1 t B=\widehat{q}e_1^{\mathsf{t}} B = q e 1 t . Both A A A and B B B are traceless, and (3) becomes
H h ( D , A , B ) = t e 1 t , t i = ∑ j > 1 A i j q j h ( d i , d j , d 1 ) . (4) H_h(D,A,B)=te_1^{\mathsf{t}},\qquad t_i=\sum_{j>1}A_{ij}q_jh(d_i,d_j,d_1). \tag*{(4)} H h ( D , A , B ) = t e 1 t , t i = j > 1 ∑ A ij q j h ( d i , d j , d 1 ) . (4) Consider the parameter space
Z = { ( d , q , A ) : d ∈ D , q ∈ K n − 1 ∖ { 0 } , A i i = 0 , ∑ j > 1 A 1 j q j h ( d 1 , d j , d 1 ) = 0 } . \mathcal{Z}=\left\{(d,q,A):d\in\mathcal{D},\ q\in K^{n-1}\setminus\{0\},\ A_{ii}=0,\ \sum_{j>1}A_{1j}q_jh(d_1,d_j,d_1)=0\right\}. Z = { ( d , q , A ) : d ∈ D , q ∈ K n − 1 ∖ { 0 } , A ii = 0 , j > 1 ∑ A 1 j q j h ( d 1 , d j , d 1 ) = 0 } . The last equation is a nonzero linear functional of the hollow entries of A A A at every base point ( d , q ) (d,q) ( d , q ) : some q j q_j q j is nonzero, and all its possible h ( d 1 , d j , d 1 ) h(d_1,d_j,d_1) h ( d 1 , d j , d 1 ) factors are nonzero. Its kernel is therefore a vector bundle of hyperplanes over the irreducible base D × ( K n − 1 ∖ { 0 } ) \mathcal{D}\times(K^{n-1}\setminus\{0\}) D × ( K n − 1 ∖ { 0 }) . In particular, Z \mathcal{Z} Z is irreducible. Every point of Z \mathcal{Z} Z has t 1 = 0 t_1=0 t 1 = 0 , so its output in (4) is square-zero.
Fix a column ℓ > 1 \ell>1 ℓ > 1 . Varying the n − 1 n-1 n − 1 hollow entries B j ℓ B_{j\ell} B j ℓ , j ≠ ℓ j\ne\ell j = ℓ , gives outputs confined to column ℓ \ell ℓ , with column vectors equal to columns j ≠ ℓ j\ne\ell j = ℓ of
( M ℓ ) i j = A i j h ( d i , d j , d ℓ ) . (M_\ell)_{ij}=A_{ij}h(d_i,d_j,d_\ell). ( M ℓ ) ij = A ij h ( d i , d j , d ℓ ) .
These are legitimate variations in the full B B B -space s l n \mathfrak{sl}_n sl n . Simultaneous conjugation in all three original inputs is also a legitimate source direction. For its generator E 1 ℓ E_{1\ell} E 1 ℓ , the output derivative is
[ E 1 ℓ , t e 1 t ] = t ℓ E 11 − t e ℓ t . (5) [E_{1\ell},te_1^{\mathsf{t}}]=t_\ell E_{11}-te_\ell^{\mathsf{t}}. \tag*{(5)} [ E 1 ℓ , t e 1 t ] = t ℓ E 11 − t e ℓ t . (5)
Modulo matrices supported in the first column, this supplies − t -t − t in column ℓ \ell ℓ . Let Δ ℓ \Delta_\ell Δ ℓ be the determinant of the matrix obtained from M ℓ M_\ell M ℓ by replacing its ℓ \ell ℓ -th column by t t t . If Δ ℓ ≠ 0 \Delta_\ell\ne0 Δ ℓ = 0 , these n n n derivative directions span the entire ℓ \ell ℓ -th output column modulo the first column.
We show that Δ ℓ \Delta_\ell Δ ℓ is not identically zero on Z \mathcal{Z} Z . Specialize q ^ = e ℓ \widehat{q}=e_\ell q = e ℓ . Then the equation defining Z \mathcal{Z} Z reduces to A 1 ℓ = 0 A_{1\ell}=0 A 1 ℓ = 0 , and
t i = A i ℓ h ( d i , d ℓ , d 1 ) . t_i=A_{i\ell}h(d_i,d_\ell,d_1). t i = A i ℓ h ( d i , d ℓ , d 1 ) .
Choose a fixed-point-free permutation σ \sigma σ of [ n ] [n] [ n ] with σ ( 1 ) ≠ ℓ \sigma(1)\ne\ell σ ( 1 ) = ℓ . Such a permutation exists because n ≥ 3 n\ge3 n ≥ 3 : choose an n n n -cycle whose successor of 1 1 1 is an index outside { 1 , ℓ } \{1,\ell\} { 1 , ℓ } . The corresponding determinant term has the monomial
∏ i = 1 n A i , σ ( i ) . \prod_{i=1}^{n} A_{i,\sigma(i)}. i = 1 ∏ n A i , σ ( i ) .
It uses neither a diagonal entry of A A A nor the entry A 1 ℓ A_{1\ell} A 1 ℓ . Its coefficient, up to sign, is a product of nonzero polynomials in d d d . Indeed, in an ordinary column j ≠ ℓ j\ne\ell j = ℓ the factor is h ( d i , d j , d ℓ ) h(d_i,d_j,d_\ell) h ( d i , d j , d ℓ ) with i ≠ j i\ne j i = j . If i = ℓ i=\ell i = ℓ , this is the nonzero trace specialization h ( d ℓ , d j , d ℓ ) h(d_\ell,d_j,d_\ell) h ( d ℓ , d j , d ℓ ) . Otherwise i , j , ℓ i,j,\ell i , j , ℓ are distinct, and the factor is a copy of the nonzero polynomial h h h in three independent variables. In the replacement column ℓ \ell ℓ , the row i i i is neither ℓ \ell ℓ nor 1 1 1 , by the two conditions on σ \sigma σ . Its factor h ( d i , d ℓ , d 1 ) h(d_i,d_\ell,d_1) h ( d i , d ℓ , d 1 ) is again a copy of h h h in three independent variables. Different permutations give different monomials in the entries of A A A , so this term cannot cancel. Restricting a nonzero coefficient polynomial to the nonempty open set D D D cannot make it identically zero. This proves the required nonvanishing of Δ ℓ \Delta_\ell Δ ℓ on Z \mathcal{Z} Z .
It remains to control the first output column. At fixed D , B D,B D , B , the hollow A A A -variation E i j E_{ij} E ij with j > 1 j>1 j > 1 and i ≠ j i\ne j i = j has output
q j h ( d i , d j , d 1 ) E i 1 . (6) q_jh(d_i,d_j,d_1)E_{i1}. \tag*{(6)} q j h ( d i , d j , d 1 ) E i 1 . (6)
For i = 1 i=1 i = 1 choose j = 2 j=2 j = 2 . For each i > 1 i>1 i > 1 choose j ( i ) ∈ { 1 , i } j(i)\in\{1,i\} j ( i ) ∈ { 1 , i } , which is possible since n ≥ 3 n\ge3 n ≥ 3 . Each selected h h h factor is a nonzero polynomial: for i = 1 i=1 i = 1 this is the defining trace specialization, and for i > 1 i>1 i > 1 its three coordinates are distinct. Requiring these factors and the finitely many selected q j q_j q j to be nonzero gives a nonempty open subset of the base ( d , q ) (d,q) ( d , q ) . The hyperplane equation only constrains A A A , so its inverse image in Z \mathcal{Z} Z is nonempty and open.
This open set and all the nonempty opens { Δ ℓ ≠ 0 } \{\Delta_\ell\ne0\} { Δ ℓ = 0 } , 2 ≤ ℓ ≤ n 2\le\ell\le n 2 ≤ ℓ ≤ n , meet because Z \mathcal{Z} Z is irreducible. At a point of their intersection, (6) fills the first column, and the B B B -variations together with (5) fill every other column modulo it. Thus the full differential of H h H_h H h is onto M n M_n M n . Moreover, Δ ℓ ≠ 0 \Delta_\ell\ne0 Δ ℓ = 0 implies t ≠ 0 t\ne0 t = 0 , since its replacement column is t t t . The common value is therefore nonzero of rank one and square-zero. The variations of A A A need not preserve the hyperplane equation defining Z \mathcal{Z} Z ; they are variations in the original full source, as required.
Two-symbol nilpotent seeds
The complete shared-background two-symbol map on M 3 M_3 M 3
Let P , Q ∈ K [ s , t ] P,Q\in K[s,t] P , Q ∈ K [ s , t ] be homogeneous of the same degree d ≥ 2 d\ge2 d ≥ 2 , each divisible by s t st s t ; either may be zero. Define the actual three-input polynomial map
H P , Q ( D , X , Y ) = ∑ r + s = d P r s ( ad D r X ) ( ad D s Y ) + ∑ r + s = d Q r s ( ad D r Y ) ( ad D s X ) . (7) H_{P,Q}(D,X,Y)=\sum_{r+s=d}P_{rs}(\operatorname{ad}_{D}^{r}X)(\operatorname{ad}_{D}^{s}Y)+\sum_{r+s=d}Q_{rs}(\operatorname{ad}_{D}^{r}Y)(\operatorname{ad}_{D}^{s}X). \tag*{(7)} H P , Q ( D , X , Y ) = r + s = d ∑ P r s ( ad D r X ) ( ad D s Y ) + r + s = d ∑ Q r s ( ad D r Y ) ( ad D s X ) . (7)
Put
p = P ( 1 , − 1 ) , q = Q ( 1 , − 1 ) , ϵ = ( − 1 ) d , τ = p + ϵ q . p=P(1,-1),\qquad q=Q(1,-1),\qquad\epsilon=(-1)^d,\qquad\tau=p+\epsilon q. p = P ( 1 , − 1 ) , q = Q ( 1 , − 1 ) , ϵ = ( − 1 ) d , τ = p + ϵ q .
We retain this reverse-symbol convention throughout the proof. The next statement supplies smooth nilpotent points for every nonzero pair in size three.
Write E = s l 3 E=\mathfrak{sl}_3 E = sl 3 if τ = 0 \tau=0 τ = 0 and E = M 3 E=M_3 E = M 3 if $\tau\ne 0.
Theorem 5.1. The actual image of (7) on M 3 M_3 M 3 is
{ { 0 } , P = Q = 0 , s l 3 , ( P , Q ) ≠ ( 0 , 0 ) , τ = 0 , M 3 , τ ≠ 0. \begin{cases}
\{0\}, & P=Q=0,\\
\mathfrak{sl}_3, & (P,Q)\ne(0,0),\ \tau=0,\\
M_3, & \tau\ne0.
\end{cases} ⎩ ⎨ ⎧ { 0 } , sl 3 , M 3 , P = Q = 0 , ( P , Q ) = ( 0 , 0 ) , τ = 0 , τ = 0. In either nonzero case, there is an actual original input ( D , X , Y ) (D,X,Y) ( D , X , Y ) with a nonzero rank-one square-zero value at which the map into its stated target is smooth. The local fiber is a complete intersection of dimension 19 in the trace-zero case and 18 in the traceful case.
Proof of Theorem 5.1 . For regular diagonal D = diag ( d 1 , d 2 , d 3 ) D=\operatorname{diag}(d_1,d_2,d_3) D = diag ( d 1 , d 2 , d 3 ) , direct multiplication gives the exact trace identity
tr H P , Q ( D , X , Y ) = τ ∑ i , j ( d i − d j ) d X i j Y j i . (8) \operatorname{tr} H_{P,Q}(D,X,Y)=\tau\sum_{i,j}(d_i-d_j)^dX_{ij}Y_{ji}. \tag*{(8)} tr H P , Q ( D , X , Y ) = τ i , j ∑ ( d i − d j ) d X ij Y j i . (8)
Equivalently the sum is tr ( ( ad D d X ) Y ) \operatorname{tr}((\operatorname{ad}_{D}^{d}X)Y) tr (( ad D d X ) Y ) , so density extends this identity to all D D D . It is a nonzero polynomial function, as seen at D = diag ( 1 , 0 , 0 ) D=\operatorname{diag}(1,0,0) D = diag ( 1 , 0 , 0 ) , X = E 12 X=E_{12} X = E 12 , Y = E 21 Y=E_{21} Y = E 21 . Moreover a nonzero symbol is detected on a path through three distinct indices: if P ≠ 0 P\ne0 P = 0 , use X = E i j X=E_{ij} X = E ij and Y = E j ℓ Y=E_{j\ell} Y = E j ℓ , so that the reversed product is zero and the output is P ( d i − d j , d j − d ℓ ) E i ℓ P(d_i-d_j,d_j-d_\ell)E_{i\ell} P ( d i − d j , d j − d ℓ ) E i ℓ . Its two differences are independent. The case Q ≠ 0 Q\ne0 Q = 0 is obtained by interchanging X , Y X,Y X , Y . Thus no nonzero pair defines an identity or central-valued map on M 3 M_3 M 3 .
A column-star chart for the two nonzero symbols
Assume initially that P , Q P,Q P , Q are both nonzero. At a regular diagonal D D D take
X = u E 23 + v E 32 , Y = c 2 E 21 + c 3 E 31 , u v c 2 c 3 ≠ 0. (9) X=uE_{23}+vE_{32},\qquad Y=c_2E_{21}+c_3E_{31},\qquad uvc_2c_3\ne0. \tag*{(9)} X = u E 23 + v E 32 , Y = c 2 E 21 + c 3 E 31 , uv c 2 c 3 = 0. (9)
Write
F i j ℓ = P ( d i − d j , d j − d ℓ ) , K i j ℓ = Q ( d i − d j , d j − d ℓ ) . F_{ij\ell}=P(d_i-d_j,d_j-d_\ell),\qquad K_{ij\ell}=Q(d_i-d_j,d_j-d_\ell). F ij ℓ = P ( d i − d j , d j − d ℓ ) , K ij ℓ = Q ( d i − d j , d j − d ℓ ) .
The exact value of the complete map is
N = n 2 E 21 + n 3 E 31 , n 2 = u c 3 F 231 , n 3 = v c 2 F 321 . (10) N=n_2E_{21}+n_3E_{31},\qquad n_2=uc_3F_{231},\qquad n_3=vc_2F_{321}. \tag*{(10)} N = n 2 E 21 + n 3 E 31 , n 2 = u c 3 F 231 , n 3 = v c 2 F 321 . (10)
Choose D D D so that all triple-distinct symbol values needed below are nonzero. Each is a nonzero polynomial under an invertible linear change of the two diagonal differences, so these finitely many open conditions are simultaneously possible. In particular n 2 n 3 ≠ 0 n_2n_3\ne0 n 2 n 3 = 0 , and N N N is nonzero of rank one and square-zero.
Four variations of the original Y Y Y slot give pure off-block output directions:
δ Y E 12 E 13 E 21 E 31 d H ( δ Y ) u K 123 E 13 v K 132 E 12 v F 321 E 31 u F 231 E 21 \begin{array}{c|cccc}
\delta Y & E_{12} & E_{13} & E_{21} & E_{31}\\
dH(\delta Y) & uK_{123}E_{13} & vK_{132}E_{12} & vF_{321}E_{31} & uF_{231}E_{21}
\end{array} δ Y d H ( δ Y ) E 12 u K 123 E 13 E 13 v K 132 E 12 E 21 v F 321 E 31 E 31 u F 231 E 21
Their multipliers are nonzero. We work modulo these four output coordinates when adding the remaining directions.
Suppose first that p 2 ≠ q 2 p^2\ne q^2 p 2 = q 2 . The variations δ Y = E 23 , E 32 \delta Y=E_{23},E_{32} δ Y = E 23 , E 32 give a basis of the two lower diagonal coordinates: their determinant is
u v ε ( q 2 − p 2 ) ( d 2 − d 3 ) 2 d ≠ 0. uv\varepsilon(q^2-p^2)(d_2-d_3)^{2d}\ne0. uv ε ( q 2 − p 2 ) ( d 2 − d 3 ) 2 d = 0.
The variations δ X = E 12 , E 13 \delta X=E_{12},E_{13} δ X = E 12 , E 13 give respectively
c 2 F 121 E 11 + c 2 K 212 E 22 + c 3 K 312 E 32 , c 3 F 131 E 11 + c 3 K 313 E 33 + c 2 K 213 E 23 . c_2F_{121}E_{11}+c_2K_{212}E_{22}+c_3K_{312}E_{32},\qquad c_3F_{131}E_{11}+c_3K_{313}E_{33}+c_2K_{213}E_{23}. c 2 F 121 E 11 + c 2 K 212 E 22 + c 3 K 312 E 32 , c 3 F 131 E 11 + c 3 K 313 E 33 + c 2 K 213 E 23 .
Together with the previous six controls these have rank eight. With respect to the trace pairing, normalize their one-dimensional conormal by C 11 = 1 C_{11}=1 C 11 = 1 . Its only other possibly nonzero entries are
C 23 = − c 2 F 121 c 3 K 312 , C 32 = − c 3 F 131 c 2 K 213 . C_{23}=-\frac{c_2F_{121}}{c_3K_{312}},\qquad C_{32}=-\frac{c_3F_{131}}{c_2K_{213}}. C 23 = − c 3 K 312 c 2 F 121 , C 32 = − c 2 K 213 c 3 F 131 .
Simultaneous conjugation of the full original tuple ( D , X , Y ) (D,X,Y) ( D , X , Y ) gives output tangent [ Z , N ] [Z,N] [ Z , N ] . If every such tangent were annihilated by C C C , then [ C , N ] = 0 [C,N]=0 [ C , N ] = 0 , which forces
C 23 n 3 = n 2 , C 32 n 2 = n 3 . C_{23}n_3=n_2,\qquad C_{32}n_2=n_3. C 23 n 3 = n 2 , C 32 n 2 = n 3 .
These equations cannot hold for every choice of the independent nonzero parameters u u u , v v v , c 2 c_2 c 2 , c 3 c_3 c 3 : for fixed diagonal data and c 2 c_2 c 2 , c 3 c_3 c 3 , the ratio n 2 / n 3 n_2/n_3 n 2 / n 3 varies with u / v u/v u / v . If p = 0 p=0 p = 0 , both displayed entries of C C C vanish and the contradiction is immediate. Choose parameters where one equation fails. An actual orbit tangent then supplies the ninth direction.
Suppose next that p 2 = q 2 p^2=q^2 p 2 = q 2 and τ ≠ 0 \tau\ne0 τ = 0 . Necessarily p ≠ 0 p\ne0 p = 0 and q = ϵ p q=\epsilon p q = ϵ p . Put
x = d 2 − d 1 , y = d 3 − d 1 , f = F 231 , g = F 321 , x=d_2-d_1,\qquad y=d_3-d_1,\qquad f=F_{231},\qquad g=F_{321}, x = d 2 − d 1 , y = d 3 − d 1 , f = F 231 , g = F 321 ,
h = K 312 = Q ( y , − x ) , j = K 213 = Q ( x , − y ) , A = ( − x ) d , B = ( − y ) d . h=K_{312}=Q(y,-x),\qquad j=K_{213}=Q(x,-y),\qquad A=(-x)^d,\qquad B=(-y)^d. h = K 312 = Q ( y , − x ) , j = K 213 = Q ( x , − y ) , A = ( − x ) d , B = ( − y ) d .
The lower-diagonal variations now give E 22 + E 33 E_{22}+E_{33} E 22 + E 33 . In target coordinates ( 11 , 22 , 33 , 23 , 32 ) (11,22,33,23,32) ( 11 , 22 , 33 , 23 , 32 ) , the two X X X variations, that normalized lower-diagonal variation, and the simultaneous orbit directions generated by E 12 , E 13 E_{12},E_{13} E 12 , E 13 have columns
( p c 2 A p c 3 B 0 n 2 n 3 p c 2 A 0 1 − n 2 0 0 p c 3 B 1 0 − n 3 0 c 2 j 0 0 − n 2 c 3 h 0 0 − n 3 0 ) (11) \begin{pmatrix}
pc_2A & pc_3B & 0 & n_2 & n_3\\
pc_2A & 0 & 1 & -n_2 & 0\\
0 & pc_3B & 1 & 0 & -n_3\\
0 & c_2j & 0 & 0 & -n_2\\
c_3h & 0 & 0 & -n_3 & 0 \tag*{(11)}
\end{pmatrix} p c 2 A p c 2 A 0 0 c 3 h p c 3 B 0 p c 3 B c 2 j 0 0 1 1 0 0 n 2 − n 2 0 0 − n 3 n 3 0 − n 3 − n 2 0 (11)
Its determinant is
2 f g u v c 2 2 c 3 2 ( p 2 x d y d − Q ( y , − x ) Q ( x , − y ) ) . (12) 2fguvc_2^2c_3^2\left(p^2x^dy^d-Q(y,-x)Q(x,-y)\right). \tag*{(12)} 2 f g uv c 2 2 c 3 2 ( p 2 x d y d − Q ( y , − x ) Q ( x , − y ) ) . (12)
If the final polynomial is nonzero, choose the regular diagonal outside its zero set as well as the preceding symbol zero sets. This proves rank nine at the same actual nilpotent value. Interchanging X , Y X,Y X , Y and P , Q P,Q P , Q gives the same conclusion when the corresponding expression for P P P is nonzero.
If both final polynomials vanish identically, unique factorization in K [ s , t ] K[s,t] K [ s , t ] forces each symbol to be a monomial: a nonmonomial irreducible factor of either symbol would divide s d t d s^dt^d s d t d . The endpoint equalities P ( 1 , − 1 ) = p P(1,-1)=p P ( 1 , − 1 ) = p and q = ϵ p q=\epsilon p q = ϵ p then fix the coefficients. The pairs not yet covered are exactly
P ( s , t ) = p ( − 1 ) d − r s r t d − r , Q ( s , t ) = p ( − 1 ) ℓ s ℓ t d − ℓ , 1 ≤ r , ℓ ≤ d − 1. (13) P(s,t)=p(-1)^{d-r}s^rt^{d-r},\qquad Q(s,t)=p(-1)^\ell s^\ell t^{d-\ell},\qquad1\le r,\ell\le d-1. \tag*{(13)} P ( s , t ) = p ( − 1 ) d − r s r t d − r , Q ( s , t ) = p ( − 1 ) ℓ s ℓ t d − ℓ , 1 ≤ r , ℓ ≤ d − 1. (13)
where p ≠ 0 p\ne0 p = 0 . Conversely each such pair makes both normal polynomials zero. We now treat every one of these pairs uniformly.
All residual monomial pairs
For (13) , set
k = r + ℓ − d , σ = ( − 1 ) k , c 0 = p ( − 1 ) d − r . k=r+\ell-d,\qquad\sigma=(-1)^k,\qquad c_0=p(-1)^{d-r}. k = r + ℓ − d , σ = ( − 1 ) k , c 0 = p ( − 1 ) d − r .
At a fixed regular diagonal D D D , make the invertible linear changes on the hollow input spaces U = ad D r X U=\operatorname{ad}_D^rX U = ad D r X and V = ad D d − r Y V=\operatorname{ad}_D^{d-r}Y V = ad D d − r Y . Then
c 0 − 1 H P , Q = J k ( D , U , V ) : = U V + σ ad D k ( V ) ad D − k ( U ) . (14) c_0^{-1}H_{P,Q}=J_k(D,U,V):=UV+\sigma\,\operatorname{ad}_D^k(V)\operatorname{ad}_D^{-k}(U). \tag*{(14)} c 0 − 1 H P , Q = J k ( D , U , V ) := U V + σ ad D k ( V ) ad D − k ( U ) . (14)
Any negative exponent in this formula denotes only the inverse of ad D \operatorname{ad}_D ad D on its hollow root spaces at the chosen regular diagonal. It is not a negative exponent in the original polynomial, nor a claim about a rational map at singular D D D .
Take D = diag ( 0 , x , y ) D=\operatorname{diag}(0,x,y) D = diag ( 0 , x , y ) with x y ( y − x ) ≠ 0 xy(y-x)\ne0 x y ( y − x ) = 0 , and put
a = x k , b = y k , c = ( y − x ) k . a=x^k,\qquad b=y^k,\qquad c=(y-x)^k. a = x k , b = y k , c = ( y − x ) k .
These three scalars are nonzero for every integer k k k . Choose
V = E 21 + E 31 , U = ( 0 1 − 1 S 0 a T b 0 ) . (15) V=E_{21}+E_{31},\qquad U=
\begin{pmatrix}
0 & 1 & -1\\
S & 0 & a\\
T & b & 0
\end{pmatrix}. \tag*{(15)} V = E 21 + E 31 , U = 0 S T 1 0 b − 1 a 0 . (15)
The exact normalized value is independent of S , T S,T S , T :
J k = N = ( 0 a b ) ( 1 1 / a − 1 / b ) . (16) J_k=N=
\begin{pmatrix}
0\\
a\\
b
\end{pmatrix}
\begin{pmatrix}
1 & 1/a & -1/b
\end{pmatrix}. \tag*{(16)} J k = N = 0 a b ( 1 1/ a − 1/ b ) . (16)
Its row-column pairing is 1 − 1 = 0 1-1=0 1 − 1 = 0 , so it is nonzero of rank one and square-zero. Set Δ = T a − S b \Delta=Ta-Sb Δ = T a − S b and choose Δ ≠ 0 \Delta\ne0 Δ = 0 , for example S = 0 S=0 S = 0 , T = 1 T=1 T = 1 .
Here are entry formulas giving explicit tangent certificates without any bound on k k k . For arbitrary hollow U = ( u i j ) U=(u_{ij}) U = ( u ij ) , V = ( v i j ) V=(v_{ij}) V = ( v ij ) at this fixed D D D , the entries of J k J_k J k are
( J k ) 11 = u 12 v 21 + u 13 v 31 + v 12 u 21 + v 13 u 31 , ( J k ) 12 = u 13 v 32 + ( b / c ) v 13 u 32 , ( J k ) 13 = u 12 v 23 + σ ( a / c ) v 12 u 23 , ( J k ) 21 = u 23 v 31 + ( c / b ) v 23 u 31 , ( J k ) 22 = u 21 v 12 + u 23 v 32 + v 21 u 12 + v 23 u 32 , ( J k ) 23 = u 21 v 13 + ( a / b ) v 21 u 13 , ( J k ) 31 = u 32 v 21 + σ ( c / a ) v 32 u 21 , ( J k ) 32 = u 31 v 12 + ( b / a ) v 31 u 12 , ( J k ) 33 = u 31 v 13 + u 32 v 23 + v 31 u 13 + v 32 u 23 . (17) \begin{aligned}
(J_k)_{11}&=u_{12}v_{21}+u_{13}v_{31}+v_{12}u_{21}+v_{13}u_{31},\\
(J_k)_{12}&=u_{13}v_{32}+(b/c)v_{13}u_{32},\\
(J_k)_{13}&=u_{12}v_{23}+\sigma(a/c)v_{12}u_{23},\\
(J_k)_{21}&=u_{23}v_{31}+(c/b)v_{23}u_{31},\\
(J_k)_{22}&=u_{21}v_{12}+u_{23}v_{32}+v_{21}u_{12}+v_{23}u_{32},\\
(J_k)_{23}&=u_{21}v_{13}+(a/b)v_{21}u_{13},\\
(J_k)_{31}&=u_{32}v_{21}+\sigma(c/a)v_{32}u_{21},\\
(J_k)_{32}&=u_{31}v_{12}+(b/a)v_{31}u_{12},\\
(J_k)_{33}&=u_{31}v_{13}+u_{32}v_{23}+v_{31}u_{13}+v_{32}u_{23}. \tag*{(17)}
\end{aligned} ( J k ) 11 ( J k ) 12 ( J k ) 13 ( J k ) 21 ( J k ) 22 ( J k ) 23 ( J k ) 31 ( J k ) 32 ( J k ) 33 = u 12 v 21 + u 13 v 31 + v 12 u 21 + v 13 u 31 , = u 13 v 32 + ( b / c ) v 13 u 32 , = u 12 v 23 + σ ( a / c ) v 12 u 23 , = u 23 v 31 + ( c / b ) v 23 u 31 , = u 21 v 12 + u 23 v 32 + v 21 u 12 + v 23 u 32 , = u 21 v 13 + ( a / b ) v 21 u 13 , = u 32 v 21 + σ ( c / a ) v 32 u 21 , = u 31 v 12 + ( b / a ) v 31 u 12 , = u 31 v 13 + u 32 v 23 + v 31 u 13 + v 32 u 23 . (17)
They follow by multiplying the six root multipliers of ad D k \operatorname{ad}_{D}^{k} ad D k , and also verify (16) directly.
Use row-major target order ( 11 , 12 , 13 , 21 , 22 , 23 , 31 , 32 , 33 ) (11,12,13,21,22,23,31,32,33) ( 11 , 12 , 13 , 21 , 22 , 23 , 31 , 32 , 33 ) . When σ = 1 \sigma=1 σ = 1 , the nine hollow input columns in the order
u 12 , u 13 , u 23 , u 32 , v 12 , v 13 , v 21 , v 23 , v 32 u_{12},u_{13},u_{23},u_{32},v_{12},v_{13},v_{21},v_{23},v_{32} u 12 , u 13 , u 23 , u 32 , v 12 , v 13 , v 21 , v 23 , v 32
have determinant 4 a b Δ / c 4ab\Delta/c 4 ab Δ/ c at (15) , by differentiating (17) . When σ = − 1 \sigma=-1 σ = − 1 , retain the first eight of those columns and add the output column [ E 12 , N ] [E_{12},N] [ E 12 , N ] . Their determinant is 2 a b Δ / c 2ab\Delta/c 2 ab Δ/ c . For an additional direct check of this last normal direction, a trace-pairing conormal to all hollow U , V U,V U , V directions is
C = ( c Δ 0 0 − 2 a c Δ − c Δ − 2 a 2 b 2 2 a 3 b 2 b c Δ − 2 a b 3 − c Δ + 2 a 2 b 2 ) . C=\begin{pmatrix}
c\Delta& 0 & 0\\
-2ac\Delta& -c\Delta-2a^{2}b^{2} & 2a^{3}b\\
2bc\Delta& -2ab^{3} & -c\Delta+2a^{2}b^{2}
\end{pmatrix}. C = c Δ − 2 a c Δ 2 b c Δ 0 − c Δ − 2 a 2 b 2 − 2 a b 3 0 2 a 3 b − c Δ + 2 a 2 b 2 .
The first eight columns have minor 2 a 3 b 2 / c 2 2a^{3}b^{2}/c^{2} 2 a 3 b 2 / c 2 on target rows ( 11 , 12 , 13 , 21 , 22 , 23 , 31 , 33 ) (11,12,13,21,22,23,31,33) ( 11 , 12 , 13 , 21 , 22 , 23 , 31 , 33 ) , and [ C , N ] [C,N] [ C , N ] has entries 21 = 2 a c Δ 21=2ac\Delta 21 = 2 a c Δ , 31 = 2 b c Δ 31=2bc\Delta 31 = 2 b c Δ , with every other entry zero. Thus the orbit direction is genuinely outside the hollow tangent image.
Every hollow U U U or V V V direction is realized by an actual X X X or Y Y Y direction at fixed D D D through the invertible changes above. The last column in the odd case is obtained by simultaneously conjugating the actual original variables D , X , Y D,X,Y D , X , Y ; equivariance of (7) gives precisely the corresponding commutator output. No differentiation of inverse powers at a singular diagonal is used. Restoring c 0 c_0 c 0 rescales all outputs by a nonzero scalar. These nonzero determinants prove the traceful smooth assertion for all residual pairs, including negative, zero, and positive k k k .
The trace-zero branch and the one-order boundary
Assume P , Q ≠ 0 P,Q\ne0 P , Q = 0 and τ = 0 \tau=0 τ = 0 . Use the column-star input (9) , with the same nonzero symbol opens and notation f , g , h , j , A , B f,g,h,j,A,B f , g , h , j , A , B as above. The four pure off-block directions remain available. In the remaining traceless coordinates ( 11 , 22 , 23 , 32 ) (11,22,23,32) ( 11 , 22 , 23 , 32 ) , with 33 33 33 determined by the trace, the X X X directions E 12 , E 13 E_{12},E_{13} E 12 , E 13 and simultaneous orbit directions E 12 , E 13 E_{12},E_{13} E 12 , E 13 give respectively
R 2 = ( p c 2 A , − p c 2 A , 0 , c 3 h ) , R 3 = ( p c 3 B , 0 , c 2 j , 0 ) , R_2=(pc_2A,-pc_2A,0,c_3h),\qquad R_3=(pc_3B,0,c_2j,0), R 2 = ( p c 2 A , − p c 2 A , 0 , c 3 h ) , R 3 = ( p c 3 B , 0 , c 2 j , 0 ) ,
O 2 = ( n 2 , − n 2 , 0 , − n 3 ) , O 3 = ( n 3 , 0 , − n 2 , 0 ) . O_2=(n_2,-n_2,0,-n_3),\qquad O_3=(n_3,0,-n_2,0). O 2 = ( n 2 , − n 2 , 0 , − n 3 ) , O 3 = ( n 3 , 0 , − n 2 , 0 ) .
Here q = − ϵ p q=-\epsilon p q = − ϵ p , so the repeated diagonal contribution has opposite sign from (11) . If p ≠ 0 p\ne0 p = 0 , a normalized lower-block Y Y Y variation gives B 0 = ( 0 , 1 , 0 , 0 ) B_0=(0,1,0,0) B 0 = ( 0 , 1 , 0 , 0 ) , representing E 22 − E 33 E_{22}-E_{33} E 22 − E 33 . Expansion gives
det ( R 2 , R 3 , B 0 , O 2 ) = j c 2 ( A g p v c 2 2 + f h n u c 3 2 ) . \det(R_2,R_3,B_0,O_2)=jc_2(Agpvc_2^2+fhnuc_3^2). det ( R 2 , R 3 , B 0 , O 2 ) = j c 2 ( A g p v c 2 2 + f hn u c 3 2 ) .
It is a nonzero polynomial in the independent nonzero source parameters. If p = 0 p=0 p = 0 , then q = 0 q=0 q = 0 , and instead
det ( R 2 , R 3 , O 2 , O 3 ) = − f g h j u v c 2 2 c 3 2 ≠ 0. \det(R_2,R_3,O_2,O_3)=-fghjuvc_2^2c_3^2\ne0. det ( R 2 , R 3 , O 2 , O 3 ) = − f g hj uv c 2 2 c 3 2 = 0.
Choose one common input outside the required zero sets. Together with the four off-block directions these give rank eight. Since (8) vanishes identically, the original map is smooth into s l 3 \mathfrak{sl}_3 sl 3 there.
If exactly one symbol is nonzero and its trace specialization is nonzero, Lemma 4.3 applies to h ( u , v , w ) = P ( u − v , v − w ) h(u,v,w)=P(u-v,v-w) h ( u , v , w ) = P ( u − v , v − w ) , after interchanging X , Y X,Y X , Y if necessary. This is an actual smooth point of the same three-input map, since the hollow inputs used there are allowed here. If its trace specialization is zero, the proof of Theorem 4.1 fixes one regular diagonal D D D and one hollow first input for which the second-input linear map is onto the entire hollow subspace. Its column derangement determinants are simultaneously nonzero; this is a fixed-input assertion, not just surjectivity of a union. Choose the second input giving the connected column-star nilpotent E 21 + E 31 E_{21}+E_{31} E 21 + E 31 . The second-input variations fill all six hollow coordinates, while simultaneous conjugation gives both traceless diagonal directions, modulo those hollow coordinates. Hence the full original differential has rank eight. This proves the smooth assertion on the one-order trace-zero boundary as well.
Actual image and the original fibers
A smooth point gives an open image neighborhood of its value in the specified affine target. The image of (7) is conjugation invariant and is a cone by scaling X X X . The rank-one contraction in the proof of Theorem 2.1 therefore supplies every nonscalar target in that target space. If τ = 0 \tau=0 τ = 0 , this gives all nonzero traceless matrices; zero is obtained by X = 0 X=0 X = 0 .
For τ ≠ 0 \tau\ne0 τ = 0 , scalar attainment must also be checked for this repeated-input map. Take a regular diagonal D D D , index cyclically modulo three, and put
X i , i − 1 = 1 , Y i − 1 , i = ( d i − d i − 1 ) − d , X_{i,i-1}=1,\qquad Y_{i-1,i}=(d_i-d_{i-1})^{-d}, X i , i − 1 = 1 , Y i − 1 , i = ( d i − d i − 1 ) − d ,
with all other entries zero. The forward product contributes p p p to every diagonal entry and the reversed product contributes ϵ q \epsilon q ϵ q ; all off-diagonal entries vanish. Thus the actual value is τ I 3 \tau I_3 τ I 3 . Scaling X X X supplies every scalar, proving image M 3 M_3 M 3 . This step does not apply ordinary multilinear scalar extraction to a map with repeated D D D . Finally the Jacobian criterion gives smooth fibers of dimension 27 − dim E 27-\dim E 27 − dim E ; in the regular source local ring their dim E \dim E dim E defining equations form a regular sequence. This completes the proof of Theorem 5.1. □ \square □
Traceful pairs in every size
Use the map H P , Q H_{P,Q} H P , Q in (7) , with homogeneous degree d ≥ 2 d\ge2 d ≥ 2 symbols divisible by s t st s t , and put p = P ( 1 , − 1 ) p=P(1,-1) p = P ( 1 , − 1 ) , q = Q ( 1 , − 1 ) q=Q(1,-1) q = Q ( 1 , − 1 ) , ϵ = ( − 1 ) d \epsilon=(-1)^d ϵ = ( − 1 ) d and τ = p + ϵ q \tau=p+\epsilon q τ = p + ϵ q .
Theorem 5.2 (Traceful two-symbol pairs). Suppose τ ≠ 0 \tau\ne0 τ = 0 . For every n ≥ 3 n\ge3 n ≥ 3 , the map H P , Q : M n 3 → M n H_{P,Q}:M_n^3\to M_n H P , Q : M n 3 → M n has actual image M n M_n M n and a smooth original three-input point over a nonzero rank-one square-zero matrix. Its local fiber there is a complete intersection of dimension 2 n 2 2n^2 2 n 2 .
We prove the theorem by producing compatible seeds for an exact-fiber extension. Surjectivity in a smaller matrix size alone is insufficient.
Lemma 5.3. Suppose P , Q ≠ 0 P,Q\ne0 P , Q = 0 , τ ≠ 0 \tau\ne0 τ = 0 , and at size h ≥ 3 h\ge3 h ≥ 3 there is a regular diagonal D 0 D_0 D 0 and hollow X 0 , Y 0 X_0,Y_0 X 0 , Y 0 with a nonzero rank-one square-zero value N 0 N_0 N 0 . Assume the derivative of
( D , X , Y , g ) ⟼ g H P , Q ( D , X , Y ) g − 1 , D regular diagonal , X , Y hollow , g ∈ G L h , (D,X,Y,g)\longmapsto gH_{P,Q}(D,X,Y)g^{-1},\qquad D\ \text{regular diagonal},\quad X,Y\ \text{hollow},\quad g\in GL_h, ( D , X , Y , g ) ⟼ g H P , Q ( D , X , Y ) g − 1 , D regular diagonal , X , Y hollow , g ∈ G L h , is onto M h M_h M h at this input, and det ( ad D 0 j X 0 ) ≠ 0 \det(\operatorname{ad}_{D_0}^{j}X_0)\ne0 det ( ad D 0 j X 0 ) = 0 for 0 ≤ j ≤ d 0\le j\le d 0 ≤ j ≤ d . Then there is a seed with these same properties in size h + 1 h+1 h + 1 .
Proof. We use an exact singleton extension with a rank-one target and allow one endpoint coefficient to be zero. Write N 0 = u 0 v 0 t N_0=u_0v_0^{t} N 0 = u 0 v 0 t , where v 0 t u 0 = 0 v_0^{t}u_0=0 v 0 t u 0 = 0 . Put D = diag ( D 0 , t ) D=\operatorname{diag}(D_0,t) D = diag ( D 0 , t ) , E = D 0 − t I E=D_0-tI E = D 0 − t I , and initially X = diag ( X 0 , 0 ) X=\operatorname{diag}(X_0,0) X = diag ( X 0 , 0 ) . If the upper and lower new Y Y Y rectangles are v , w v,w v , w , their output rectangles are
A t v , w B t , A t = ∑ i + j = d P i j ( ad D 0 i X 0 ) E j , B t = ∑ i + j = d Q i j ( − 1 ) i E i ( ad D 0 j X 0 ) . (18) A_t v,\qquad wB_t,\qquad A_t=\sum_{i+j=d}P_{ij}(\operatorname{ad}_{D_0}^{i}X_0)E^j,\qquad B_t=\sum_{i+j=d}Q_{ij}(-1)^iE^i(\operatorname{ad}_{D_0}^{j}X_0). \tag*{(18)} A t v , w B t , A t = i + j = d ∑ P ij ( ad D 0 i X 0 ) E j , B t = i + j = d ∑ Q ij ( − 1 ) i E i ( ad D 0 j X 0 ) . (18)
The highest power of t t t in each sum has an invertible coefficient: homogeneity makes its other exponent unique, and the corresponding symbol coefficient is nonzero. Choose t t t so that D D D is regular and A t , B t A_t,B_t A t , B t are invertible. If q ≠ 0 q \ne0 q = 0 , take the exact target N 1 = ( N 0 0 v 0 T 0 ) N_1 = \begin{pmatrix} N_0 & 0 \\ v_0^{\mathsf{T}} & 0 \end{pmatrix} N 1 = ( N 0 v 0 T 0 0 ) . It has rank one and square zero. Solve (18) with v = 0 v=0 v = 0 and w ≠ 0 w\ne0 w = 0 . If q = 0 q=0 q = 0 , then p ≠ 0 p\ne0 p = 0 ; instead take N 1 = ( N 0 u 0 0 0 ) N_1 = \begin{pmatrix} N_0 & u_0 \\ 0 & 0 \end{pmatrix} N 1 = ( N 0 0 u 0 0 ) , solving with v ≠ 0 v\ne0 v = 0 and w = 0 w=0 w = 0 . The old output block is unchanged and the new bottom-right entry is zero, so these are exact values at single actual inputs.
For the new upper and lower X X X components u , z u,z u , z , the bottom-right derivative is
L ( u , z ) = ( − 1 ) d ( p z E d v + q w E d u ) . (19) L(u,z)=(-1)^d\left(pzE^d v+qwE^d u\right). \tag*{(19)} L ( u , z ) = ( − 1 ) d ( p z E d v + q w E d u ) . (19)
It is nonzero by the chosen rectangle. Old input and old similarity variations have zero bottom-right derivative. Their old outputs are onto M h M_h M h , and their rectangular contributions can be removed using (18) . Hence, together with L L L , the derivative is onto M h + 1 M_{h+1} M h + 1 . Every ( u , z ) ∈ ker L (u,z)\in\ker L ( u , z ) ∈ ker L extends to a tangent to the exact target fiber, without changing these raw cross components of X X X .
The provisional X X X has a zero last row and column. Along such a kernel tangent, the first possible determinant coefficient is
( − 1 ) j + 1 det ( ad D 0 j X 0 ) ⋅ z E j ( ad D 0 j X 0 ) − 1 E j u ( 0 ≤ j ≤ d ) , (20) (-1)^{j+1}\det\left(\operatorname{ad}_{D_0}^j X_0\right)\cdot zE^j\left(\operatorname{ad}_{D_0}^j X_0\right)^{-1}E^j u \qquad(0\le j\le d), \tag*{(20)} ( − 1 ) j + 1 det ( ad D 0 j X 0 ) ⋅ z E j ( ad D 0 j X 0 ) − 1 E j u ( 0 ≤ j ≤ d ) , (20)
in order two. The last diagonal entry remains identically zero on the hollow source, so no second-order diagonal correction enters this coefficient. If q ≠ 0 q\ne0 q = 0 , choose a nonzero u u u in the hyperplane w E d u = 0 wE^d u=0 w E d u = 0 , then choose z z z outside the finitely many annihilating hyperplanes in (20) . If q = 0 q=0 q = 0 , make the dual choice, first fixing z ≠ 0 z\ne0 z = 0 in z E d v = 0 zE^d v=0 z E d v = 0 . The hyperplanes have a nonzero vector since h ≥ 3 h\ge3 h ≥ 3 , and all matrices in these Schur forms are invertible.
The auxiliary source is smooth and its exact target fiber is smooth at the provisional point. The selected tangent therefore lifts to a formal arc in that fiber. All the determinant coefficients (20) are nonzero on it; the surjectivity minor and regular-diagonal conditions remain units. Thus the finite-type exact fiber localized at these finitely many functions has a K ( ( t ′ ) ) K((t')) K (( t ′ )) -point and is nonempty. The Nullstellensatz supplies an actual K K K -point. This uses nonemptiness of a localized algebraic fiber, not algebraization of an arbitrary formal arc. Removing the similarity parameter only conjugates the rank-one target and preserves the raw determinant conditions. Surjectivity of the auxiliary map implies surjectivity for the actual three-input map, since all its directions are induced by actual D , X , Y D,X,Y D , X , Y variations. □
Nonresonant pairs
5.2.1. Nonresonant pairs. Assume P , Q ≠ 0 P,Q\ne0 P , Q = 0 and p 2 ≠ q 2 p^2\ne q^2 p 2 = q 2 . Use the smooth column-star point (9) from the proof of Theorem 5.1 . Its value is N = n 2 E 21 + n 3 E 31 N=n_2E_{21}+n_3E_{31} N = n 2 E 21 + n 3 E 31 with n 2 n 3 ≠ 0 n_2n_3\ne0 n 2 n 3 = 0 . The six hollow Y Y Y columns span the coordinates 12 , 13 , 21 , 31 , 22 , 33 12,13,21,31,22,33 12 , 13 , 21 , 31 , 22 , 33 . In the remaining quotient coordinates ( 11 , 23 , 32 ) (11,23,32) ( 11 , 23 , 32 ) , the two raw upper-row X X X columns are R 2 , R 3 R_2,R_3 R 2 , R 3 , and the actual orbit columns generated by E 12 , E 13 E_{12},E_{13} E 12 , E 13 are
O 2 = ( n 2 , 0 , − n 3 ) , O 3 = ( n 3 , − n 2 , 0 ) . O_2=(n_2,0,-n_3),\qquad O_3=(n_3,-n_2,0). O 2 = ( n 2 , 0 , − n 3 ) , O 3 = ( n 3 , − n 2 , 0 ) .
The matrix [ R 2 R 3 O 2 O 3 ] [R_2\ R_3\ O_2\ O_3] [ R 2 R 3 O 2 O 3 ] has rank three by that proof. The orbit columns are independent, so a nonzero vector in its kernel has a nonzero raw upper-row X X X component. Cancel its remaining output using the six Y Y Y columns. Raw variations in X 21 , X 31 X_{21},X_{31} X 21 , X 31 have zero output, since they and Y Y Y have only a lower-left column, so the raw lower column can be chosen freely.
At this point every ad D j X \operatorname{ad}_{D}^{j}X ad D j X has an invertible lower two-by-two block A j A_j A j and zero first row and column. A kernel tangent with nonzero upper row u u u and lower column z z z gives Schur determinant coefficient − det ( A j ) u j A j − 1 z j -\det(A_j)u_jA_j^{-1}z_j − det ( A j ) u j A j − 1 z j , where u j , z j u_j,z_j u j , z j are obtained from u , z u,z u , z by invertible root multipliers. For fixed u ≠ 0 u\ne0 u = 0 this is a nonzero linear functional of z z z . Choose z z z outside the finitely many kernels for 0 ≤ j ≤ d 0\le j\le d 0 ≤ j ≤ d . As in the proof of Lemma 5.3 , lift in this same smooth exact target fiber and localize. We obtain a genuine size-three seed with all determinant conditions, while its rank-one nilpotent value and surjectivity are retained. The lemma now gives such a point in every size. This argument establishes determinant nonvanishing on the actual nilpotent fiber, rather than intersecting unrelated open sets in the unrestricted source.
The entire traceful resonance
5.2.2. The entire traceful resonance. Suppose p 2 = q 2 p^2=q^2 p 2 = q 2 and r ≠ 0 r\ne0 r = 0 . Then q = ϵ p ≠ 0 q=\epsilon p\ne0 q = ϵ p = 0 . If both symbols are monomials, use (15) with S = 0 S=0 S = 0 , T = 1 T=1 T = 1 . Its smoothness was proved in § 5 . The first original input X X X has exactly one nonzero determinant cycle, X 12 X 23 X 31 X_{12}X_{23}X_{31} X 12 X 23 X 31 . Every power ad D j \operatorname{ad}_{D}^{j} ad D j multiplies this cycle by nonzero root differences, so all determinant conditions of Lemma 5.3 hold at this same point. This extends the residual monomial cases without importing any unproved all-size smoothness implication.
Otherwise interchange the actual X , Y X,Y X , Y roles, and hence P , Q P,Q P , Q , if necessary, so that Q Q Q is not a monomial. The resonance remains q = ϵ p ≠ 0 q=\epsilon p\ne0 q = ϵ p = 0 . Define
Φ 1 ( x , y , z ) = q x d Q ( y , z ) − Q ( y , − x ) Q ( x , z ) , \Phi_1(x,y,z)=qx^dQ(y,z)-Q(y,-x)Q(x,z), Φ 1 ( x , y , z ) = q x d Q ( y , z ) − Q ( y , − x ) Q ( x , z ) ,
Φ 2 ( x , y , z ) = q y d Q ( x , z ) − Q ( x , − y ) Q ( y , z ) . \Phi_2(x,y,z)=qy^dQ(x,z)-Q(x,-y)Q(y,z). Φ 2 ( x , y , z ) = q y d Q ( x , z ) − Q ( x , − y ) Q ( y , z ) .
These are both nonzero. Indeed, if Φ 1 = 0 \Phi_1=0 Φ 1 = 0 , setting x = 1 x=1 x = 1 gives q Q ( y , z ) = Q ( y , − 1 ) Q ( 1 , z ) qQ(y,z)=Q(y,-1)Q(1,z) q Q ( y , z ) = Q ( y , − 1 ) Q ( 1 , z ) . The two factors are nonzero, and their Cartesian-product monomial support has constant total degree only when each consists of one monomial. Thus Q Q Q itself is a monomial. Conversely a monomial satisfies that identity. Finally Φ 2 ( x , y , z ) = Φ 1 ( y , x , z ) \Phi_2(x,y,z)=\Phi_1(y,x,z) Φ 2 ( x , y , z ) = Φ 1 ( y , x , z ) .
Choose D = diag ( 0 , x , y , − z ) D=\operatorname{diag}(0,x,y,-z) D = diag ( 0 , x , y , − z ) regular and set
a = Q ( x , z ) , b = Q ( y , z ) , f = P ( x − y , y ) , g = P ( y − x , x ) , u = a / f , v = b / g . a=Q(x,z),\qquad b=Q(y,z),\qquad f=P(x-y,y),\qquad g=P(y-x,x),\qquad u=a/f,\qquad v=b/g. a = Q ( x , z ) , b = Q ( y , z ) , f = P ( x − y , y ) , g = P ( y − x , x ) , u = a / f , v = b / g .
Require these four symbol values, Φ 1 \Phi_1 Φ 1 , Φ 2 \Phi_2 Φ 2 , and every P , Q P,Q P , Q value on a distinct-three-vertex path to be nonzero. For any such path, its two differences are independent linear forms in x , y , z x,y,z x , y , z . Each required factor is therefore a nonzero polynomial. Their finite product with the regularity factors is nonzero, so one common choice exists. With a further parameter ρ ≠ 0 \rho\ne0 ρ = 0 , put
X = E 14 + ρ E 41 + u E 23 + v E 32 , Y = E 21 + E 31 . (21) X=E_{14}+\rho E_{41}+uE_{23}+vE_{32},\qquad Y=E_{21}+E_{31}. \tag*{(21)} X = E 14 + ρ E 41 + u E 23 + v E 32 , Y = E 21 + E 31 . (21)
Direct multiplication of the complete map gives
H P , Q ( D , X , Y ) = N = ( 0 , a , b , 0 ) t ( 1 , 0 , 0 , 1 ) . H_{P,Q}(D,X,Y)=N=(0,a,b,0)^{\mathsf{t}}(1,0,0,1). H P , Q ( D , X , Y ) = N = ( 0 , a , b , 0 ) t ( 1 , 0 , 0 , 1 ) .
The forward paths 2 → 3 → 1 2\to3\to1 2 → 3 → 1 , 3 → 2 → 1 3\to2\to1 3 → 2 → 1 and the reverse paths 2 → 1 → 4 2\to1\to4 2 → 1 → 4 , 3 → 1 → 4 3\to1\to4 3 → 1 → 4 are the only surviving paths. Thus the value is independent of ρ \rho ρ , nonzero of rank one, and square-zero. The two two-cycles supporting X X X show that
det ( adj D j X ) = ρ u v ( ( d 1 − d 4 ) ( d 2 − d 3 ) ) 2 j ≠ 0 ( j ≥ 0 ) . \det(\operatorname{adj}_{D}^{j}X)=\rho uv((d_1-d_4)(d_2-d_3))^{2j}\ne0\qquad(j\ge0). det ( adj D j X ) = ρ uv (( d 1 − d 4 ) ( d 2 − d 3 ) ) 2 j = 0 ( j ≥ 0 ) .
It remains to prove smoothness at a single such input. Put A = { 1 , 4 } A=\{1,4\} A = { 1 , 4 } , B = { 2 , 3 } B=\{2,3\} B = { 2 , 3 } , and let σ \sigma σ exchange 1 , 4 1,4 1 , 4 and 2 , 3 2,3 2 , 3 . Write h i = X i , σ ( i ) h_i=X_{i,\sigma(i)} h i = X i , σ ( i ) . The eight cross-block hollow Y Y Y directions split into four pairs. For a ′ ∈ A , b ′ ∈ B a'\in A,b'\in B a ′ ∈ A , b ′ ∈ B , the columns Y a ′ b ′ Y_{a'b'} Y a ′ b ′ , Y σ ( a ′ ) σ ( b ′ ) Y_{\sigma(a')\sigma(b')} Y σ ( a ′ ) σ ( b ′ ) and the rows H σ ( a ′ ) b ′ H_{\sigma(a')b'} H σ ( a ′ ) b ′ , H a ′ σ ( b ′ ) H_{a'\sigma(b')} H a ′ σ ( b ′ ) give the matrix
( h σ ( a ′ ) P σ ( a ′ ) , a ′ , b ′ h σ ( b ′ ) Q σ ( a ′ ) , σ ( b ′ ) , b ′ h b ′ Q a ′ b ′ , σ ( b ′ ) h a ′ P a ′ , σ ( a ′ ) , σ ( b ′ ) ) , \begin{pmatrix}
h_{\sigma(a')}P_{\sigma(a'),a',b'} & h_{\sigma(b')}Q_{\sigma(a'),\sigma(b'),b'}\\
h_{b'}Q_{a'b',\sigma(b')} & h_{a'}P_{a',\sigma(a'),\sigma(b')}
\end{pmatrix}, ( h σ ( a ′ ) P σ ( a ′ ) , a ′ , b ′ h b ′ Q a ′ b ′ , σ ( b ′ ) h σ ( b ′ ) Q σ ( a ′ ) , σ ( b ′ ) , b ′ h a ′ P a ′ , σ ( a ′ ) , σ ( b ′ ) ) ,
where P i j k = P ( d i − d j , d j − d k ) P_{ijk}=P(d_i-d_j,d_j-d_k) P ij k = P ( d i − d j , d j − d k ) and similarly for Q Q Q ; the analogous pairs with A , B A,B A , B exchanged supply the other block. Each determinant is the difference of a nonzero multiple of ρ \rho ρ and a nonzero multiple of u v uv uv . A single ρ ≠ 0 \rho\ne0 ρ = 0 avoids their finitely many roots. The eight cross-block outputs are then independent. The within-pair Y Y Y directions supply E 11 + E 44 E_{11}+E_{44} E 11 + E 44 and E 22 + E 33 E_{22}+E_{33} E 22 + E 33 , by q = ϵ p ≠ 0 q=\epsilon p\ne0 q = ϵ p = 0 .
Let C C C annihilate these directions and all remaining hollow X X X and actual orbit directions under the trace pairing. The preceding ten outputs force
C A = ( c e h − c ) , C B = ( k ℓ m − k ) , C_A=\begin{pmatrix}c&e\\h&-c\end{pmatrix},\qquad C_B=\begin{pmatrix}k&\ell\\m&-k\end{pmatrix}, C A = ( c h e − c ) , C B = ( k m ℓ − k ) ,
with no cross blocks. The raw X 42 X_{42} X 42 direction gives P 421 E 41 P_{421}E_{41} P 421 E 41 , so e = 0 e=0 e = 0 . Actual simultaneous conjugation of D , X , Y D,X,Y D , X , Y gives [ Z , N ] [Z,N] [ Z , N ] and hence [ C , N ] = 0 [C,N]=0 [ C , N ] = 0 . Comparing the two rank-one factors of N N N gives
h = − 2 c , ℓ = − ( c + k ) a / b , m = − ( c − k ) b / a . h=-2c,\qquad\ell=-(c+k)a/b,\qquad m=-(c-k)b/a. h = − 2 c , ℓ = − ( c + k ) a / b , m = − ( c − k ) b / a .
The X 12 X_{12} X 12 direction has diagonal part q x d ( E 11 + E 22 ) qx^d(E_{11}+E_{22}) q x d ( E 11 + E 22 ) and remaining entry Q ( y , − x ) E 32 Q(y,-x)E_{32} Q ( y , − x ) E 32 . Pairing with C C C yields ( c + k ) Φ 1 / b = 0 (c+k)\Phi_1/b=0 ( c + k ) Φ 1 / b = 0 . Likewise X 13 X_{13} X 13 yields ( c − k ) Φ 2 / a = 0 (c-k)\Phi_2/a=0 ( c − k ) Φ 2 / a = 0 . Thus c = k = 0 c=k=0 c = k = 0 , and then C = 0 C=0 C = 0 . These actual hollow and orbit directions span all M 4 M_4 M 4 , including its trace direction. Lemma 5.3 now extends this guarded point to every n ≥ 4 n\ge4 n ≥ 4 ; size three is separately covered by Theorem 5.1 .
Actual images and local fibers
If one complete symbol is zero, the traceful assertion follows from Lemma 4.3. Otherwise the nonresonant and resonant cases exhaust τ ≠ 0 \tau\ne0 τ = 0 . At each smooth point, openness and the cone/conjugation argument in Theorem 2.1 give all nonscalar values. For scalars in this repeated-input map, choose regular diagonal D D D , use cyclic indices modulo n n n , and set
X i , i − 1 = 1 , Y i − 1 , i = ( d i − d i − 1 ) − d . X_{i,i-1}=1,\qquad Y_{i-1,i}=(d_i-d_{i-1})^{-d}. X i , i − 1 = 1 , Y i − 1 , i = ( d i − d i − 1 ) − d .
All other entries are zero. Direct multiplication gives H P , Q = τ I n H_{P,Q}=\tau I_n H P , Q = τ I n ; scaling X X X gives every scalar. This is not ordinary-multilinear scalar extraction with the repeated D D D treated as independent. The Jacobian criterion gives the asserted three-input fiber dimension and regular sequence. This proves Theorem 5.2 .
Complete two-active coefficient fibers in every size at least three
We retain the standing algebraically closed, characteristic-zero field K K K . The results concern the unchanged original ordinary multilinear polynomial. We first treat a nonzero complete two-active restriction with one common passive matrix. Section 7 then treats the genuine second-layer portion of the common kernel of all these tests.
Theorem 6.1 (The complete original coefficient fiber). Let f f f be ordinary multilinear in m = d + 2 m=d+2 m = d + 2 original variables, d ≥ 2 d\ge2 d ≥ 2 . Suppose that for some two original positions its complete restriction, with X , Y X,Y X , Y in those positions and D D D in all others, is H P , Q H_{P,Q} H P , Q of (7), where P , Q P,Q P , Q are homogeneous of degree d d d , st ∣ P , Q \operatorname{st}\mid P,Q st ∣ P , Q , and ( P , Q ) ≠ ( 0 , 0 ) (P,Q)\ne(0,0) ( P , Q ) = ( 0 , 0 ) . For each n ≥ 3 n\ge3 n ≥ 3 ,
Val n ( f ) = { s l n , tr f is an identity on M n , M n , tr f is not an identity on M n . \operatorname{Val}_n(f)=
\begin{cases}
\mathfrak{sl}_n, & \operatorname{tr} f\text{ is an identity on }M_n,\\
M_n, & \operatorname{tr} f\text{ is not an identity on }M_n.
\end{cases} Val n ( f ) = { sl n , M n , tr f is an identity on M n , tr f is not an identity on M n . In the first case f : M n m → s l n f:M_n^m\to\mathfrak{sl}_n f : M n m → sl n has a smooth original input over a nonzero rank-one square-zero matrix; its local fiber dimension is m n 2 − n 2 + 1 mn^2-n^2+1 m n 2 − n 2 + 1 . In the second case f : M n m → M n f:M_n^m\to M_n f : M n m → M n has a flat original input over such a matrix, and its local fiber is a complete intersection of dimension m n 2 − n 2 mn^2-n^2 m n 2 − n 2 .
The restriction identity may be an actual identity on the fixed M n M_n M n ; a free identity suffices to apply the statement in every size. Arbitrary same-degree ordinary corrections with zero complete selected restriction are permitted, including the entire proper J 3 J^3 J 3 and all higher powers, with every crossing partition and order. The target is always chosen from the actual size-n n n trace of the corrected polynomial, and the nilpotent input may change with that correction.
Theorem 5.2 already proves the smooth full-matrix conclusion when the trace of the restriction is nonzero. The remaining problem is not merely to find a trace-zero restriction value. One must select a nilpotent input of that same restriction where the first surviving trace term of the complete original map does not disappear on its exact traceless fiber. The following theorem provides the needed compatibility.
Put V n = { A ∈ M n : A i i = 0 } V_n=\{A\in M_n:A_{ii}=0\} V n = { A ∈ M n : A ii = 0 } , the hollow subspace, and keep p = P ( 1 , − 1 ) p=P(1,-1) p = P ( 1 , − 1 ) , q = Q ( 1 , − 1 ) q=Q(1,-1) q = Q ( 1 , − 1 ) , ϵ = ( − 1 ) d \epsilon=(-1)^d ϵ = ( − 1 ) d and τ = p + ϵ q \tau=p+\epsilon q τ = p + ϵ q . At a fixed regular diagonal D D D , write
H D ( X , Y ) = H P , Q ( D , X , Y ) , Γ D ( X , Y , g ) = g H D ( X , Y ) g − 1 , X , Y ∈ V n , g ∈ G L n . H_D(X,Y)=H_{P,Q}(D,X,Y),\qquad\Gamma_D(X,Y,g)=gH_D(X,Y)g^{-1},\qquad X,Y\in V_n,\quad g\in GL_n. H D ( X , Y ) = H P , Q ( D , X , Y ) , Γ D ( X , Y , g ) = g H D ( X , Y ) g − 1 , X , Y ∈ V n , g ∈ G L n .
For τ = 0 \tau=0 τ = 0 , let G D \mathcal{G}_D G D consist of hollow pairs whose raw value is nonzero rank-one square-zero and for which d Γ D d\Gamma_D d Γ D is onto s l n \mathfrak{sl}_n sl n at ( X , Y , I ) (X,Y,I) ( X , Y , I ) . Let G D r e g \mathcal{G}_D^{\mathrm{reg}} G D reg be the subset satisfying
det ( ad D j X ) ≠ 0 ( 0 ≤ j ≤ d ) . (22) \det\left(\operatorname{ad}_D^j X\right)\ne0\qquad(0\le j\le d). \tag*{(22)} det ( ad D j X ) = 0 ( 0 ≤ j ≤ d ) . (22)
The simultaneous conjugation in Γ D \Gamma_D Γ D is realized in actual inputs by
( D , X , Y ) ⟼ ( g D g − 1 , g X g − 1 , g Y g − 1 ) . (D,X,Y)\longmapsto(gDg^{-1},gXg^{-1},gYg^{-1}). ( D , X , Y ) ⟼ ( g D g − 1 , g X g − 1 , g Y g − 1 ) .
In the original polynomial it conjugates every passive D D D slot as well. Raw tests and determinant conditions below refer to X , Y X,Y X , Y before this auxiliary conjugation.
Theorem 6.2 (Compatible nilpotent bilinear detection). Assume ( P , Q ) ≠ ( 0 , 0 ) (P,Q) \ne(0,0) ( P , Q ) = ( 0 , 0 ) and τ = 0 \tau= 0 τ = 0 . For every n ≥ 3 n \ge3 n ≥ 3 there is a nonempty Zariski-open set Ω n \Omega_n Ω n of regular diagonal matrices such that, for each fixed D ∈ Ω n D \in\Omega_n D ∈ Ω n , the tensors
{ X ⊗ Y : ( X , Y ) ∈ G D } span V n ⊗ V n . \{X \otimes Y : (X,Y) \in\mathcal{G}_D\}\ \operatorname{span} V_n \otimes V_n. { X ⊗ Y : ( X , Y ) ∈ G D } span V n ⊗ V n . For n ≥ 4 n \ge4 n ≥ 4 one may require (22) ; if p ≠ 0 p \ne0 p = 0 , these guards can also be required in size three. After allowing arbitrary diagonal parts in the original X , Y X,Y X , Y , every nonzero bilinear form on M n × M n M_n \times M_n M n × M n is nonzero at one actual smooth nilpotent seed of this same H P , Q H_{P,Q} H P , Q and this same D D D .
The span in this statement is a linear-functional detector, not an assertion that a polynomial image can be added. Given a nonzero bilinear form, it supplies one compatible original input. The fixed open Ω n \Omega_n Ω n is independent of that form. In particular, a form whose coefficients depend on D D D is first specialized at a suitable D ∈ Ω n D \in\Omega_n D ∈ Ω n and then detected at that same D D D .
The proof splits exhaustively into p ≠ 0 p \ne0 p = 0 and p = q = 0 p = q = 0 p = q = 0 . In the latter case the cubic cycle norm separates invertible hollow operators from a two-dimensional cycle kernel. The former case needs one four-vertex Laurent calculation. Once a guarded spanning set is available in size four, a tensor uses at most four vertices, and the remaining size induction is uniform. We first record those common mechanisms, so that they are not repeated in each coefficient family.
Diagonal enrichment and exact guarded extension.
Lemma 6.3. For fixed regular diagonal D D D , hollow tensor detection by G D \mathcal{G}_D G D implies full M n × M n M_n \times M_n M n × M n bilinear detection by actual smooth nilpotent seeds of H P , Q H_{P,Q} H P , Q .
Proof. All active adjoint exponents are positive. Adding arbitrary diagonal matrices D X , D Y D_X,D_Y D X , D Y to the original X , Y X,Y X , Y therefore leaves the value unchanged. The hollow controls and simultaneous conjugation, including these added parts, retain the same smooth certificate. Suppose a bilinear form vanishes on every enriched pair. Its coefficient bilinear in D X , D Y D_X,D_Y D X , D Y is zero. Its coefficients linear in either added part vanish on the projections of the hollow seed set. Each projection spans V n V_n V n : otherwise a nonzero functional vanishing on that projection, tensored with any nonzero functional on the other factor, would contradict the hollow tensor span. Thus both mixed parts vanish. The remaining hollow-by-hollow part vanishes by hypothesis. □ \square □
Lemma 6.4 (Trace-zero guarded singleton extension). Suppose P , Q ≠ 0 P,Q \ne0 P , Q = 0 , τ = 0 \tau= 0 τ = 0 , and ( X 0 , Y 0 ) ∈ G D 0 g u a r d (X_0,Y_0) \in\mathcal{G}_{D_0}^{\mathrm{guard}} ( X 0 , Y 0 ) ∈ G D 0 guard in size h ≥ 3 h \ge3 h ≥ 3 . For a generic new diagonal entry z z z the same symbol pair has a guarded smooth rank-one square-zero seed in size h + 1 h+1 h + 1 at D = diag ( D 0 , z ) D = \operatorname{diag}(D_0,z) D = diag ( D 0 , z ) . Moreover, any raw function nonzero at the provisional input below can be retained while restoring all guards on its exact saturated fiber.
Proof. Write the raw value as N 0 = u 0 v 0 T N_0 = u_0v_0^{\mathsf T} N 0 = u 0 v 0 T , with v 0 T u 0 = 0 v_0^{\mathsf T}u_0 = 0 v 0 T u 0 = 0 , and set E = D 0 − z I E = D_0-zI E = D 0 − z I and X = diag ( X 0 , 0 ) X = \operatorname{diag}(X_0,0) X = diag ( X 0 , 0 ) . The full new upper and lower Y Y Y rectangle maps are
F ( z ) = ∑ r + s = d P r s ( ad D 0 r X 0 ) E s , F ( z ) y , w G ( z ) , G ( z ) = ∑ r + s = d Q r s ( − 1 ) r E r ( ad D 0 s X 0 ) . (23) \begin{aligned}
F(z)&=\sum_{r+s=d}P_{rs}(\operatorname{ad}_{D_0}^{r}X_0)E^s,\\
F(z)y,\quad wG(z),\qquad
G(z)&=\sum_{r+s=d}Q_{rs}(-1)^rE^r(\operatorname{ad}_{D_0}^{s}X_0). \tag*{(23)}
\end{aligned} F ( z ) F ( z ) y , w G ( z ) , G ( z ) = r + s = d ∑ P r s ( ad D 0 r X 0 ) E s , = r + s = d ∑ Q r s ( − 1 ) r E r ( ad D 0 s X 0 ) . (23) The largest s s s in the first sum and largest r r r in the second have invertible leading coefficients by (22) . Homogeneity makes the other exponent unique, so there is no leading cancellation. Choose one z z z making D D D regular and both matrices invertible. For λ ≠ 0 \lambda\ne0 λ = 0 take y = 0 y=0 y = 0 and w = λ v 0 T G ( z ) − 1 w=\lambda v_0^{\mathsf T}G(z)^{-1} w = λ v 0 T G ( z ) − 1 . The complete raw value is
N 1 = ( N 0 0 λ v 0 T 0 ) = ( u 0 λ ) ( v 0 T 0 ) , N 1 2 = 0 , rank N 1 = 1. (24) N_1=
\begin{pmatrix}
N_0 & 0\\
\lambda v_0^{\mathsf T} & 0
\end{pmatrix}
=
\begin{pmatrix}
u_0\\
\lambda
\end{pmatrix}
\begin{pmatrix}
v_0^{\mathsf T} & 0
\end{pmatrix},
\qquad N_1^2=0,\quad\operatorname{rank}N_1=1. \tag*{(24)} N 1 = ( N 0 λ v 0 T 0 0 ) = ( u 0 λ ) ( v 0 T 0 ) , N 1 2 = 0 , rank N 1 = 1. (24) Old controls give the old s h \mathfrak{s}_h s h block after correcting any new rectangles; (23) fills both rectangles. A genuine new orbit direction Z = ( 0 0 0 ) Z=\begin{pmatrix}0\\0\\0\end{pmatrix} Z = 0 0 0 gives
[ Z , N 1 ] = ( λ e v 0 T − N 0 e 0 − λ v 0 T e ) . [Z,N_1]=
\begin{pmatrix}
\lambda e v_0^{\mathsf T} & -N_0e\\
0 & -\lambda v_0^{\mathsf T}e
\end{pmatrix}. [ Z , N 1 ] = ( λ e v 0 T 0 − N 0 e − λ v 0 T e ) .
Choose v 0 t e ≠ 0 v_0^t e \ne0 v 0 t e = 0 . Its bottom-right entry supplies the missing scalar direction; its old-block trace is the opposite scalar, and the remaining old traceless part and rectangles can be corrected. Thus d Γ D d\Gamma_D d Γ D is onto s l h + 1 \mathfrak{sl}_{h+1} sl h + 1 . This is an actual orbit normal and does not require either endpoint to be nonzero.
Prescribe any raw new X X X upper column a a a and lower row b b b . Their complete derivative is traceless and can be canceled by the old, Y Y Y -rectangle and orbit controls just described. These corrections do not change the specified raw X X X cross components. Hence ( a , b ) (a,b) ( a , b ) extends to a kernel tangent of the exact Γ D = N 1 \Gamma_D=N_1 Γ D = N 1 fiber. For a formal arc parameter t t t , the first determinant coefficient is
det ( adj D j X ( t ) ) = ( − 1 ) j + 1 t 2 det ( adj D 0 j X 0 ) b E j ( adj D 0 j X 0 ) − 1 E j a + O ( t 3 ) . (25) \det\left(\operatorname{adj}_{D}^{j}X(t)\right)=(-1)^{j+1}t^2\det\left(\operatorname{adj}_{D_0}^{j}X_0\right)bE^{j}\left(\operatorname{adj}_{D_0}^{j}X_0\right)^{-1}E^{j}a+O(t^3). \tag*{(25)} det ( adj D j X ( t ) ) = ( − 1 ) j + 1 t 2 det ( adj D 0 j X 0 ) b E j ( adj D 0 j X 0 ) − 1 E j a + O ( t 3 ) . (25)
Choose a ≠ 0 a\ne0 a = 0 and then b b b outside the finitely many annihilating hyperplanes. All coefficients in (25) are nonzero. The exact fiber is smooth at the provisional point, so the kernel tangent lifts to a formal arc in it. A surjectivity minor, and any raw function nonzero at the provisional point, are units on this arc. The finite-type localization inverting these functions and all guards is nonempty, and has an actual point over the algebraically closed base field. This uses nonemptiness of a localization, not an assertion that an arbitrary formal arc algebraizes. Finally discard the auxiliary g g g ; the raw value is conjugate to N 1 N_1 N 1 , and raw guards and tests have been retained. No global irreducibility of the exact fiber is needed. □
The rectangle and Schur mechanisms also appear in Lemma 5.3 . Here the trace-zero orbit normal permits arbitrary raw cross tangents and preserves raw tests in the same exact nilpotent fiber, including when p = q = 0 p=q=0 p = q = 0 .
Lemma 6.5 (Four vertices suffice for the size induction). Suppose the same nonzero trace-zero pair has guarded hollow tensor spanning in size four at generic diagonal parameters. Then it has that spanning property in every size n ≥ 4 n\ge4 n ≥ 4 .
Proof. Work over the algebraic closure of K ( d 1 , … , d n ) K(d_1,\ldots,d_n) K ( d 1 , … , d n ) . On an old h = n − 1 h=n-1 h = n − 1 vertex set choose a finite guarded spanning collection defined over the algebraic closure of its old diagonal field. The new diagonal entry is transcendental over these data, so Lemma 6.4 applies. Spanning survives scalar extension to the full diagonal field.
If a bilinear T T T vanishes at all guarded good size-n n n pairs, its value at each provisional extension must be zero: a nonzero value would be retained by the exact-fiber guard restoration. That value is
T h ( X 0 , Y 0 ) + λ T ( diag ( X 0 , 0 ) , ( 0 0 v 0 t G ( z ) − 1 0 ) ) . T_h(X_0,Y_0)+\lambda T\left(\operatorname{diag}(X_0,0),\begin{pmatrix}0&0\\v_0^tG(z)^{-1}&0\end{pmatrix}\right). T h ( X 0 , Y 0 ) + λ T ( diag ( X 0 , 0 ) , ( 0 v 0 t G ( z ) − 1 0 0 ) ) .
It vanishes for every λ ≠ 0 \lambda\ne0 λ = 0 , hence its constant term vanishes. The old spanning collection forces T h = 0 T_h=0 T h = 0 . This works after removing any vertex. For n ≥ 5 n\ge5 n ≥ 5 , a pair of hollow matrix units uses at most four vertices and lies in some ( n − 1 ) (n-1) ( n − 1 ) -vertex subset. All coefficients of T T T are therefore zero, proving the induction. □
Lemma 6.6 (One diagonal open independent of the test). A hollow tensor-spanning assertion proved at the generic diagonal point by actual smooth nilpotent seeds descends to one nonempty open Ω n \Omega_n Ω n of regular diagonal tuples, with the same fixed-D D D assertion at every D ∈ Ω n D\in\Omega_n D ∈ Ω n . The guards may be included.
Proof. Select finitely many generic seed tensors forming a basis. Place D D D , their raw inputs, auxiliary invertible matrices, raw rank-one square-zero equations, a nonzero entry in each value, chosen surjectivity minors, the tensor-basis determinant, and the required nonzero guard determinants in one finite-type incidence scheme. Its projection to diagonal D D D is dominant. By constructibility its image contains a nonempty open. Every nonempty finite-type fiber over a K K K -point has an actual K K K -point, since K K K is algebraically closed. This gives the same diagonal open for all tests simultaneously.
When a construction uses Laurent series, a nonzero raw test yields an extension-field point of this incidence, hence its nonemptiness. One does not descend a fixed fiber whose target itself has Laurent coordinates. In applications below the Laurent parameter changes raw X X X , Y Y Y , g g g while D D D , and any D D D -dependent coefficients of the test, are fixed.
The nonzero-endpoint trace-zero stratum
Throughout this subsection, the complete symbols satisfy
p = P ( 1 , − 1 ) ≠ 0 , q = Q ( 1 , − 1 ) = − ϵ p , ϵ = ( − 1 ) d . (26) p=P(1,-1)\ne0,\qquad q=Q(1,-1)=-\epsilon p,\qquad\epsilon=(-1)^d. \tag*{(26)} p = P ( 1 , − 1 ) = 0 , q = Q ( 1 , − 1 ) = − ϵ p , ϵ = ( − 1 ) d . (26)
In particular, both symbols are nonzero. There is no restriction on their other coefficients. We write G D g u a r d G_D^{\mathrm{guard}} G D guard for the hollow pairs ( X , Y ) (X,Y) ( X , Y ) such that H D ( X , Y ) H_D(X,Y) H D ( X , Y ) is nonzero of rank one and square zero, the differential of Γ D \Gamma_D Γ D is onto s l n \mathfrak{sl}_n sl n at ( X , Y , I ) (X,Y,I) ( X , Y , I ) , and
det ( adj D j X ) ≠ 0 ( 0 ≤ j ≤ d ) . \det(\operatorname{adj}_D^j X)\ne0\qquad(0\le j\le d). det ( adj D j X ) = 0 ( 0 ≤ j ≤ d ) .
The guards and all tensor evaluations in this subsection concern the raw matrices X , Y X,Y X , Y , before the auxiliary conjugation in Γ D \Gamma_D Γ D .
Theorem 6.7. Assume (26) . For every n ≥ 3 n\ge3 n ≥ 3 there is a nonempty open set Ω n \Omega_n Ω n of regular diagonal matrices such that, at each fixed D ∈ Ω n D\in\Omega_n D ∈ Ω n ,
span { X ⊗ Y : ( X , Y ) ∈ G D g u a r d } = V n ⊗ V n . \operatorname{span}\{X\otimes Y:(X,Y)\in G_D^{\mathrm{guard}}\}=V_n\otimes V_n. span { X ⊗ Y : ( X , Y ) ∈ G D guard } = V n ⊗ V n . Consequently, after arbitrary diagonal parts are allowed in the two original active inputs, the actual smooth nonzero rank-one square-zero seeds detect every nonzero bilinear form on M n × M n M_n\times M_n M n × M n .
We prove the tensor assertion first over the algebraic closure of the field of generic diagonal parameters. This keeps D D D fixed throughout each fiber argument. In particular, the coefficients of a bilinear form under examination are allowed to belong to this field, but they are held fixed during every source deformation. The final passage to one common open set of diagonal parameters is Lemma 6.6.
Guarded detection in size three
Lemma 6.8. Under (26) , at a generic regular diagonal D D D of size three the tensors of G D g u a r d G_D^{\mathrm{guard}} G D guard span V 3 ⊗ V 3 V_3\otimes V_3 V 3 ⊗ V 3 . Moreover, the exact local fiber at a generic column-star seed has a nonempty open subset on which all the raw adjoint-power guards hold. One may impose simultaneously any prescribed finite collection of additional guards of the form det ( W ∘ X ) ≠ 0 \det(W\circ X)\ne0 det ( W ∘ X ) = 0 , where W ∘ X = ( w i j X i j ) W\circ X=(w_{ij}X_{ij}) W ∘ X = ( w ij X ij ) and all six off-diagonal w i j w_{ij} w ij are nonzero constants in the fixed coefficient field.
Proof. Choose D = diag ( d 1 , d 2 , d 3 ) D=\operatorname{diag}(d_1,d_2,d_3) D = diag ( d 1 , d 2 , d 3 ) with all distinct-three-vertex path values of P P P and Q Q Q nonzero. These conditions hold at the generic diagonal: on any such path the two differences are independent linear forms, and neither symbol is zero. Use the column-star chart (9) –(10) , namely
X = u E 23 + v E 32 , Y = c 2 E 21 + c 3 E 31 , u v c 2 c 3 ≠ 0. (27) X=uE_{23}+vE_{32},\qquad Y=c_2E_{21}+c_3E_{31},\qquad uvc_2c_3\ne0. \tag*{(27)} X = u E 23 + v E 32 , Y = c 2 E 21 + c 3 E 31 , uv c 2 c 3 = 0. (27)
For clarity, put
f = P ( d 2 − d 3 , d 3 − d 1 ) , g = P ( d 3 − d 2 , d 2 − d 1 ) , h = Q ( d 3 − d 1 , d 1 − d 2 ) , j = Q ( d 2 − d 1 , d 1 − d 3 ) , A = ( d 1 − d 2 ) d , B = ( d 1 − d 3 ) d , C = ( d 2 − d 3 ) d , n 2 = u c 3 f , n 3 = v c 2 g , η = n 2 / n 3 . \begin{aligned}
f&=P(d_2-d_3,d_3-d_1),&\qquad g&=P(d_3-d_2,d_2-d_1),\\
h&=Q(d_3-d_1,d_1-d_2),& j&=Q(d_2-d_1,d_1-d_3),\\
A&=(d_1-d_2)^d,& B&=(d_1-d_3)^d,& C&=(d_2-d_3)^d,\\
n_2&=uc_3f,& n_3&=vc_2g,& \eta&=n_2/n_3.
\end{aligned} f h A n 2 = P ( d 2 − d 3 , d 3 − d 1 ) , = Q ( d 3 − d 1 , d 1 − d 2 ) , = ( d 1 − d 2 ) d , = u c 3 f , g j B n 3 = P ( d 3 − d 2 , d 2 − d 1 ) , = Q ( d 2 − d 1 , d 1 − d 3 ) , = ( d 1 − d 3 ) d , = v c 2 g , C η = ( d 2 − d 3 ) d , = n 2 / n 3 .
The exact value is N = n 2 E 21 + n 3 E 31 N=n_2E_{21}+n_3E_{31} N = n 2 E 21 + n 3 E 31 . The trace-zero column calculation in the proof of Theorem 5.1, following (11) , gives the remaining four-column minor
j c 2 ( A η p v c 2 2 + f h u c 3 2 ) . (28) jc_2\left(A\eta pvc_2^2+fhuc_3^2\right). \tag*{(28)} j c 2 ( A η p v c 2 2 + f h u c 3 2 ) . (28)
Together with the four pure off-block Y Y Y columns already displayed there, it proves that Γ D \Gamma_D Γ D is smooth onto s l 3 \mathfrak{sl}_3 sl 3 at a nonempty open set of these star parameters. All the columns use hollow input variations or true simultaneous-conjugation directions; no variation of the diagonal parameters is needed.
We first identify a complete kernel tangent, since both the guard restoration and the tensor calculation depend on its full output. The hollow Y Y Y tangent image is spanned by the four off-block coordinates 12 , 13 , 21 , 31 12, 13, 21, 31 12 , 13 , 21 , 31 and the line E 22 − E 33 E_{22}-E_{33} E 22 − E 33 . Modulo this image, use coordinates ( 11 , 23 , 32 ) (11, 23, 32) ( 11 , 23 , 32 ) . The raw X X X directions E 12 , E 13 E_{12}, E_{13} E 12 , E 13 and the orbit directions generated by E 12 , E 13 E_{12}, E_{13} E 12 , E 13 have columns
R 2 = ( p A c 2 , 0 , h c 3 ) , R 3 = ( p B c 3 , j c 2 , 0 ) , O 2 = ( n 2 , 0 , − n 3 ) , O 3 = ( n 3 , − n 2 , 0 ) . R_2=(pAc_2,0,hc_3),\qquad R_3=(pBc_3,jc_2,0),\qquad O_2=(n_2,0,-n_3),\qquad O_3=(n_3,-n_2,0). R 2 = ( p A c 2 , 0 , h c 3 ) , R 3 = ( pB c 3 , j c 2 , 0 ) , O 2 = ( n 2 , 0 , − n 3 ) , O 3 = ( n 3 , − n 2 , 0 ) .
Set
L 2 = p A c 2 + η h c 3 , L 3 = p B c 3 + η − 1 j c 2 . (29) L_2=pAc_2+\eta hc_3,\qquad L_3=pBc_3+\eta^{-1}jc_2. \tag*{(29)} L 2 = p A c 2 + η h c 3 , L 3 = pB c 3 + η − 1 j c 2 . (29)
The following are variations of the actual auxiliary source at ( X , Y , I ) (X,Y,I) ( X , Y , I ) :
δ X = L 3 E 12 − L 2 E 13 , δ g = h c 3 L 3 n 3 E 12 − j c 2 L 2 n 2 E 13 , δ Y = L 2 L 3 p C u E 32 . (30) \begin{aligned}
\delta X&=L_3E_{12}-L_2E_{13},\\
\delta g&=\frac{hc_3L_3}{n_3}E_{12}-\frac{jc_2L_2}{n_2}E_{13},\\
\delta Y&=\frac{L_2L_3}{pCu}E_{32}. \tag*{(30)}
\end{aligned} δ X δ g δ Y = L 3 E 12 − L 2 E 13 , = n 3 h c 3 L 3 E 12 − n 2 j c 2 L 2 E 13 , = pC u L 2 L 3 E 32 . (30)
The first two lines have zero output in the displayed quotient. Their remaining output is − L 2 L 3 ( E 22 − E 33 ) -L_2L_3(E_{22}-E_{33}) − L 2 L 3 ( E 22 − E 33 ) . The last line cancels it, because d H D ( E 32 in Y ) = p C u ( E 22 − E 33 ) dH_D(E_{32}\text{ in }Y)=pCu(E_{22}-E_{33}) d H D ( E 32 in Y ) = pC u ( E 22 − E 33 ) . Thus the complete differential of Γ D \Gamma_D Γ D on (30) is zero. In particular, the Y 32 Y_{32} Y 32 correction cannot be omitted.
The two scalars L 2 , L 3 L_2,L_3 L 2 , L 3 are nonzero for generic star parameters. Independently add z 2 E 21 + z 3 E 31 z_2E_{21}+z_3E_{31} z 2 E 21 + z 3 E 31 to δ X \delta X δ X ; it has zero output, since every product of this lower column with the current Y Y Y is zero. For a fixed entry-weight matrix W W W as in the lemma, the determinant along any arc with this tangent has coefficient
[ t 2 ] det ( W ∘ X ( t ) ) = w 12 w 23 w 31 L 3 u z 3 − w 13 w 32 w 21 L 2 v z 2 . (31) [t^2]\det(W\circ X(t))=w_{12}w_{23}w_{31}L_3uz_3-w_{13}w_{32}w_{21}L_2vz_2. \tag*{(31)} [ t 2 ] det ( W ∘ X ( t )) = w 12 w 23 w 31 L 3 u z 3 − w 13 w 32 w 21 L 2 v z 2 . (31)
Indeed, a hollow 3 × 3 3\times3 3 × 3 determinant is the sum of its two oriented three-cycle products. Each such product here contains two entries vanishing at t = 0 t=0 t = 0 , so second-order corrections to the arc cannot affect this coefficient. The right side is a nonzero linear form in ( z 2 , z 3 ) (z_2,z_3) ( z 2 , z 3 ) . This applies to each w a b = ( d a − d b ) j w_{ab}=(d_a-d_b)^j w ab = ( d a − d b ) j , 0 ≤ j ≤ d 0\le j\le d 0 ≤ j ≤ d , and to every additional W W W under consideration. Choose ( z 2 , z 3 ) (z_2,z_3) ( z 2 , z 3 ) outside the finitely many kernels.
Let F \mathcal{F} F be the exact fiber Γ D − 1 ( N ) \Gamma_D^{-1}(N) Γ D − 1 ( N ) and let x ∗ x_\ast x ∗ be the chosen star point with auxiliary parameter I I I . The source and the map are smooth at x ∗ x_\ast x ∗ , so F \mathcal{F} F is smooth there, its local ring is a regular local domain, and the selected kernel tangent lifts to a formal arc in this same fiber. Formula (31) makes every required guard a nonzero element of that local domain. A chosen surjectivity minor is a unit. Their product therefore defines a nonempty open subset of the local fiber. More concretely, its formal point proves that the corresponding finite-type localization is nonempty, and over an algebraically closed coefficient field it has an actual point. Discarding the auxiliary g g g only conjugates the value; it does not change the raw guards or the saturated differential rank.
This argument also gives the precise continuation principle needed below. If a raw bilinear form T T T vanishes on all guarded good pairs, then its germ on F \mathcal{F} F at x ∗ x_\ast x ∗ is zero. Otherwise its product with the nonzero guard product would be nonzero in the local domain, and localizing also at T T T would give a guarded good pair with T ≠ 0 T\ne0 T = 0 . Consequently both the value of T T T and every kernel derivative of T T T vanish at each generic column star. We do not assert that the unguarded star itself satisfies the determinant guards.
The same continuation principle holds at row stars. Write R o p ( s , t ) = R ( t , s ) R^{\mathrm{op}}(s,t)=R(t,s) R op ( s , t ) = R ( t , s ) . Direct transposition gives
H P , Q ( D , X t , Y t ) = ϵ H Q o p , P o p ( D , X , Y ) t . (32) H_{P,Q}(D,X^{\mathsf t},Y^{\mathsf t})=\epsilon H_{Q^{\mathrm{op}},P^{\mathrm{op}}}(D,X,Y)^{\mathsf t}. \tag*{(32)} H P , Q ( D , X t , Y t ) = ϵ H Q op , P op ( D , X , Y ) t . (32)
The transformed endpoints are − p -p − p and ϵ p \epsilon p ϵ p , so the transformed pair again satisfies (26) . Moreover
ad D j ( X t ) = ( − 1 ) j ( ad D j X ) t . \operatorname{ad}^{j}_{D}(X^{\mathsf t})=(-1)^j(\operatorname{ad}^{j}_{D}X)^{\mathsf t}. ad D j ( X t ) = ( − 1 ) j ( ad D j X ) t .
Thus transposition preserves the guards on the first raw slot as well as the rank-one, square-zero and saturated smoothness conditions. Applying the column argument to the transformed symbols proves the row assertion for the original symbols.
We now compute the annihilator. Vanishing at the column stars and row stars, with each isolated vertex in turn, kills every coefficient T ( E a b , E c d ) T(E_{ab},E_{cd}) T ( E ab , E c d ) for which { a , b } ≠ { c , d } \{a,b\}\ne\{c,d\} { a , b } = { c , d } . To see the coverage explicitly, two different edges in a three-vertex set share exactly one endpoint. A column star covers either orientation of the complementary X X X edge with a Y Y Y edge ending at the isolated vertex, and a row star covers the orientations with that Y Y Y edge starting there. Independence of u u u , v v v , c 2 c_2 c 2 , c 3 c_3 c 3 then kills the individual coefficients.
At (27) , consider the raw variation
δ Y = u E 23 + ϵ v E 32 . (33) \delta Y = uE_{23} + \epsilon vE_{32}. \tag*{(33)} δ Y = u E 23 + ϵ v E 32 . (33)
It preserves the exact value: the new lower diagonal contributions are multiples of ϵ p + q = 0 \epsilon p + q = 0 ϵ p + q = 0 . Its tangent therefore belongs to the exact local fiber above. Since the germ of T T T on that fiber is zero, its derivative on this tangent is zero. Expanding in u u u , v v v and repeating with each isolated vertex gives
T ( E a b , E a b ) = 0 , T ( E b a , E a b ) = − ϵ T ( E a b , E b a ) ( a < b ) . T(E_{ab}, E_{ab}) = 0,\qquad T(E_{ba}, E_{ab}) = -\epsilon T(E_{ab}, E_{ba})\quad(a < b). T ( E ab , E ab ) = 0 , T ( E ba , E ab ) = − ϵ T ( E ab , E ba ) ( a < b ) .
Only this derivative of the germ is used; no guard condition on the points of the shifted-star family is being presumed. The remaining form has the shape
T ( X , Y ) = ∑ a < b c a b ( X a b Y b a − ϵ X b a Y a b ) . (34) T(X,Y) = \sum_{a<b} c_{ab}(X_{ab}Y_{ba} - \epsilon X_{ba}Y_{ab}). \tag*{(34)} T ( X , Y ) = a < b ∑ c ab ( X ab Y ba − ϵ X ba Y ab ) . (34)
Apply its derivative to the complete kernel tangent (30) . The result is
0 = c 12 c 2 L 3 − c 13 c 3 L 2 + c 23 p C L 2 L 3 . (35) 0 = c_{12}c_2L_3 - c_{13}c_3L_2 + \frac{c_{23}}{pC}L_2L_3. \tag*{(35)} 0 = c 12 c 2 L 3 − c 13 c 3 L 2 + pC c 23 L 2 L 3 . (35)
For fixed nonzero c 2 c_2 c 2 , c 3 c_3 c 3 , varying u / v u/v u / v makes η \eta η vary through a nonempty open subset of the multiplicative line; the smoothness restriction (28) removes only a proper closed subset. Hence (35) is a Laurent-polynomial identity in η \eta η . With ζ = c 23 / ( p C ) \zeta= c_{23}/(pC) ζ = c 23 / ( pC ) , its coefficients of η − 1 \eta^{-1} η − 1 and η \eta η respectively give
c 12 = − ζ p A , c 13 = ζ p B , ζ c 2 c 3 ( h j − p 2 A B ) = 0. (36) c_{12} = -\zeta pA,\qquad c_{13} = \zeta pB,\qquad\zeta c_2c_3(h_j - p^2AB) = 0. \tag*{(36)} c 12 = − ζ p A , c 13 = ζ pB , ζ c 2 c 3 ( h j − p 2 A B ) = 0. (36)
The final equation is the constant coefficient after the first two are substituted.
Suppose first that Q Q Q is not a monomial. Put x = d 2 − d 1 x = d_2 - d_1 x = d 2 − d 1 , y = d 3 − d 1 y = d_3 - d_1 y = d 3 − d 1 . If the norm difference in (36) vanished identically, it would give
Q ( y , − x ) Q ( x , − y ) = p 2 x d y d = q 2 x d y d . Q(y,-x)Q(x,-y) = p^2x^dy^d = q^2x^dy^d. Q ( y , − x ) Q ( x , − y ) = p 2 x d y d = q 2 x d y d .
Unique factorization forces both factors on the left to be monomials, and the invertible substitutions force Q Q Q itself to be a monomial, a contradiction. Thus h j − p 2 A B ≠ 0 h_j - p^2AB \ne0 h j − p 2 A B = 0 at the generic diagonal, so ζ = 0 \zeta= 0 ζ = 0 and T = 0 T = 0 T = 0 . If Q Q Q is a monomial but P P P is not, apply the same argument to the transformed pair in (32) and the form T ~ ( X , Y ) = T ( X t , Y t ) \widetilde{T}(X,Y) = T(X^{\mathsf t},Y^{\mathsf t}) T ( X , Y ) = T ( X t , Y t ) . Its reverse symbol P o p P^{\mathrm{op}} P op is not a monomial. This transposition, rather than an exchange of the two active inputs, retains the guard on the required raw X X X slot.
It remains to treat two monomial symbols. Write
P = α 0 s r t d − r , Q = β 0 s ℓ t d − ℓ , k = r + ℓ − d , σ = ( − 1 ) k . P = \alpha_0s^rt^{d-r},\qquad Q = \beta_0s^\ell t^{d-\ell},\qquad k = r+\ell-d,\qquad\sigma= (-1)^k. P = α 0 s r t d − r , Q = β 0 s ℓ t d − ℓ , k = r + ℓ − d , σ = ( − 1 ) k .
The endpoint condition says β 0 / α 0 = − σ \beta_0/\alpha_0 = -\sigma β 0 / α 0 = − σ . As in (14) , make the invertible hollow root-space changes U = a d D r X U = ad_D^rX U = a d D r X , V = a d D d − r Y V = ad_D^{d-r}Y V = a d D d − r Y . The present trace-zero normalization is
α 0 − 1 H D ( X , Y ) = J − ( U , V ) : = U V − σ a d D k ( V ) a d D − k ( U ) . (37) \alpha_0^{-1}H_D(X,Y) = J^-(U,V) := UV - \sigma\,ad_D^k(V)\,ad_D^{-k}(U). \tag*{(37)} α 0 − 1 H D ( X , Y ) = J − ( U , V ) := U V − σ a d D k ( V ) a d D − k ( U ) . (37)
Negative powers here mean only inverse root multipliers at the fixed regular diagonal. They do not change the original polynomial. Put a = x k a = x^k a = x k , b = y k b = y^k b = y k , c = ( y − x ) k c = (y-x)^k c = ( y − x ) k , all nonzero, and take the same support as (15) :
U = ( 0 1 − 1 0 0 a θ b 0 ) , V = E 21 + E 31 , θ ≠ 0. (38) U =
\begin{pmatrix}
0 & 1 & -1 \\
0 & 0 & a \\
\theta& b & 0
\end{pmatrix},
\qquad
V = E_{21} + E_{31},
\qquad
\theta\ne0. \tag*{(38)} U = 0 0 θ 1 0 b − 1 a 0 , V = E 21 + E 31 , θ = 0. (38)
Its exact normalized value is
J − ( U , V ) = ( 0 a b ) ( 1 − 1 / a 1 / b ) , J^-(U,V) =
\begin{pmatrix}
0\\
a\\
b
\end{pmatrix}
\begin{pmatrix}
1 & -1/a & 1/b
\end{pmatrix}, J − ( U , V ) = 0 a b ( 1 − 1/ a 1/ b ) ,
which is nonzero of rank one and square zero.
For completeness, the trace-zero tangent minor is recorded explicitly. Use the eight columns
u 12 , u 13 , u 23 , u 32 , v 12 , v 13 , v 21 , v 23 u_{12},u_{13},u_{23},u_{32},v_{12},v_{13},v_{21},v_{23} u 12 , u 13 , u 23 , u 32 , v 12 , v 13 , v 21 , v 23
and output rows ( 11 , 12 , 13 , 21 , 22 , 23 , 31 , 32 ) (11,12,13,21,22,23,31,32) ( 11 , 12 , 13 , 21 , 22 , 23 , 31 , 32 ) , with the last diagonal entry determined by trace zero. The entry formulas (17) apply with the sign of every reverse-order summand changed. Their indicated derivative matrix is
( 1 1 0 0 0 − θ 1 0 0 0 0 0 0 − b 2 / c 0 0 0 0 0 0 − σ a 2 / c 0 0 1 0 0 1 0 0 0 0 − c θ / b − 1 0 0 0 0 0 − 1 − b 0 − a / b 0 0 0 0 a / b 0 0 0 0 1 0 0 b 0 − b / a 0 0 0 θ 0 0 0 ) \begin{pmatrix}
1 & 1 & 0 & 0 & 0 & -\theta& 1 & 0 \\
0 & 0 & 0 & 0 & 0 & -b^{2}/c & 0 & 0 \\
0 & 0 & 0 & 0 & -\sigma a^{2}/c & 0 & 0 & 1 \\
0 & 0 & 1 & 0 & 0 & 0 & 0 & -c\theta/b \\
-1 & 0 & 0 & 0 & 0 & 0 & -1 & -b \\
0 & -a/b & 0 & 0 & 0 & 0 & a/b & 0 \\
0 & 0 & 0 & 1 & 0 & 0 & b & 0 \\
-b/a & 0 & 0 & 0 & \theta& 0 & 0 & 0
\end{pmatrix} 1 0 0 0 − 1 0 0 − b / a 1 0 0 0 0 − a / b 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 − σ a 2 / c 0 0 0 0 θ − θ − b 2 / c 0 0 0 0 0 0 1 0 0 0 − 1 a / b b 0 0 0 1 − c θ / b − b 0 0 0
Its determinant is
{ − a b ( θ c + 2 a b 2 ) / c 2 , σ = 1 , a b ( − θ c + 2 a b 2 ) / c 2 , σ = − 1. (39) \begin{cases}
-ab(\theta c+2ab^{2})/c^{2}, & \sigma=1,\\
ab(-\theta c+2ab^{2})/c^{2}, & \sigma=-1. \tag*{(39)}
\end{cases} { − ab ( θ c + 2 a b 2 ) / c 2 , ab ( − θ c + 2 a b 2 ) / c 2 , σ = 1 , σ = − 1. (39)
Choose θ ≠ 0 \theta\ne0 θ = 0 away from its one root. These hollow directions already give the required rank eight. Furthermore, the raw X X X has exactly one nonzero determinant cycle, X 12 X 23 X 31 X_{12}X_{23}X_{31} X 12 X 23 X 31 . Every ad D j \operatorname{ad}_{D}^{j} ad D j multiplies its factors by nonzero root differences, so all the guards hold at this very seed. Equations (36) leave at most the form
T = ζ p [ − A ( X 12 Y 21 − ϵ X 21 Y 12 ) + B ( X 13 Y 31 − ϵ X 31 Y 13 ) + C ( X 23 Y 32 − ϵ X 32 Y 23 ) ] . T=\zeta p\left[-A(X_{12}Y_{21}-\epsilon X_{21}Y_{12})+B(X_{13}Y_{31}-\epsilon X_{31}Y_{13})+C(X_{23}Y_{32}-\epsilon X_{32}Y_{23})\right]. T = ζ p [ − A ( X 12 Y 21 − ϵ X 21 Y 12 ) + B ( X 13 Y 31 − ϵ X 31 Y 13 ) + C ( X 23 Y 32 − ϵ X 32 Y 23 ) ] .
At (38) , undoing the root-space changes gives
T ( X , Y ) = − 2 ζ α 0 . T(X,Y)=-2\zeta\alpha_{0}. T ( X , Y ) = − 2 ζ α 0 .
Indeed, only Y 21 , Y 31 Y_{21},Y_{31} Y 21 , Y 31 are nonzero, and the two contributions inside the brackets both equal − ( − 1 ) d − r -(-1)^{d-r} − ( − 1 ) d − r , while p = α 0 ( − 1 ) d − r p=\alpha_{0}(-1)^{d-r} p = α 0 ( − 1 ) d − r . Thus ζ = 0 \zeta=0 ζ = 0 also in the last case. This proves the lemma. □
The four-vertex tensor coefficients.
Proof of Theorem 6.7 . Size three is Lemma 6.8. By the guarded extension and support argument of Lemmas 6.4 and 6.5 , size four is the only further tensor calculation needed. We give that calculation at one fixed generic D = diag ( d 1 , d 2 , d 3 , d 4 ) D=\operatorname{diag}(d_{1},d_{2},d_{3},d_{4}) D = diag ( d 1 , d 2 , d 3 , d 4 ) .
Let T T T be a bilinear form on V 4 × V 4 V_{4}\times V_{4} V 4 × V 4 vanishing on all guarded good pairs. Restriction to each three-vertex set is zero. Here the use of the extension lemma is essential: if H D 0 ( X 0 , Y 0 ) = u 0 v 0 T H_{D_{0}}(X_{0},Y_{0})=u_{0}v_{0}^{\mathsf{T}} H D 0 ( X 0 , Y 0 ) = u 0 v 0 T is an old guarded seed, its provisional extension has new lower Y Y Y row λ v 0 T G − 1 \lambda v_{0}^{\mathsf{T}}G^{-1} λ v 0 T G − 1 and X = diag ( X 0 , 0 ) X=\operatorname{diag}(X_{0},0) X = diag ( X 0 , 0 ) . A nonzero value of T T T there would survive restoration of the guards in its exact fiber. Thus the provisional value is zero for every λ ≠ 0 \lambda\ne0 λ = 0 . Its constant term in λ \lambda λ is the value of the restriction of T T T at the old seed, so the size-three tensor span makes that restriction zero. Consequently we may write
T ( X , Y ) = ∑ a , b , c , e pairwise distinct C a b , c e X a b Y c e . (40) T(X,Y)=\sum_{\substack{a,b,c,e\\\text{pairwise distinct}}}C_{ab,ce}X_{ab}Y_{ce}. \tag*{(40)} T ( X , Y ) = a , b , c , e pairwise distinct ∑ C ab , ce X ab Y ce . (40)
Designate vertex 4 4 4 as new, and isolate vertex 1 1 1 in the old three-vertex block. Write z = d 4 z=d_{4} z = d 4 , D 0 = diag ( d 1 , d 2 , d 3 ) D_{0}=\operatorname{diag}(d_{1},d_{2},d_{3}) D 0 = diag ( d 1 , d 2 , d 3 ) . Start with the generic column star (27) , whose value is N 0 = n e 1 T N_{0}=n e_{1}^{\mathsf{T}} N 0 = n e 1 T , where
n = ( 0 , n 2 , n 3 ) T . n=(0,n_{2},n_{3})^{\mathsf{T}}. n = ( 0 , n 2 , n 3 ) T .
The two rectangle matrices of Lemma 6.4 , in the convention of (18) , are
F ( z ) a b = P ( d a − d b , d b − z ) X a b , F(z)_{ab}=P(d_{a}-d_{b},d_{b}-z)X_{ab}, F ( z ) ab = P ( d a − d b , d b − z ) X ab ,
G ( z ) a b = Q ( z − d a , d a − d b ) X a b ( a ≠ b ) , F ( z ) a a = G ( z ) a a = 0. (41) G(z)_{ab}=Q(z-d_{a},d_{a}-d_{b})X_{ab}\qquad(a\ne b),\qquad F(z)_{aa}=G(z)_{aa}=0. \tag*{(41)} G ( z ) ab = Q ( z − d a , d a − d b ) X ab ( a = b ) , F ( z ) aa = G ( z ) aa = 0. (41)
At the generic four-tuple each of these six weights is nonzero: the two displayed arguments are independent diagonal differences. They are fixed constants during the following deformation.
Use the exact-fiber tangent and formal arc from the proof of Lemma 6.8, imposing also det F ( z ) ≠ 0 \det F(z) \ne0 det F ( z ) = 0 and det G ( z ) ≠ 0 \det G(z) \ne0 det G ( z ) = 0 as its additional entry-weight guards. Formula (31) permits all these choices simultaneously. Thus there is an arc
( X ( t ) , Y ( t ) , g ( t ) ) ∈ Γ D 0 − 1 ( N 0 ) , g ( t ) = I + O ( t ) , (X(t),Y(t),g(t)) \in\Gamma_{D_0}^{-1}(N_0), \qquad g(t)=I+O(t), ( X ( t ) , Y ( t ) , g ( t )) ∈ Γ D 0 − 1 ( N 0 ) , g ( t ) = I + O ( t ) ,
on which every required determinant has nonzero quadratic leading term. Only the raw X , Y X,Y X , Y and the auxiliary g g g vary with t t t . The diagonal entries d 1 , d 2 , d 3 , z d_1,d_2,d_3,z d 1 , d 2 , d 3 , z , and the coefficients of T T T , do not vary. The surjectivity minor at the initial star remains a unit. The raw old value factors as
H D 0 ( X ( t ) , Y ( t ) ) = g ( t ) − 1 N 0 g ( t ) = u ( t ) v ( t ) t , H_{D_0}(X(t),Y(t))=g(t)^{-1}N_0g(t)=u(t)v(t)^{\mathsf{t}}, H D 0 ( X ( t ) , Y ( t )) = g ( t ) − 1 N 0 g ( t ) = u ( t ) v ( t ) t ,
u ( t ) = g ( t ) − 1 n , u(t)=g(t)^{-1}n, u ( t ) = g ( t ) − 1 n ,
v ( t ) t = e 1 t g ( t ) = e 1 t + O ( t ) . (42) v(t)^{\mathsf{t}}=e_1^{\mathsf{t}}g(t)=e_1^{\mathsf{t}}+O(t). \tag*{(42)} v ( t ) t = e 1 t g ( t ) = e 1 t + O ( t ) . (42)
The change of the right factor will be included in the inverse calculation; it is not replaced by the constant row e 1 t e_1^{\mathsf{t}} e 1 t .
Split G ( z ) G(z) G ( z ) into vertex 1 and the block B = { 2 , 3 } B=\{2,3\} B = { 2 , 3 } :
G ( z , t ) = ( 0 ρ ( t ) κ ( t ) B ( t ) ) . G(z,t)=
\begin{pmatrix}
0 & \rho(t)\\
\kappa(t) & B(t)
\end{pmatrix}. G ( z , t ) = ( 0 κ ( t ) ρ ( t ) B ( t ) ) .
At t = 0 t=0 t = 0 , B ( 0 ) B(0) B ( 0 ) is the invertible hollow two-by-two block whose entries are the nonzero weights in (41) times u u u , v v v . Both ρ ( t ) \rho(t) ρ ( t ) and κ ( t ) \kappa(t) κ ( t ) are O ( t ) O(t) O ( t ) . Its scalar Schur complement satisfies
s ( t ) = − ρ ( t ) B ( t ) − 1 κ ( t ) = γ t 2 + O ( t 3 ) , γ ≠ 0 , (43) s(t)=-\rho(t)B(t)^{-1}\kappa(t)=\gamma t^2+O(t^3), \qquad\gamma\ne0, \tag*{(43)} s ( t ) = − ρ ( t ) B ( t ) − 1 κ ( t ) = γ t 2 + O ( t 3 ) , γ = 0 , (43)
because det G ( z , t ) = det B ( t ) s ( t ) \det G(z,t)=\det B(t)s(t) det G ( z , t ) = det B ( t ) s ( t ) and its quadratic coefficient was required to be nonzero. Write v ( t ) t = ( v 1 ( t ) , v B ( t ) ) v(t)^{\mathsf{t}}=(v_1(t),v_B(t)) v ( t ) t = ( v 1 ( t ) , v B ( t )) . The block inverse gives exactly
( v ( t ) t G ( z , t ) − 1 ) 1 = ( v 1 − v B B − 1 κ ) s − 1 , \left(v(t)^{\mathsf{t}}G(z,t)^{-1}\right)_1
=\left(v_1-v_BB^{-1}\kappa\right)s^{-1}, ( v ( t ) t G ( z , t ) − 1 ) 1 = ( v 1 − v B B − 1 κ ) s − 1 ,
( v ( t ) t G ( z , t ) − 1 ) B = − ( v 1 − v B B − 1 κ ) s − 1 ρ B − 1 + v B B − 1 . \left(v(t)^{\mathsf{t}}G(z,t)^{-1}\right)_B
=-\left(v_1-v_BB^{-1}\kappa\right)s^{-1}\rho B^{-1}+v_BB^{-1}. ( v ( t ) t G ( z , t ) − 1 ) B = − ( v 1 − v B B − 1 κ ) s − 1 ρ B − 1 + v B B − 1 .
Here v 1 = 1 + O ( t ) v_1=1+O(t) v 1 = 1 + O ( t ) and v B = O ( t ) v_B=O(t) v B = O ( t ) , so the Schur correction v B B − 1 κ v_BB^{-1}\kappa v B B − 1 κ is O ( t 2 ) O(t^2) O ( t 2 ) . In particular,
( v ( t ) t G ( z , t ) − 1 ) 1 = γ − 1 t − 2 + O ( t − 1 ) , ( v ( t ) t G ( z , t ) − 1 ) 2 , ( v ( t ) t G ( z , t ) − 1 ) 3 = O ( t − 1 ) . (44) \left(v(t)^{\mathsf{t}}G(z,t)^{-1}\right)_1
=\gamma^{-1}t^{-2}+O(t^{-1}), \qquad
\left(v(t)^{\mathsf{t}}G(z,t)^{-1}\right)_2,
\left(v(t)^{\mathsf{t}}G(z,t)^{-1}\right)_3=O(t^{-1}). \tag*{(44)} ( v ( t ) t G ( z , t ) − 1 ) 1 = γ − 1 t − 2 + O ( t − 1 ) , ( v ( t ) t G ( z , t ) − 1 ) 2 , ( v ( t ) t G ( z , t ) − 1 ) 3 = O ( t − 1 ) . (44)
Thus the moving auxiliary conjugation does not cancel the leading pole.
Over the Laurent extension field form the provisional size-four input
X ^ = ( X ( t ) 0 0 0 ) , Y ^ = ( Y ( t ) 0 v ( t ) t G ( z , t ) − 1 0 ) . (45) \widehat{X}=
\begin{pmatrix}
X(t)&0\\
0&0
\end{pmatrix},
\qquad
\widehat{Y}=
\begin{pmatrix}
Y(t)&0\\
v(t)^{\mathsf{t}}G(z,t)^{-1}&0
\end{pmatrix}. \tag*{(45)} X = ( X ( t ) 0 0 0 ) , Y = ( Y ( t ) v ( t ) t G ( z , t ) − 1 0 0 ) . (45)
The complete output, not merely its leading term, is
H D ( X ^ , Y ^ ) = ( u ( t ) v ( t ) t 0 v ( t ) t 0 ) = ( u ( t ) 1 ) ( v ( t ) t 0 ) . H_D(\widehat{X},\widehat{Y})
=
\begin{pmatrix}
u(t)v(t)^{\mathsf{t}}&0\\
v(t)^{\mathsf{t}}&0
\end{pmatrix}
=
\begin{pmatrix}
u(t)\\
1
\end{pmatrix}
\begin{pmatrix}
v(t)^{\mathsf{t}}&0
\end{pmatrix}. H D ( X , Y ) = ( u ( t ) v ( t ) t v ( t ) t 0 0 ) = ( u ( t ) 1 ) ( v ( t ) t 0 ) .
It is nonzero of rank one and square zero. The rectangle matrices are invertible, so Lemma 6.4 gives saturated smoothness at this provisional point as well as restoration of all size-four raw X X X guards while retaining any raw function nonzero there.
By (40) , terms supported on three old vertices are absent. The raw X X X rectangles involving the new vertex are zero. Equations (27) and (44) therefore give
[ t − 2 ] T ( X ^ , Y ^ ) = γ − 1 ( C 23 , 41 u + C 32 , 41 v ) . (46) [t^{-2}]T(\widehat{X},\widehat{Y})
=\gamma^{-1}(C_{23,41}u+C_{32,41}v). \tag*{(46)} [ t − 2 ] T ( X , Y ) = γ − 1 ( C 23 , 41 u + C 32 , 41 v ) . (46)
Indeed, terms with Y 42 Y_{42} Y 42 or Y 43 Y_{43} Y 43 must use an old X X X edge incident to vertex 1. Such X X X entries are O ( t ) O(t) O ( t ) , whereas those two Y Y Y entries are only O ( t − 1 ) O(t^{-1}) O ( t − 1 ) , so they cannot contribute to the displayed coefficient. The only possible order t − 2 t^{-2} t − 2 terms use Y 41 Y_{41} Y 41 and X 23 = u + O ( t ) X_{23}=u+O(t) X 23 = u + O ( t ) or X 32 = v + O ( t ) X_{32}=v+O(t) X 32 = v + O ( t ) . If either of the two coefficients on the right of (46) were nonzero, choose the independent generic star parameters u , v u,v u , v so that their displayed linear combination is nonzero, retaining the finitely many smoothness and guard conditions. Then T T T is nonzero at the provisional Laurent input. The guard-restoration part of Lemma 6.4 supplies, over an algebraically closed extension field, a guarded good raw pair with T ≠ 0 T \ne0 T = 0 . To turn this into the required contradiction at the fixed generic D D D , use the finite-type incidence defined by the conditions
rank H D ( X , Y ) = 1 , H D ( X , Y ) 2 = 0 , H D ( X , Y ) ≠ 0 , \operatorname{rank} H_D(X,Y)=1,\quad H_D(X,Y)^2=0,\quad H_D(X,Y)\ne0, rank H D ( X , Y ) = 1 , H D ( X , Y ) 2 = 0 , H D ( X , Y ) = 0 ,
d Γ D onto s l 4 , ∏ j = 0 d det ( ad D j X ) ≠ 0 , T ( X , Y ) ≠ 0. d\Gamma_D\ \text{onto}\ \mathfrak{sl}_4,\quad\prod_{j=0}^{d}\det(\operatorname{ad}_{D}^{j}X)\ne0,\quad T(X,Y)\ne0. d Γ D onto sl 4 , j = 0 ∏ d det ( ad D j X ) = 0 , T ( X , Y ) = 0.
Rank one and the differential condition are imposed on the appropriate open minor charts. The construction gives a point of this incidence over an extension of the fixed diagonal coefficient field, so it is nonempty. The algebraically closed coefficient field therefore supplies an actual point, contradicting the hypothesis on T T T . It is the incidence of raw rank-one square-zero values, smoothness, guards and T ≠ 0 T \ne0 T = 0 that is descended here. We do not attempt to descend an exact target fiber whose target coordinates have themselves become Laurent series.
It follows that C 23 , 41 = C 32 , 41 = 0 C_{23,41}=C_{32,41}=0 C 23 , 41 = C 32 , 41 = 0 . The same argument with each isolated old vertex kills all disjoint-edge coefficients whose Y Y Y edge points from the designated new vertex. Transposition (32), applied to the transformed symbol pair and transformed bilinear form, gives the identical lower-row argument for coefficients whose Y Y Y edge points to that vertex. It preserves all the raw X X X guards and does not invoke the size-four conclusion being proved. Finally the designation of the new vertex is free: for any tested Y Y Y edge one may designate either of its endpoints as the new vertex and use the other three vertices as the old block. This relabeling includes terms whose X X X edge contains the original label 4; permuting only the old three labels would not suffice. Every coefficient in (40) is zero.
This proves guarded size-four spanning. Lemma 6.5 now proves it in every size n ≥ 5 n \ge5 n ≥ 5 : a pair of hollow matrix units uses at most four vertices and is contained in an ( n − 1 ) (n-1) ( n − 1 ) -vertex set. The induction is carried out over the generic diagonal field. For each old vertex subset, its finite spanning collection may first be chosen over the algebraic closure of its own diagonal field; the added eigenvalue is transcendental over those old seed data. The rectangle inverses in Lemma 6.4 therefore exist by their invertible leading coefficients. Scalar extension preserves the old span, even when the coefficients of T T T depend on all diagonal entries. Thus no incompatible numerical diagonal choices are made at different stages. Lemma 6.6 then supplies one nonempty open Ω n \Omega_n Ω n and actual spanning collections at every D ∈ Ω n D \in\Omega_n D ∈ Ω n .
The full-matrix detection statement now follows from Lemma 6.3 . Its hypothesis holds because s t st s t divides both complete symbols, so adding arbitrary diagonal parts to the two original active inputs does not change the value or the available hollow and simultaneous-conjugation smoothness controls.
The complete zero-endpoint seed detector
We retain the notation H D H_D H D , V n V_n V n , and Γ D \Gamma_D Γ D and the adjoint-power guards introduced above. Throughout this subsection
P ( 1 , − 1 ) = Q ( 1 , − 1 ) = 0 , ( P , Q ) ≠ ( 0 , 0 ) . P(1,-1)=Q(1,-1)=0,\qquad(P,Q)\ne(0,0). P ( 1 , − 1 ) = Q ( 1 , − 1 ) = 0 , ( P , Q ) = ( 0 , 0 ) .
Since s t st s t divides both symbols, every nonzero symbol is divisible by s t ( s + t ) st(s+t) s t ( s + t ) , and in particular d ≥ 3 d \ge3 d ≥ 3 . For path indices put
P i k j = P ( d i − d k , d k − d j ) , Q i k j = Q ( d i − d k , d k − d j ) . P_{ikj}=P(d_i-d_k,d_k-d_j),\qquad Q_{ikj}=Q(d_i-d_k,d_k-d_j). P ik j = P ( d i − d k , d k − d j ) , Q ik j = Q ( d i − d k , d k − d j ) .
At diagonal D D D the complete map, including both orders, satisfies
( H D ( X , Y ) ) i j = ∑ k ( P i k j X i k Y k j + Q i k j Y i k X k j ) , ( H D ( X , Y ) ) i i = 0. (47) \bigl(H_D(X,Y)\bigr)_{ij}=\sum_k\left(P_{ikj}X_{ik}Y_{kj}+Q_{ikj}Y_{ik}X_{kj}\right),\qquad\bigl(H_D(X,Y)\bigr)_{ii}=0. \tag*{(47)} ( H D ( X , Y ) ) ij = k ∑ ( P ik j X ik Y k j + Q ik j Y ik X k j ) , ( H D ( X , Y ) ) ii = 0. (47)
The terms with k = i k=i k = i or k = j k=j k = j vanish. Thus H D H_D H D maps V n × V n V_n \times V_n V n × V n into V n V_n V n .
Theorem 6.9 (Zero-endpoint detection in every size). For every n ≥ 3 n \ge3 n ≥ 3 there is a nonempty Zariski-open set Ω n \Omega_n Ω n of regular diagonal matrices such that, at each fixed D ∈ Ω n D \in\Omega_n D ∈ Ω n , the tensors X ⊗ Y X \otimes Y X ⊗ Y , ( X , Y ) ∈ G D (X,Y) \in\mathcal{G}_D ( X , Y ) ∈ G D , span V n ⊗ V n V_n \otimes V_n V n ⊗ V n . Thus these are actual nonzero rank-one square-zero values, and d Γ D d\Gamma_D d Γ D is onto s l n \mathfrak{sl}_n sl n at ( X , Y , I ) (X,Y,I) ( X , Y , I ) . For n ≥ 4 n \ge4 n ≥ 4 the same spanning assertion holds for G D g u a r d \mathcal{G}_D^{\mathrm{guard}} G D guard , with all adjoint-power guards on the raw first input X X X . Allowing arbitrary diagonal additions to the original X X X and Y Y Y gives tensors spanning M n ⊗ M n M_n \otimes M_n M n ⊗ M n .
The one-order fixed-input operators are given in Theorem 4.1 and Corollary 4.2. The size-three star differential is also contained in the proof of Theorem 5.1 . We write the cycle operators in the convention (7) and prove the tensor-detection and exact-fiber assertions below.
The common-zero-row detector in size three.
Lemma 6.10. The unguarded hollow assertion of Theorem 6.9 holds in size three, including either one-order boundary.
Proof. Choose one regular diagonal D D D for which every triple-distinct evaluation of every nonzero symbol is nonzero. These are finitely many nonzero polynomial conditions: for a fixed triple the two successive differences are independent linear coordinates. Their simultaneous nonvanishing therefore defines a nonempty open set.
Fix an index i i i , and let R i ⊂ V 3 R_i \subset V_3 R i ⊂ V 3 be the linear space of hollow matrices with row i i i zero. For X , Y ∈ R i X,Y \in R_i X , Y ∈ R i their complementary two-by-two hollow blocks have products supported on the diagonal. Those diagonal contributions vanish in (47). Consequently H D ( X , Y ) H_D(X,Y) H D ( X , Y ) is supported on column i i i , off its diagonal. Every nonzero value on R i × R i R_i \times R_i R i × R i is therefore rank one and square-zero. We show that a nonempty open subset of this entire irreducible pair space consists of smooth seeds.
Relabel i = 1 i=1 i = 1 . If both symbols are nonzero, take
X = u E 23 + v E 32 , Y = c 2 E 21 + c 3 E 31 , u v c 2 c 3 ≠ 0. X = uE_{23} + vE_{32}, \qquad Y = c_2E_{21} + c_3E_{31}, \qquad uv c_2c_3 \ne0. X = u E 23 + v E 32 , Y = c 2 E 21 + c 3 E 31 , uv c 2 c 3 = 0. The value is
N = n 2 E 21 + n 3 E 31 , n 2 = P 231 u c 3 , n 3 = P 321 v c 2 , N = n_2E_{21} + n_3E_{31}, \qquad n_2 = P_{231}uc_3, \qquad n_3 = P_{321}vc_2, N = n 2 E 21 + n 3 E 31 , n 2 = P 231 u c 3 , n 3 = P 321 v c 2 , with n 2 n 3 ≠ 0 n_2n_3 \ne0 n 2 n 3 = 0 . Four actual Y Y Y variations and two actual X X X variations give the following pure hollow directions:
Table 1.
Here each variation denotes a unit change of the indicated raw entry. All multipliers are nonzero; any potential diagonal contribution is zero by the endpoint hypothesis. The fixed-D D D derivative therefore fills V 3 V_3 V 3 . The orbit directions generated by E 12 , E 13 E_{12}, E_{13} E 12 , E 13 have diagonal projections n 2 ( E 11 − E 22 ) n_2(E_{11} - E_{22}) n 2 ( E 11 − E 22 ) and n 3 ( E 11 − E 33 ) n_3(E_{11} - E_{33}) n 3 ( E 11 − E 33 ) . Thus d Γ D d\Gamma_D d Γ D has rank eight.
If Q = 0 Q=0 Q = 0 and P ≠ 0 P\ne0 P = 0 , instead take both X X X and Y Y Y in R 1 R_1 R 1 with all four entries 21, 31, 23, 32 nonzero. The output again has both lower column entries nonzero. The Y Y Y variations E 21 , E 31 E_{21}, E_{31} E 21 , E 31 give the two pure lower-column directions, with multipliers P 321 X 32 P_{321}X_{32} P 321 X 32 and P 231 X 23 P_{231}X_{23} P 231 X 23 . The X X X variations E 12 , E 13 E_{12}, E_{13} E 12 , E 13 give the two pure upper-row directions, with multipliers P 123 Y 23 P_{123}Y_{23} P 123 Y 23 and P 132 Y 32 P_{132}Y_{32} P 132 Y 32 . Finally the Y Y Y variations E 12 , E 13 E_{12}, E_{13} E 12 , E 13 give the two lower off-diagonal directions, with multipliers P 312 X 31 P_{312}X_{31} P 312 X 31 and P 213 X 21 P_{213}X_{21} P 213 X 21 . Thus the fixed-D D D hollow derivative is again onto, and the same two orbit directions complete it to s l 3 \mathfrak{sl}_3 sl 3 . If P = 0 P=0 P = 0 , exchange the actual input slots. This proves the required nonempty openness for every R i × R i R_i \times R_i R i × R i .
Let a bilinear form T T T vanish on all smooth nilpotent seeds. Its restriction to R i × R i R_i \times R_i R i × R i vanishes on a nonempty open subset, hence vanishes identically. Given any two hollow units E a b E_{ab} E ab and E c d E_{cd} E c d , there is an index i i i different from both row indices a , c a,c a , c . Both units belong to R i R_i R i , so T ( E a b , E c d ) = 0 T(E_{ab},E_{cd})=0 T ( E ab , E c d ) = 0 . All hollow tensor coefficients vanish. This is a size-three argument: the complementary block has size two, and no common-zero-row assertion in larger size is being used.
A nonzero cubic cycle norm.
Set u = − s − t u=-s-t u = − s − t and define the homogeneous polynomial
Δ P , Q ( s , t ) = P ( s , t ) P ( t , u ) P ( u , s ) + Q ( s , t ) Q ( t , u ) Q ( u , s ) . (48) \Delta_{P,Q}(s,t) = P(s,t)P(t,u)P(u,s) + Q(s,t)Q(t,u)Q(u,s). \tag*{(48)} Δ P , Q ( s , t ) = P ( s , t ) P ( t , u ) P ( u , s ) + Q ( s , t ) Q ( t , u ) Q ( u , s ) . (48)
Its coefficients are cubic polynomials in the symbol coefficients. A nonzero one-order symbol has nonzero cycle norm, since all three linear substitutions in its product are invertible.
Lemma 6.11. If Δ P , Q ≠ 0 \Delta_{P,Q} \ne0 Δ P , Q = 0 , then for every n ≥ 3 n \ge3 n ≥ 3 the determinant of
L D , X : V n ⟶ V n , Y ⟼ H D ( X , Y ) , L_{D,X} : V_n \longrightarrow V_n, \qquad Y \longmapsto H_D(X,Y), L D , X : V n ⟶ V n , Y ⟼ H D ( X , Y ) ,
is a nonzero polynomial in diagonal D D D and hollow X X X . Consequently, for D D D in a nonempty regular-diagonal open set there is a dense open set of hollow X X X on which L D , X L_{D,X} L D , X is invertible, even after imposing all adjoint-power guards on X X X .
Proof. First take n = 3 n=3 n = 3 . Use input order
( Y 13 , Y 21 , Y 32 ; Y 12 , Y 23 , Y 31 ) (Y_{13},Y_{21},Y_{32};Y_{12},Y_{23},Y_{31}) ( Y 13 , Y 21 , Y 32 ; Y 12 , Y 23 , Y 31 )
and output order
( H 12 , H 23 , H 31 ; H 13 , H 21 , H 32 ) . (H_{12},H_{23},H_{31};H_{13},H_{21},H_{32}). ( H 12 , H 23 , H 31 ; H 13 , H 21 , H 32 ) .
In these orders the full matrix of L D , X L_{D,X} L D , X is block diagonal with blocks
( Q 132 X 32 0 P 132 X 13 P 213 X 21 Q 213 X 13 0 0 P 321 X 32 Q 321 X 21 ) , ( Q 123 X 23 P 123 X 12 0 0 Q 231 X 31 P 231 X 23 P 312 X 31 0 Q 312 X 12 ) . (49) \left(
\begin{array}{ccc}
Q_{132}X_{32} & 0 & P_{132}X_{13}\\
P_{213}X_{21} & Q_{213}X_{13} & 0\\
0 & P_{321}X_{32} & Q_{321}X_{21}
\end{array}
\right),
\qquad
\left(
\begin{array}{ccc}
Q_{123}X_{23} & P_{123}X_{12} & 0\\
0 & Q_{231}X_{31} & P_{231}X_{23}\\
P_{312}X_{31} & 0 & Q_{312}X_{12}
\end{array}
\right). \tag*{(49)} Q 132 X 32 P 213 X 21 0 0 Q 213 X 13 P 321 X 32 P 132 X 13 0 Q 321 X 21 , Q 123 X 23 0 P 312 X 31 P 123 X 12 Q 231 X 31 0 0 P 231 X 23 Q 312 X 12 . (49)
Their determinants are respectively
X 13 X 21 X 32 ( P 132 P 213 P 321 + Q 132 Q 213 Q 321 ) , X_{13}X_{21}X_{32}(P_{132}P_{213}P_{321}+Q_{132}Q_{213}Q_{321}), X 13 X 21 X 32 ( P 132 P 213 P 321 + Q 132 Q 213 Q 321 ) ,
X 12 X 23 X 31 ( P 123 P 231 P 312 + Q 123 Q 231 Q 312 ) . X_{12}X_{23}X_{31}(P_{123}P_{231}P_{312}+Q_{123}Q_{231}Q_{312}). X 12 X 23 X 31 ( P 123 P 231 P 312 + Q 123 Q 231 Q 312 ) .
For s = d 1 − d 2 s=d_1-d_2 s = d 1 − d 2 , t = d 2 − d 3 t=d_2-d_3 t = d 2 − d 3 , and u = d 3 − d 1 u=d_3-d_1 u = d 3 − d 1 , the second parenthesis is Δ P , Q ( s , t ) \Delta_{P,Q}(s,t) Δ P , Q ( s , t ) and the first is ( − 1 ) 3 d Δ P , Q ( t , s ) (-1)^{3d}\Delta_{P,Q}(t,s) ( − 1 ) 3 d Δ P , Q ( t , s ) . Hence, with precisely the displayed input and output orders,
det L D , X = ( − 1 ) 3 d ( ∏ i ≠ j X i j ) Δ P , Q ( s , t ) Δ P , Q ( t , s ) . (50) \det L_{D,X}=(-1)^{3d}\left(\prod_{i\ne j}X_{ij}\right)\Delta_{P,Q}(s,t)\Delta_{P,Q}(t,s). \tag*{(50)} det L D , X = ( − 1 ) 3 d i = j ∏ X ij Δ P , Q ( s , t ) Δ P , Q ( t , s ) . (50)
A different pair of coordinate orders changes only the overall sign. When the cycle norm is nonzero, a regular D D D making both factors nonzero exists. This gives the size-three assertion.
For the induction with both symbols nonzero, suppose that, at one fixed regular diagonal D 0 D_0 D 0 of size h h h , the determinant of L D 0 , X L_{D_0,X} L D 0 , X is a nonzero polynomial in X ∈ V h X\in V_h X ∈ V h . For each 0 ≤ j ≤ d 0\le j\le d 0 ≤ j ≤ d , the polynomial det ( ad D 0 j X ) \det(\operatorname{ad}_{D_0}^{j}X) det ( ad D 0 j X ) is also nonzero: a matrix supported on a Hamiltonian directed cycle is invertible and remains invertible after its edges are multiplied by the corresponding nonzero j j j th powers of root differences. The intersection of these finitely many nonempty opens in the full affine space V h V_h V h is nonempty. Choose X 0 X_0 X 0 in it. This intersection takes place before any nilpotent-value condition is imposed.
Put
D = diag ( D 0 , z ) , E = D 0 − z I h , X = ( X 0 0 0 0 ) , Y = ( B v w 0 ) , B ∈ V h . D=\operatorname{diag}(D_0,z),\qquad E=D_0-zI_h,\qquad X=\left(\begin{array}{cc}X_0&0\\0&0\end{array}\right),\qquad Y=\left(\begin{array}{cc}B&v\\w&0\end{array}\right),\qquad B\in V_h. D = diag ( D 0 , z ) , E = D 0 − z I h , X = ( X 0 0 0 0 ) , Y = ( B w v 0 ) , B ∈ V h .
The complete hollow operator splits into three independent blocks:
H D ( X , Y ) = ( L D 0 , X 0 ( B ) F ( z ) v w G ( z ) 0 ) , F ( z ) = ∑ r + s = d P r s ( ad D 0 r X 0 ) E s , G ( z ) = ∑ r + s = d Q r s ( − 1 ) r E r ( ad D 0 s X 0 ) . (51) H_D(X,Y)=
\left(
\begin{array}{cc}
L_{D_0,X_0}(B) & F(z)v\\
wG(z) & 0
\end{array}
\right),
\qquad
\begin{aligned}
F(z)&=\sum_{r+s=d}P_{rs}(\operatorname{ad}_{D_0}^{r}X_0)E^s,\\
G(z)&=\sum_{r+s=d}Q_{rs}(-1)^rE^r(\operatorname{ad}_{D_0}^{s}X_0).
\end{aligned} \tag*{(51)} H D ( X , Y ) = ( L D 0 , X 0 ( B ) w G ( z ) F ( z ) v 0 ) , F ( z ) G ( z ) = r + s = d ∑ P r s ( ad D 0 r X 0 ) E s , = r + s = d ∑ Q r s ( − 1 ) r E r ( ad D 0 s X 0 ) . (51)
In particular these rectangles use the full P , Q P,Q P , Q coefficients. Let s ∗ = max { s : P d − s , s ≠ 0 } s_*=\max\{s:P_{d-s,s}\ne0\} s ∗ = max { s : P d − s , s = 0 } and r ∗ = max { r : Q r , d − r ≠ 0 } r_*=\max\{r:Q_{r,d-r}\ne0\} r ∗ = max { r : Q r , d − r = 0 } . Their leading coefficients as matrix polynomials in z z z are
[ z s ∗ ] F = P d − s ∗ , s ∗ ( − 1 ) s ∗ ad D 0 d − s ∗ X 0 , [ z r ∗ ] G = Q r ∗ , d − r ∗ ad D 0 d − r ∗ X 0 . (52) [z^{s_*}]F=P_{d-s_*,s_*}(-1)^{s_*}\operatorname{ad}_{D_0}^{d-s_*}X_0,\qquad
[z^{r_*}]G=Q_{r_*,d-r_*}\operatorname{ad}_{D_0}^{d-r_*}X_0. \tag*{(52)} [ z s ∗ ] F = P d − s ∗ , s ∗ ( − 1 ) s ∗ ad D 0 d − s ∗ X 0 , [ z r ∗ ] G = Q r ∗ , d − r ∗ ad D 0 d − r ∗ X 0 . (52)
They are invertible. Homogeneity leaves exactly one symbol monomial at each stated largest exponent, so there is no possible leading-term cancellation. Thus both rectangle determinants are nonzero polynomials in z z z . Choose z z z avoiding their roots and the eigenvalues of D 0 D_0 D 0 . The complete operator in size h + 1 h+1 h + 1 is invertible. In the new full hollow X X X -space its invertibility open again intersects all adjoint-power opens, preparing the next induction step. No intersection with a constrained nilpotent fiber is asserted here.
For completeness, the one-order cases do not use an extension with an absent rectangle. If Q = 0 Q=0 Q = 0 , choose regular D D D with all triple-distinct P i k j ≠ 0 P_{ikj} \ne0 P ik j = 0 . In column j j j the operator is the ( n − 1 ) (n-1) ( n − 1 ) -square hollow matrix
M j ( X ) i k = P i k j X i k ( i , k ≠ j , i ≠ k ) . M_j(X)_{ik}=P_{ikj}X_{ik}\quad(i,k\ne j,\ i\ne k). M j ( X ) ik = P ik j X ik ( i , k = j , i = k ) .
A derangement σ \sigma σ of the indices different from j j j contributes
sgn ( σ ) ∏ i ≠ j P i , σ ( i ) , j X i , σ ( i ) \operatorname{sgn}(\sigma)\prod_{i\ne j}P_{i,\sigma(i),j}X_{i,\sigma(i)} sgn ( σ ) i = j ∏ P i , σ ( i ) , j X i , σ ( i )
to its determinant. This coefficient is nonzero, and distinct permutations give distinct monomials in the original entries of X X X . Thus each det M j \det M_j det M j is nonzero and their product is nonzero. This is the fixed-input operator from Theorem 4.1 , not merely an assertion about a union of images. If P = 0 P=0 P = 0 , write Q s w ( s , t ) = Q ( t , s ) Q^{\mathrm{sw}}(s,t)=Q(t,s) Q sw ( s , t ) = Q ( t , s ) and use the exact identity
H 0 , Q ( D , X , Y ) t = ( − 1 ) d H Q s w , 0 ( D , X t , Y t ) . (53) H_{0,Q}(D,X,Y)^t=(-1)^dH_{Q^{\mathrm{sw}},0}(D,X^t,Y^t). \tag*{(53)} H 0 , Q ( D , X , Y ) t = ( − 1 ) d H Q sw , 0 ( D , X t , Y t ) . (53)
It transfers the preceding invertibility while keeping the first input fixed; replacing a fixed-Y Y Y assertion by a fixed-X X X assertion without this transpose would not suffice. The same unconstrained intersection with the adjoint-power opens applies to both one-order cases.
Finally, a nonzero coefficient in X X X of the polynomial det L D , X \det L_{D,X} det L D , X remains nonzero on a nonempty diagonal open set. Intersecting with the regular locus gives the asserted common open in D D D ; for every D D D there, the required opens in X X X are dense. □
Lemma 6.12. Under the hypothesis of Lemma 6.11 , the tensors of guarded smooth nilpotent seeds span V n ⊗ V n V_n\otimes V_n V n ⊗ V n for every n ≥ 3 n\ge3 n ≥ 3 .
Proof. Fix an allowed D D D , and let U D ⊂ V n U_D\subset V_n U D ⊂ V n be the dense open set where L D , X L_{D,X} L D , X and all the guard matrices are invertible. For X ∈ U D X\in U_D X ∈ U D , a column index j j j , and a column w w w with w j = 0 w_j=0 w j = 0 and w i ≠ 0 w_i\ne0 w i = 0 for every i ≠ j i\ne j i = j , set
N = w e j t , Y = L D , X − 1 ( N ) . (54) N=we_j^t,\qquad Y=L_{D,X}^{-1}(N). \tag*{(54)} N = w e j t , Y = L D , X − 1 ( N ) . (54)
This Y Y Y is the actual preimage under the complete operator. With both symbols present it need not itself have column support. The value H D ( X , Y ) = N H_D(X,Y)=N H D ( X , Y ) = N is nonzero rank one and square-zero. Its actual Y Y Y derivative fills V n V_n V n . Moreover
diag [ E j i , N ] = w i ( E j j − E i i ) ( i ≠ j ) , \operatorname{diag}[E_{ji},N]=w_i(E_{jj}-E_{ii})\quad(i\ne j), diag [ E j i , N ] = w i ( E j j − E ii ) ( i = j ) ,
so the actual orbit directions complete the derivative to s l n \mathfrak{sl}_n sl n .
Suppose a bilinear form T T T annihilates every guarded smooth seed. For fixed X ∈ U D X\in U_D X ∈ U D , the linear functional
N ⟼ T ( X , L D , X − 1 N ) N\longmapsto T(X,L_{D,X}^{-1}N) N ⟼ T ( X , L D , X − 1 N )
vanishes on the full-support open subset of each hollow column space. It therefore vanishes on that entire column space. All these column spaces span V n V_n V n , so T ( X , Y ) = 0 T(X,Y)=0 T ( X , Y ) = 0 for every hollow Y Y Y . This holds for a dense open set of X X X , and consequently T = 0 T=0 T = 0 . This argument uses all column-target preimages of one actual operator. It does not add values of H D H_D H D or assume a column shape for its second input. □
The zero cycle norm: exact lower kernels
It remains to treat Δ P , Q = 0 \Delta_{P,Q}=0 Δ P , Q = 0 . Both symbols are then nonzero, since a nonzero one-order symbol has nonzero cycle norm. In size four choose a regular diagonal tuple such that every triple-distinct P i k j P_{ikj} P ik j and Q i k j Q_{ikj} Q ik j is nonzero. Their finite product is a nonzero polynomial, so these choices form a nonempty open set. We first use three lower vertices a , b , c a,b,c a , b , c , reserving a fourth vertex 0 0 0 .
Lemma 6.13. Let A ∈ V 3 A\in V_3 A ∈ V 3 have all six entries nonzero. The complete lower operator L A : B ↦ H D l o w ( A , B ) L_A:B\mapsto H_{D_{\mathrm{low}}}(A,B) L A : B ↦ H D low ( A , B ) has rank four. Its kernel has a basis supported on the two opposite directed three-cycles, with each nonzero coordinate a fixed-D D D nonzero scalar times the corresponding entry of A A A . Its conormal for the hollow trace pairing also has a basis of two invertible matrices supported on opposite directed three-cycles.
Proof. In input coordinates ( B a c , B b a , B c b ) (B_{ac}, B_{ba}, B_{cb}) ( B a c , B ba , B c b ) and output coordinates ( H a b , H b c , H c a ) (H_{ab}, H_{bc}, H_{ca}) ( H ab , H b c , H c a ) one block is
\begin{pmatrix}
Q_{acb}A_{cb} & 0 & P_{acb}A_{ac} \\
P_{bac}A_{ba} & Q_{bac}A_{ac} & 0 \\
0 & P_{cba}A_{cb} & Q_{cba}A_{ba}
\end{pmatrix}. \tag*{(55)}\end{pmatrix}
The opposite cycle gives the other block, exactly as in (49) . Each determinant is zero by (48) , while its upper-left two-by-two minor is nonzero. Each block has rank exactly two.
For the displayed block an explicit right-kernel matrix B ( 1 ) B^{(1)} B ( 1 ) is
B a c ( 1 ) = A a c , B b a ( 1 ) = − P b a c Q b a c A b a , B c b ( 1 ) = − Q a c b P a c b A c b . (56) B_{ac}^{(1)}=A_{ac},\qquad B_{ba}^{(1)}=-\frac{P_{bac}}{Q_{bac}}A_{ba},\qquad B_{cb}^{(1)}=-\frac{Q_{acb}}{P_{acb}}A_{cb}. \tag*{(56)} B a c ( 1 ) = A a c , B ba ( 1 ) = − Q ba c P ba c A ba , B c b ( 1 ) = − P a c b Q a c b A c b . (56)
with its other entries zero. The first two equations are immediate; the third is precisely P a c b P b a c P c b a + Q a c b Q b a c Q c b a = 0 P_{acb}P_{bac}P_{cba}+Q_{acb}Q_{bac}Q_{cba}=0 P a c b P ba c P c ba + Q a c b Q ba c Q c ba = 0 . Interchanging b , c b,c b , c gives B ( 2 ) B^{(2)} B ( 2 ) on the opposite cycle. In particular the six entries of A A A remain independent variables; the coefficients in these two kernel vectors depend only on D D D .
For an equally explicit conormal, a left null vector of (55) is
( 1 , − Q a c b A c b P b a c A b a , Q a c b Q b a c A a c P b a c P c b a A b a ) . \left(1,-\frac{Q_{acb}A_{cb}}{P_{bac}A_{ba}},\frac{Q_{acb}Q_{bac}A_{ac}}{P_{bac}P_{cba}A_{ba}}\right). ( 1 , − P ba c A ba Q a c b A c b , P ba c P c ba A ba Q a c b Q ba c A a c ) .
Its three coordinates are nonzero. Transposing its output positions for the trace pairing gives
C 1 = E b a − Q a c b A c b P b a c A b a E c b + Q a c b Q b a c A a c P b a c P c b a A b a E a c . (57) C_1=E_{ba}-\frac{Q_{acb}A_{cb}}{P_{bac}A_{ba}}E_{cb}+\frac{Q_{acb}Q_{bac}A_{ac}}{P_{bac}P_{cba}A_{ba}}E_{ac}. \tag*{(57)} C 1 = E ba − P ba c A ba Q a c b A c b E c b + P ba c P c ba A ba Q a c b Q ba c A a c E a c . (57)
It satisfies tr ( C 1 L A ( B ) ) = 0 \operatorname{tr}(C_1L_A(B))=0 tr ( C 1 L A ( B )) = 0 for every hollow B B B , and is an invertible directed-cycle matrix. Interchanging b , c b,c b , c gives C 2 C_2 C 2 . Their supports are disjoint and opposite. They form a basis of the two-dimensional conormal of the full rank-four lower operator.
A full size-four star differential
Lemma 6.14. For every D D D in the size-four open just chosen, a nonempty open subset of the entire column-star parameter space
X = ( 0 0 0 A ) , Y = v e 0 t , ( A , v ) ∈ V 3 × K 3 , X=\begin{pmatrix}0&0\\0&A\end{pmatrix},\qquad Y=ve_0^{t},\qquad(A,v)\in V_3\times K^3, X = ( 0 0 0 A ) , Y = v e 0 t , ( A , v ) ∈ V 3 × K 3 , consists of nonzero rank-one square-zero seeds for which the fixed-D D D derivative d H D dH_D d H D is onto V 4 V_4 V 4 . The same assertion holds for row stars. The lower block A A A can simultaneously satisfy all its adjoint-power guards.
Proof. At the displayed input,
H D ( X , Y ) = N = w e 0 t , w = F v , F i j = P i j 0 A i j ( i , j ∈ { a , b , c } ) , (58) H_D(X,Y)=N=we_0^{t},\qquad w=Fv,\qquad F_{ij}=P_{ij0}A_{ij}\quad(i,j\in\{a,b,c\}), \tag*{(58)} H D ( X , Y ) = N = w e 0 t , w = F v , F ij = P ij 0 A ij ( i , j ∈ { a , b , c }) , (58)
where the diagonal of F F F is zero. The upper-row Y Y Y derivative is r ↦ r G r\mapsto rG r ↦ r G , with
G i j = Q 0 i j A i j ( i , j ∈ { a , b , c } ) , G i i = 0. G_{ij}=Q_{0ij}A_{ij}\quad(i,j\in\{a,b,c\}),\qquad G_{ii}=0. G ij = Q 0 ij A ij ( i , j ∈ { a , b , c }) , G ii = 0.
The determinants of F F F and G G G each have the two distinct cycle monomials A a b A b c A c a A_{ab}A_{bc}A_{ca} A ab A b c A c a and A a c A c b A b a A_{ac}A_{cb}A_{ba} A a c A c b A ba with nonzero coefficients. Each determinant is therefore a nonzero polynomial in the same six original entries of A A A . The determinants det ( adj D l o w A ) \det(\operatorname{adj}_{D_{\mathrm{low}}}A) det ( adj D low A ) are likewise nonzero polynomials, as is seen on a single directed-cycle support. Choose one A A A where all six entries, both rectangle determinants, and all those lower guards are nonzero. This is an intersection of opens in the full irreducible space V 3 V_3 V 3 .
The complete fixed-D D D hollow Y Y Y derivative is the direct sum of these two invertible three-dimensional rectangles and the rank-four operator L A L_A L A . Its rank is 3 + 3 + 4 = 10 3+3+4=10 3 + 3 + 4 = 10 . Its two-dimensional hollow conormal is precisely the span of C 1 , C 2 C_1,C_2 C 1 , C 2 from Lemma 6.13, embedded in the lower block.
Now vary the three entries of the raw upper row of X X X by a = ( a j ) j ∈ { a , b , c } a=(a_j)_{j\in\{a,b,c\}} a = ( a j ) j ∈ { a , b , c } . Its only possibly nonzero output is the lower hollow block
( d H D ) i j = Q i 0 j v i a j ( i ≠ j ) . (59) (dH_D)_{ij}=Q_{i0j}v_i a_j\qquad(i\ne j). \tag*{(59)} ( d H D ) ij = Q i 0 j v i a j ( i = j ) . (59)
The diagonal entries are zero by the endpoint hypothesis. For a lower conormal C C C , its pairing with this output is
tr ( C d H D ) = ∑ j a j ( M C v ) j , ( M C ) j i = C j i Q i 0 j , ( M C ) j j = 0. \operatorname{tr}(C\,dH_D)=\sum_j a_j(M_Cv)_j,\qquad(M_C)_{ji}=C_{ji}Q_{i0j},\qquad(M_C)_{jj}=0. tr ( C d H D ) = j ∑ a j ( M C v ) j , ( M C ) j i = C j i Q i 0 j , ( M C ) j j = 0.
Both M C 1 M_{C_1} M C 1 and M C 2 M_{C_2} M C 2 are still invertible directed-cycle matrices: every multiplier on their supports is nonzero. Their opposite disjoint supports prevent proportionality. It follows that M C 1 v , M C 2 v M_{C_1}v,M_{C_2}v M C 1 v , M C 2 v are independent on a nonempty open set of v v v . Indeed, dependence for every v v v would make every vector an eigenvector of M C 1 − 1 M C 2 M_{C_1}^{-1}M_{C_2} M C 1 − 1 M C 2 , forcing that operator to be scalar, contrary to the supports.
Choose v v v in that open with both v v v and F v Fv F v of full support. These conditions are simultaneously possible because F F F is invertible and the vector space is irreducible. The three actual upper-row X X X directions then fill the two-dimensional quotient of V 4 V_4 V 4 by the Y Y Y image. Thus the full fixed-D D D hollow derivative has rank 12 12 12 . The value N N N in (58) is nonzero rank one and square-zero, with all three complementary column entries nonzero. The orbit directions E 0 i E_{0i} E 0 i have diagonal projections w i ( E 00 − E i i ) w_i(E_{00}-E_{ii}) w i ( E 00 − E ii ) , giving the remaining three independent directions and rank 15 15 15 for d Γ D d\Gamma_D d Γ D .
All the conditions used are open in the whole star parameter space, and we have shown their simultaneous nonemptiness. To obtain row stars for the same original symbols use
H P , Q ( D , X t , Y t ) = ( − 1 ) d H Q s w , P s w ( D , X , Y ) t , R s w ( s , t ) = R ( t , s ) . (60) H_{P,Q}(D,X^t,Y^t)=(-1)^dH_{Q^{\mathrm{sw}},P^{\mathrm{sw}}}(D,X,Y)^t,\qquad R^{\mathrm{sw}}(s,t)=R(t,s). \tag*{(60)} H P , Q ( D , X t , Y t ) = ( − 1 ) d H Q sw , P sw ( D , X , Y ) t , R sw ( s , t ) = R ( t , s ) . (60)
The transformed pair has zero endpoints and zero cycle norm, since its norm is Δ P , Q ( t , s ) \Delta_{P,Q}(t,s) Δ P , Q ( t , s ) . Its triple-distinct weights are nonzero under our same conditions on D D D , by reversal of the path and homogeneity. The preceding column proof therefore applies to it. Transpose preserves all ranks and the adjoint-power guards, since
ad D j ( X t ) = ( − 1 ) j ( ad D j X ) t . \operatorname{ad}_D^j(X^t)=(-1)^j(\operatorname{ad}_D^jX)^t. ad D j ( X t ) = ( − 1 ) j ( ad D j X ) t .
Restoring guards in the exact raw fiber.
Lemma 6.15. At any column star in the nonempty open constructed in Lemma 6.14 , the exact raw fiber H D = N H_D=N H D = N is smooth, and its local ring contains a nonzero product of all raw X X X guard determinants. Every function whose germ on this fiber is nonzero can be retained at an actual guarded smooth nilpotent seed in this same fiber. The corresponding assertion holds at row stars.
Proof. The surjectivity of the fixed-D D D hollow differential makes
F N = { ( X ′ , Y ′ ) ∈ V 4 × V 4 : H D ( X ′ , Y ′ ) = N } F_N=\{(X',Y')\in V_4\times V_4:H_D(X',Y')=N\} F N = {( X ′ , Y ′ ) ∈ V 4 × V 4 : H D ( X ′ , Y ′ ) = N }
smooth at the star p p p . Its local ring R = O F N , p R=\mathcal{O}_{F_N,p} R = O F N , p is a regular local domain. The map from the three raw upper-row X X X variations to the two-dimensional quotient by the Y Y Y image has rank two. Choose a nonzero row a a a in its one-dimensional kernel. Its complete output lies in the Y Y Y image and can therefore be cancelled by an actual hollow Y Y Y variation. Independently, every raw lower-column X X X variation z z z has zero output: both products with the current Y = v e 0 t Y=ve_0^t Y = v e 0 t vanish. Consequently, for every z z z , the raw variation
X ˙ = ( 0 a z 0 ) \dot X=\begin{pmatrix}0&a\\z&0\end{pmatrix} X ˙ = ( 0 z a 0 )
can be completed by a hollow Y ˙ \dot Y Y ˙ to a tangent vector of the exact fiber F N F_N F N . No output conjugation is involved.
Put E = D l o w − d 0 I 3 E=D_{\mathrm{low}}-d_0I_3 E = D low − d 0 I 3 and A j = ad D l o w j A A_j=\operatorname{ad}_{D_{\mathrm{low}}}^jA A j = ad D low j A . All E , A j E,A_j E , A j are invertible. Smoothness lifts any such tangent to a formal arc in F N F_N F N . Along it the raw X X X remains hollow, its upper and lower cross blocks start with t a ta t a and t z tz t z , and its lower block starts with A A A . The Schur complement gives, for every guard exponent j j j ,
det ( ad D j X ( t ) ) = ( − 1 ) j + 1 t 2 det ( A j ) a E j A j − 1 E j z + O ( t 3 ) . (61) \det(\operatorname{ad}_D^jX(t))=(-1)^{j+1}t^2\det(A_j)\,aE^jA_j^{-1}E^jz+O(t^3). \tag*{(61)} det ( ad D j X ( t )) = ( − 1 ) j + 1 t 2 det ( A j ) a E j A j − 1 E j z + O ( t 3 ) . (61)
In particular second-order changes in the lower block or the cross blocks cannot alter the displayed coefficient; the upper-left raw entry is identically zero. For each j j j the row a E j A j − 1 E j aE^jA_j^{-1}E^j a E j A j − 1 E j is nonzero. Choose one z z z outside the finitely many annihilating hyperplanes. Every determinant in (61) is then nonzero on the formal arc. Their product is consequently a nonzero element of R R R . The fixed-D D D and saturated smoothness minors already nonzero at p p p are units in R R R .
Let b ∈ R b \in R b ∈ R be any nonzero function germ. The product of b b b , the guard product, and these minors is nonzero because R R R is a domain. On a sufficiently small finite-type neighborhood in the component through p p p , its nonvanishing defines a nonempty open set. As K K K is algebraically closed, this open set has an actual K K K -point. At that point the raw value is still exactly N N N , all guards hold, the seed is smooth, and b b b is nonzero. This proves the stated retention property, not merely a formal existence claim. The transpose identity (60) transports the entire raw-fiber argument to row stars.
Corollary 6.16. If a bilinear form T T T on V 4 × V 4 V_4 \times V_4 V 4 × V 4 vanishes at every guarded smooth nilpotent seed, its entire germ on the exact raw fiber at every star in Lemma 6.14 is zero.
Proof. A nonzero germ could be retained at a guarded smooth seed in the same raw fiber by Lemma 6.15, contradicting the hypothesis on T T T .
Six independent monomials and the guarded base
Lemma 6.17. For each D D D in the above size-four diagonal open, the tensors of guarded smooth nonzero rank-one square-zero seeds span V 4 ⊗ V 4 V_4 \otimes V_4 V 4 ⊗ V 4 .
Proof. Suppose a bilinear form T T T annihilates all such tensors. By Corollary 6.16 it vanishes at every generic column or row star. Polynomial continuation on the whole irreducible star parameter space makes its restriction identically zero there.
First consider two hollow units E a b , E c d E_{ab}, E_{cd} E ab , E c d with { a , b } ≠ { c , d } \{a,b\} \ne\{c,d\} { a , b } = { c , d } . The second edge has an endpoint outside { a , b } \{a,b\} { a , b } . If d d d is such an endpoint, use the column star isolated at d d d : E a b E_{ab} E ab belongs to its lower block and E c d E_{cd} E c d to its column. If c c c is such an endpoint, use the row star isolated at c c c instead. Thus
T ( E a b , E c d ) = 0 if { a , b } ≠ { c , d } . (62) T(E_{ab}, E_{cd}) = 0 \quad\text{if } \{a,b\} \ne\{c,d\}. \tag*{(62)} T ( E ab , E c d ) = 0 if { a , b } = { c , d } . (62)
This eliminates four-distinct-vertex coefficients as well, without an embedding assertion from size three. No relation between the remaining same-edge and reversed-edge coefficients has been assumed.
Fix now an isolated vertex 0 0 0 and a generic lower block A A A . Choose a v v v making its column star one of the smooth points above. For either of the explicit lower kernel matrices B ( ν ) B^{(\nu)} B ( ν ) in (56) , the line
( X , Y t ) = ( ( 0 0 0 A ) , v e 0 t + t ( 0 0 0 B ( ν ) ) ) (63) (X,Y_t)=\left(\begin{pmatrix}0&0\\0&A\end{pmatrix},ve_0^t+t\begin{pmatrix}0&0\\0&B^{(\nu)}\end{pmatrix}\right) \tag*{(63)} ( X , Y t ) = ( ( 0 0 0 A ) , v e 0 t + t ( 0 0 0 B ( ν ) ) ) (63)
lies in the exact same raw fiber: the additional full output is t L A ( B ( ν ) ) = 0 tL_A(B^{(\nu)})=0 t L A ( B ( ν ) ) = 0 . The zero germ from Corollary 6.16 , restricted to this line, gives
T ( ( 0 0 0 A ) , ( 0 0 0 B ( ν ) ) ) = 0. T\left(\begin{pmatrix}0&0\\0&A\end{pmatrix},\begin{pmatrix}0&0\\0&B^{(\nu)}\end{pmatrix}\right)=0. T ( ( 0 0 0 A ) , ( 0 0 0 B ( ν ) ) ) = 0.
Let C C C be the directed three-cycle supporting one such kernel vector, and write B e = γ e A e B_e=\gamma_eA_e B e = γ e A e on it. Each γ e ∈ K ∗ \gamma_e \in K^* γ e ∈ K ∗ depends only on D D D , and the cycle contains exactly one orientation of each unordered lower edge. Using (62) , the preceding identity is
∑ e ∈ C γ e ( T ( E e , E e ) A e 2 + T ( E e ˉ , E e ) A e ˉ A e ) = 0 , (64) \sum_{e\in C}\gamma_e\left(T(E_e,E_e)A_e^2+T(E_{\bar e},E_e)A_{\bar e}A_e\right)=0, \tag*{(64)} e ∈ C ∑ γ e ( T ( E e , E e ) A e 2 + T ( E e ˉ , E e ) A e ˉ A e ) = 0 , (64)
where e ˉ \bar e e ˉ denotes the reverse edge. This identity holds for a nonempty open set of the six independent entries of A A A , hence is a polynomial identity in them. Its three square monomials and three unordered-edge product monomials are six distinct monomials. Every coefficient displayed in (64) therefore vanishes. The opposite kernel cycle kills the other three square coefficients and the opposite three ordered reverse-edge coefficients on this lower triangle.
Varying the isolated vertex covers every unordered edge of the four-vertex set. All coefficients left after (62) consequently vanish, and T = 0 T=0 T = 0 . The two kernel shifts were taken in a fiber of the full operator, at a common original input, rather than in fibers of its summands.
Completion in all sizes and diagonal enrichment.
Proof of Theorem 6.9. If the cycle norm is nonzero, Lemmas 6.11 and 6.12 give even guarded hollow detection in every size at least three. If the cycle norm is zero, Lemma 6.10 gives the required unguarded size-three result, while Lemma 6.17 supplies the guarded size-four base for both nonzero symbols.
For this latter case apply the exact guarded singleton extension 6.4 and the support induction 6.5. Their hypotheses concern the complete trace-zero map and guarded smooth nilpotent seeds, all of which have just been verified; they do not require a nonzero endpoint. They give full guarded hollow tensor span in every size n ≥ 5 n \ge5 n ≥ 5 . The generic fixed-diagonal descent in 6.6 then gives a nonempty numerical diagonal open Ω n \Omega_n Ω n supporting a full spanning collection at each one of its points. In particular D D D is not selected separately for different tensor coefficients. The size-three branch needs no claim that its raw first input can satisfy the guards.
The common diagonal-enrichment lemma 6.3 upgrades these hollow assertions to full M n ⊗ M n M_n \otimes M_n M n ⊗ M n detection. Its hypotheses hold because s t st s t divides both symbols, and the smoothness controls used here are actual hollow input directions and simultaneous conjugation of the entire original tuple.
□ \square □
The conclusion is a detector for the complete zero-endpoint restriction with arbitrary coefficient dependence between P P P and Q Q Q . Together with the original trace transfer in Theorem 6.1 , it applies to every ordinary coefficient fiber having this restriction, including corrections whose complete chosen-pair restriction is zero. No standalone outer-adjoint or corank-one hypothesis is needed, and no size-two or all-pairs-zero assertion is part of Theorem 6.9.
6.4. The complete original trace on the same nilpotent fiber. We now prove Theorem 6.1 . This step uses the actual matrix-entry polynomial tr f \operatorname{tr} f tr f at the specified size, not a formal free trace coefficient and not a selected low-activity detector. In particular, all fixed-size polynomial identities are included before the first nonzero trace term is selected.
Proof of Theorems 6.2 and 6.1 . For the seed theorem, τ = 0 \tau= 0 τ = 0 implies q = − ϵ p q = -\epsilon p q = − ϵ p . The case p ≠ 0 p \ne0 p = 0 is Theorem 6.7 ; the case p = 0 p = 0 p = 0 is Theorem 6.9. In the latter proof the cycle norm is either nonzero or identically zero. If only one symbol is nonzero its norm cannot vanish, since it is a product of three nonzero polynomials under invertible substitutions. Thus these cases exhaust every nonzero pair, without imposing a product or fixed-depth hypothesis. Lemmas 6.6 and 6.3 give the stated common diagonal open set and the full, rather than hollow, bilinear detector.
For the original map, if τ ≠ 0 \tau\ne0 τ = 0 , the smooth nilpotent input of Theorem 5.2 is an input of the complete restriction of f f f . Its tangent directions are original-source directions, so the full original differential is onto M n M_n M n . Writing h = tr f h=\operatorname{tr} f h = tr f and g = f − n − 1 h I n g=f-n^{-1}hI_n g = f − n − 1 h I n , we obtain rank ( d a g ) = n 2 − 1 \operatorname{rank}(d_ag)=n^2-1 rank ( d a g ) = n 2 − 1 and d h a ∣ ker ( d a g ) ≠ 0 dh_a|_{\ker(d_ag)} \ne0 d h a ∣ k e r ( d a g ) = 0 at this input a a a . Thus h ∣ g − 1 ( N ) h|_{g^{-1}(N)} h ∣ g − 1 ( N ) has a nonzero linear term at a a a . Theorem 2.1 gives the actual image and smoothness gives the fiber assertion. Hence assume τ = 0 \tau= 0 τ = 0 for the rest of the proof, and put
π ( A ) = A − tr A n I n , g = π f , h = tr f . \pi(A)=A-\frac{\operatorname{tr} A}{n}I_n,\qquad g=\pi f,\qquad h=\operatorname{tr} f. π ( A ) = A − n tr A I n , g = π f , h = tr f .
Choose one passive original variable as an anchor D D D . In each of the other m − 3 m-3 m − 3 passive positions put D + Z i D+Z_i D + Z i ; retain the original active variables X , Y X,Y X , Y . These are invertible linear coordinates on M n m M_n^m M n m . The linear subspace S = { Z 1 = ⋯ = Z m − 3 = 0 } S=\{Z_1=\cdots=Z_{m-3}=0\} S = { Z 1 = ⋯ = Z m − 3 = 0 } is the complete restriction source. On it h = 0 h=0 h = 0 and g = H P , Q g=H_{P,Q} g = H P , Q . If h h h is an actual identity, any seed in Theorem 6.2 gives an original smooth input into s l n \mathfrak{s}\mathfrak{l}_n s l n . Theorem 2.1 then gives Val n ( f ) = s l n \operatorname{Val}_n(f)=\mathfrak{s}\mathfrak{l}_n Val n ( f ) = s l n and the local fiber dimension m n 2 − n 2 + 1 mn^2-n^2+1 m n 2 − n 2 + 1 .
Suppose instead that h h h is a nonzero polynomial in actual matrix entries. Expand it by total degree in the normal variables:
h ( D , X , Y , Z ) = ∑ j = ν m − 3 H j ( D , X , Y , Z ) , H ν ≠ 0 , 1 ≤ ν ≤ m − 3. (65) h(D,X,Y,Z)=\sum_{j=\nu}^{m-3}H_j(D,X,Y,Z),\qquad H_\nu\ne0,\qquad1\le\nu\le m-3. \tag*{(65)} h ( D , X , Y , Z ) = j = ν ∑ m − 3 H j ( D , X , Y , Z ) , H ν = 0 , 1 ≤ ν ≤ m − 3. (65)
Every H j H_j H j is homogeneous of degree j j j in Z Z Z and bilinear in the full original matrices X , Y X,Y X , Y . Indeed, every word of f f f uses each original slot once. Lower components in (65) vanish as actual size-n n n polynomials, including cancellations arising from trace identities. Each component is separately invariant under simultaneous conjugation: apply that invariance to h ( D , X , Y , t Z ) h(D,X,Y,tZ) h ( D , X , Y , tZ ) and compare powers of the scalar t t t .
The conjugation-saturation of the nonempty diagonal open set Ω n \Omega_n Ω n in Theorem 6.2 is dense in M n M_n M n . Indeed, if a polynomial vanishes on that saturation, then for each fixed conjugating matrix it vanishes on the corresponding conjugate of the full diagonal space by density of Ω n \Omega_n Ω n in that space. It therefore vanishes on the dense regular semisimple locus. Invariance of H v H_v H v now shows that there are D 0 ∈ Ω n D_0 \in\Omega_n D 0 ∈ Ω n and fixed normal matrices Z 0 Z^0 Z 0 for which
T ( X , Y ) = H v ( D 0 , X , Y , Z 0 ) . T(X,Y)=H_v(D_0,X,Y,Z^0). T ( X , Y ) = H v ( D 0 , X , Y , Z 0 ) .
is a nonzero bilinear form on M n × M n M_n \times M_n M n × M n . For if it vanished for every such D 0 , Z 0 , X , Y D_0,Z^0,X,Y D 0 , Z 0 , X , Y , conjugation and density would force H v = 0 H_v=0 H v = 0 . The seed detector chooses original X 0 , Y 0 X_0,Y_0 X 0 , Y 0 at this same D 0 D_0 D 0 such that T ( X 0 , Y 0 ) ≠ 0 T(X_0,Y_0)\ne0 T ( X 0 , Y 0 ) = 0 , the value N = H P , Q ( D 0 , X 0 , Y 0 ) N=H_{P,Q}(D_0,X_0,Y_0) N = H P , Q ( D 0 , X 0 , Y 0 ) is nonzero rank-one square-zero, and the restriction differential onto s l n \mathfrak{sl}_n sl n is surjective. Let a = ( D 0 , X 0 , Y 0 , 0 ) a=(D_0,X_0,Y_0,0) a = ( D 0 , X 0 , Y 0 , 0 ) in the original linear coordinates.
At a a a the map g g g is smooth, already using directions in T a S T_aS T a S . Choose an ( n 2 − 1 ) (n^2-1) ( n 2 − 1 ) -dimensional control space L ⊂ T a S L \subset T_aS L ⊂ T a S on which d g a d g_a d g a is an isomorphism onto s l n \mathfrak{sl}_n sl n . Complete it to linear source coordinates ( ℓ , w , Z ) (\ell,w,Z) ( ℓ , w , Z ) centered at a a a . The formal implicit function theorem solves the exact partial fiber g = N g=N g = N uniquely as ℓ = ϕ ( w , Z ) \ell=\phi(w,Z) ℓ = ϕ ( w , Z ) in a formal neighborhood, with ϕ ( 0 , 0 ) = 0 \phi(0,0)=0 ϕ ( 0 , 0 ) = 0 . Since L ⊂ T a S L \subset T_aS L ⊂ T a S , this solution does not change any normal coordinate Z i Z_i Z i .
The total lowest Taylor term of h h h at a a a is precisely
H v ( D 0 , X 0 , Y 0 , Z ) . (66) H_v(D_0,X_0,Y_0,Z). \tag*{(66)} H v ( D 0 , X 0 , Y 0 , Z ) . (66)
It is nonzero by the chosen Z 0 Z^0 Z 0 . A variation of any coefficient variable D , X , Y D,X,Y D , X , Y in H v H_v H v adds at least one to its total degree; all H j H_j H j with j > v j>v j > v have larger total degree already. Substitution of the exact control correction ϕ ( w , Z ) \phi(w,Z) ϕ ( w , Z ) therefore leaves (66) unchanged. This is a statement about the complete lowest Taylor term in actual original coordinates, not just a normal symbol before solving the fiber.
The local ring of g − 1 ( N ) g^{-1}(N) g − 1 ( N ) at a a a is regular of dimension m n 2 − n 2 + 1 mn^2-n^2+1 m n 2 − n 2 + 1 and is a domain. Its completion is the formal ring just used, so h h h is a nonzero element of that local ring. It vanishes at a a a and is a non-zero-divisor. Adding the trace equation gives the full fiber f − 1 ( N ) f^{-1}(N) f − 1 ( N ) as a local complete intersection of dimension m n 2 − n 2 mn^2-n^2 m n 2 − n 2 . The same local trace-germ and miracle-flatness argument as Proposition 2.3 proves that f f f is flat at this original input. Corollary 2.2 and Theorem 2.1 , including their ordinary multilinear scalar extraction, give the actual image M n M_n M n . No scalar value is supplied merely by taking a closure. If v = 1 v=1 v = 1 , the surviving linear trace term supplies the missing normal and the point is smooth into M n M_n M n . If v ≥ 2 v\ge2 v ≥ 2 , its Jacobian rank is exactly n 2 − 1 n^2-1 n 2 − 1 : it is flat but not smooth. These alternatives are compatible with the asserted local complete-intersection fiber.
Corollary 6.18 (Full higher-ideal coefficient fibers). Let F F F satisfy the complete restriction hypothesis of Theorem 6.1 . Every same-degree ordinary polynomial f = F + R f=F+R f = F + R with zero complete selected restriction for R R R has the image and local-fiber classification in that theorem. In particular, R R R may range over the entire proper multilinear J 3 J^3 J 3 component and all higher powers. The target is determined separately by tr ( F + R ) \operatorname{tr}(F+R) tr ( F + R ) on the fixed M n M_n M n .
Proof. The complete selected restriction is unchanged. The vanishing of proper J 3 J^3 J 3 on the whole two-active source is Lemma 3.2. We use that vanishing only to identify the restriction. Transverse derivatives of R R R are not set to zero: they are included in h h h and in every coefficient of (65). The theorem reselects the seed for the corrected polynomial, rather than asserting that an old nilpotent input remains suitable.
Coefficient scope, examples, and the remaining boundary
For a fixed ordered pair of original active positions, the free proper degree-m m m J 2 J^2 J 2 coefficient space maps onto the full symbol space
{ ( P , Q ) : deg P = deg Q = m − 2 , s t ∣ P , Q } , dim = 2 ( m − 3 ) . \{(P,Q):\deg P=\deg Q=m-2,\ st\mid P,Q\},\qquad\dim=2(m-3). {( P , Q ) : deg P = deg Q = m − 2 , s t ∣ P , Q } , dim = 2 ( m − 3 ) .
To see surjectivity without a dimension heuristic, partition the m − 2 m-2 m − 2 passive original leaves into sets of sizes r , s ≥ 1 r,s\ge1 r , s ≥ 1 and form one iterated commutator on the first active leaf and its r r r passive leaves, and another on the second active leaf and its s s s passive leaves. Their ordered product restricts, up to a nonzero sign, to ( ad D r X ) ( ad D s Y ) (\operatorname{ad}_{D}^{r}X)(\operatorname{ad}_{D}^{s}Y) ( ad D r X ) ( ad D s Y ) . Reversing the product gives the other order. All passive leaves remain distinct. As r + s = m − 2 r+s=m-2 r + s = m − 2 varies these are exactly the two monomial bases. Thus the kernel of this fixed pair map has codimension 2 ( m − 3 ) 2(m-3) 2 ( m − 3 ) . This is not a codimension formula for the common kernel over all pairs and is not a quotient by size-n n n polynomial identities. Every nonzero fiber of this map is covered, with the actual trace deciding its target.
Remark 6.19 (A high-activity fixed-size trace identity does not obstruct the transfer). Take twenty-eight distinct original variables, arranged into fourteen pairs, and write A i = [ a i , a i ′ ] A_i=[a_i,a_i'] A i = [ a i , a i ′ ] , B i = [ b i , b i ′ ] B_i=[b_i,b_i'] B i = [ b i , b i ′ ] , 1 ≤ i ≤ 7 1\le i\le7 1 ≤ i ≤ 7 . Set
R = ∑ σ ∈ S 7 sgn ( σ ) A σ ( 1 ) B 1 A σ ( 2 ) B 2 ⋯ A σ ( 7 ) B 7 . R=\sum_{\sigma\in S_7}\operatorname{sgn}(\sigma)A_{\sigma(1)}B_1A_{\sigma(2)}B_2\cdots A_{\sigma(7)}B_7. R = σ ∈ S 7 ∑ sgn ( σ ) A σ ( 1 ) B 1 A σ ( 2 ) B 2 ⋯ A σ ( 7 ) B 7 .
This is proper, ordinary multilinear, and belongs to J 14 J^{14} J 14 . On M 3 M_3 M 3 , every common-D D D restriction with at most fourteen active original slots is zero. With fewer than fourteen, one basic commutator has both entries D D D . With fourteen, either that still happens or each factor has one active entry. In the latter case all seven A i A_i A i belong to im ad D \operatorname{im}\operatorname{ad}_D im ad D . For regular diagonal D D D this space has dimension six, so alternation kills the value. Conjugation and polynomial density extend the identity to every D D D . This covers every choice of active original slots.
Nevertheless tr R \operatorname{tr}R tr R is not an identity. Use
( A 1 , … , A 7 ) = ( E 12 , E 13 , E 21 , E 23 , E 11 − E 22 , E 31 , E 32 ) , (A_1,\ldots,A_7)=(E_{12},E_{13},E_{21},E_{23},E_{11}-E_{22},E_{31},E_{32}), ( A 1 , … , A 7 ) = ( E 12 , E 13 , E 21 , E 23 , E 11 − E 22 , E 31 , E 32 ) ,
( B 1 , … , B 7 ) = ( E 21 , E 32 , E 12 , E 31 , E 13 , E 13 , E 21 ) . (B_1,\ldots,B_7)=(E_{21},E_{32},E_{12},E_{31},E_{13},E_{13},E_{21}). ( B 1 , … , B 7 ) = ( E 21 , E 32 , E 12 , E 31 , E 13 , E 13 , E 21 ) .
Here is a direct certificate requiring no enumeration of 7 ! 7! 7 ! terms. Let ( u i , v i ) (u_i,v_i) ( u i , v i ) be the following ordered coordinate pairs:
( 1 , 2 ) , ( 1 , 3 ) , ( 2 , 1 ) , ( 2 , 3 ) , ( 1 , 1 ) , ( 3 , 1 ) , ( 3 , 2 ) . (1,2),(1,3),(2,1),(2,3),(1,1),(3,1),(3,2). ( 1 , 2 ) , ( 1 , 3 ) , ( 2 , 1 ) , ( 2 , 3 ) , ( 1 , 1 ) , ( 3 , 1 ) , ( 3 , 2 ) .
Then B i = E v i , u i + 1 B_i=E_{v_i,u_{i+1}} B i = E v i , u i + 1 cyclically and
tr ( C 1 B 1 ⋯ C 7 B 7 ) = ∏ i = 1 7 ( C i ) u i v i . \operatorname{tr}(C_1B_1\cdots C_7B_7)=\prod_{i=1}^{7}(C_i)_{u_iv_i}. tr ( C 1 B 1 ⋯ C 7 B 7 ) = i = 1 ∏ 7 ( C i ) u i v i .
The coordinate-evaluation matrix of the seven displayed A i A_i A i is I 7 I_7 I 7 . Hence the alternating trace is its determinant, namely one. All values have independent original lifts: E i j = [ E i i , E i j ] E_{ij}=[E_{ii},E_{ij}] E ij = [ E ii , E ij ] and E 11 − E 22 = [ E 12 , E 21 ] E_{11}-E_{22}=[E_{12},E_{21}] E 11 − E 22 = [ E 12 , E 21 ] . Embedding these inputs in a three-by-three block proves actual trace nonvanishing for every n ≥ 3 n\ge3 n ≥ 3 . With D = diag ( 0 , 1 , 2 ) D=\operatorname{diag}(0,1,2) D = diag ( 0 , 1 , 2 ) , the thirteen off-diagonal factors can be written [ D , E i j / ( d i − d j ) ] [D,E_{ij}/(d_i-d_j)] [ D , E ij / ( d i − d j )] , using one active original slot each; the diagonal factor uses two. Thus fifteen active slots already detect the trace. The example is not invisible to every common-D D D template.
Label the same twenty-eight original leaves x 1 , … , x 28 x_1,\ldots,x_{28} x 1 , … , x 28 , and let C 14 C_{14} C 14 denote a left-normed commutator on fourteen distinct leaves. Put
F = [ C 14 ( x 1 , … , x 14 ) , C 14 ( x 15 , … , x 28 ) ] . F=[C_{14}(x_1,\ldots,x_{14}),C_{14}(x_{15},\ldots,x_{28})]. F = [ C 14 ( x 1 , … , x 14 ) , C 14 ( x 15 , … , x 28 )] .
The complete restriction with active x 1 , x 15 x_1,x_{15} x 1 , x 15 is [ ad D 13 X , ad D 13 Y ] [\operatorname{ad}_{D}^{13}X,\operatorname{ad}_{D}^{13}Y] [ ad D 13 X , ad D 13 Y ] ; the two signs from the left-normed combs cancel. Thus F + R F+R F + R has actual image M n M_n M n for every n ≥ 3 n\ge3 n ≥ 3 by Theorem 6.1 . In size three its entire trace is still zero on every common-D D D source with at most fourteen active slots. The theorem uses the first surviving actual normal term, not the false inference that a low-activity detector must see all traceful higher-ideal coefficients.
The common zero restriction region remains outside this theorem. It contains proper J 3 J^3 J 3 itself and also genuine second-layer examples such as s 4 s_4 s 4 , whose two passive equal inputs make every chosen-pair restriction zero by alternation. Individual members may have other classifications. In particular, τ = 0 \tau= 0 τ = 0 alone is not the hypothesis: some complete pair ( P , Q ) (P,Q) ( P , Q ) must be nonzero. The fixed-size actual trace is still required to determine the target. Size two is not covered by the present seed theorem. No resolution of general LK is asserted.
Here the zero-restriction limitation refers to Theorem 6.1 . The independent-diagonal Theorem 1.1 covers every genuine proper second-layer member of that region, including s 4 s_4 s 4 , while retaining the exclusions of pure J 3 J^3 J 3 , size two, and general LK.
The actual-image criterion, scalar extraction, local trace-germ criterion, one-order column operators, cubic cycle determinants, and highest-power rectangle arguments are established earlier in this manuscript. The proofs here reuse those mechanisms and supply the compatible full tensor detectors, exact raw-fiber controls and whole original trace transfer needed for this complete coefficient region. They do not claim historical priority for those ingredients.
The entire proper second commutator layer
The common-background theorem of § 6 retains only the sums of the independent passive coefficients at each fixed depth. We now keep each passive diagonal independently. This recovers every proper ordinary polynomial in the second commutator layer, including the kernel of all common-background pair tests. The field remains algebraically closed of characteristic zero. The ideal J J J is the two-sided commutator ideal of the unital free associative algebra, as in Proposition 3.1 .
The common-background branch is already Theorem 6.1 . The additional proof has two parts: a compatible nilpotent tensor span for the complete independent-diagonal restriction, and an étale chart of the entire original source that retains its first nonzero trace normal. In particular, a triangular value alone is not used as an ambient flatness certificate.
The exact original two-slot restriction
Choose two original positions X , Y X,Y X , Y and label the other positions D 1 , … , D d D_1,\ldots,D_d D 1 , … , D d , where d = m − 2 ≥ 2 d=m-2\ge2 d = m − 2 ≥ 2 . For diagonal passive inputs write v a = ( ( D i ) a a ) i = 1 d v_a=((D_i)_{aa})_{i=1}^d v a = (( D i ) aa ) i = 1 d . For a subset S ⊆ [ d ] S\subseteq[d] S ⊆ [ d ] and a vector a = ( a i ) a=(a_i) a = ( a i ) put a S = ∏ i ∈ S a i a_S=\prod_{i\in S}a_i a S = ∏ i ∈ S a i , with empty product 1 1 1 .
Proposition 7.1 (Independent passive coefficients). For each original pair of a proper multilinear f ∈ J 2 f\in J^2 f ∈ J 2 there are unique arrays ( c S ) , ( e S ) (c_S),(e_S) ( c S ) , ( e S ) , indexed by ∅ ≠ S ⊆ [ d ] \varnothing\ne S\subseteq[d] ∅ = S ⊆ [ d ] , for which
P ( a , b ) = ∑ ∅ ≠ S ⊆ [ d ] c S a S b S c , Q ( a , b ) = ∑ ∅ ≠ S ⊆ [ d ] e S a S b S c , (67) P(a,b)=\sum_{\varnothing\ne S\subseteq[d]}c_Sa_Sb_{S^c},\qquad Q(a,b)=\sum_{\varnothing\ne S\subseteq[d]}e_Sa_Sb_{S^c}, \tag*{(67)} P ( a , b ) = ∅ = S ⊆ [ d ] ∑ c S a S b S c , Q ( a , b ) = ∅ = S ⊆ [ d ] ∑ e S a S b S c , (67)
and the complete actual restriction is
H D ( X , Y ) a c = f ( X , Y ; D 1 , … , D d ) a c = ∑ b [ P ( v a − v b , v b − v c ) X a b Y b c + Q ( v a − v b , v b − v c ) Y a b X b c ] . (68) \begin{aligned}
H_D(X,Y)_{ac}
&=f(X,Y;D_1,\ldots,D_d)_{ac}\\
&=\sum_b\left[P(v_a-v_b,v_b-v_c)X_{ab}Y_{bc}\right.\\
&\qquad\left.{}+Q(v_a-v_b,v_b-v_c)Y_{ab}X_{bc}\right]. \tag*{(68)}
\end{aligned} H D ( X , Y ) a c = f ( X , Y ; D 1 , … , D d ) a c = b ∑ [ P ( v a − v b , v b − v c ) X ab Y b c + Q ( v a − v b , v b − v c ) Y ab X b c ] . (68)
The positions on the first line are the original positions, regardless of the order used to display their names. At least one pair has ( P , Q ) ≠ ( 0 , 0 ) (P,Q)\ne(0,0) ( P , Q ) = ( 0 , 0 ) when f ∉ J 3 f\notin J^3 f ∈ / J 3 .
Proof. Expand each ordinary word according to the order of X , Y X,Y X , Y and the three passive gaps before, between and after them. This gives two path coefficients separately linear in each triple ( ( D i ) a a , ( D i ) b b , ( D i ) c c ) ((D_i)_{aa},(D_i)_{bb},(D_i)_{cc}) (( D i ) aa , ( D i ) bb , ( D i ) cc ) . Properness is scalar-translation invariance in every passive variable, so each triple occurs through one of its two successive differences. Thus each coefficient has a unique expansion in the 2 d 2^d 2 d products a S b S c a_Sb_{S^c} a S b S c before the two extreme subsets are removed.
A one-active evaluation with diagonal passive inputs vanishes. An off-diagonal entry is an evaluation of f f f on a two-dimensional upper triangular block, where J 2 J^2 J 2 vanishes; diagonal entries also vanish. Make X X X diagonal, and let Y Y Y have a single off-diagonal entry. The two independent endpoint entries of X X X give P ( 0 , b ) = Q ( a , 0 ) = 0 P(0,b)=Q(a,0)=0 P ( 0 , b ) = Q ( a , 0 ) = 0 . Interchanging the roles of X , Y X,Y X , Y gives $P(a,0) = Q ( 0 , b ) = 0 Q(0,b)=0 Q ( 0 , b ) = 0 . Hence both extreme coefficients vanish separately. This proves (67) and (68) for the unchanged original polynomial.
There is also exact finite extraction. On three vertices put
D i ( S ) = { E 11 , i ∈ S , − E 33 , i ∉ S . D_i^{(S)} =
\begin{cases}
E_{11}, & i \in S,\\
-E_{33}, & i \notin S.
\end{cases} D i ( S ) = { E 11 , − E 33 , i ∈ S , i ∈ / S .
Then
c S = f ( E 12 , E 23 ; D ( S ) ) 13 , e S = f ( E 23 , E 12 ; D ( S ) ) 13 . c_S=f(E_{12},E_{23};D^{(S)})_{13},\qquad e_S=f(E_{23},E_{12};D^{(S)})_{13}. c S = f ( E 12 , E 23 ; D ( S ) ) 13 , e S = f ( E 23 , E 12 ; D ( S ) ) 13 .
Every U T 3 UT_3 U T 3 evaluation expands into diagonal and strictly upper triangular inputs. Terms with at most one radical input vanish as above, and a word with three radical inputs vanishes because the radical has cube zero. The remaining terms have exactly two original active positions and are precisely these path tests. Thus vanishing of all the pair symbols would make f f f an identity of U T 3 UT_3 U T 3 . The classical triangular identity theorem Id ( U T r ) = J r \operatorname{Id}(UT_r)=J^r Id ( U T r ) = J r , used in the commutator-degree framework of [3 Theorem 2.1] , gives the final assertion for r = 3 r=3 r = 3 . □
The last implication uses the triangular identity theorem, not a claim that a nonzero free polynomial is nonzero on every fixed matrix algebra. Here the fixed-size issue can be settled directly: for n ≥ 3 n\geq3 n ≥ 3 the map
U T 3 ⟶ M n , T ⟼ diag ( T , t 11 I n − 3 ) UT_3 \longrightarrow M_n,\qquad T\longmapsto\operatorname{diag}(T,t_{11}I_{n-3}) U T 3 ⟶ M n , T ⟼ diag ( T , t 11 I n − 3 )
is a unital algebra embedding, since T ↦ t 11 T\mapsto t_{11} T ↦ t 11 is a character. Consequently
Id ( M n ) ⊆ Id ( U T 3 ) = J 3 ( n ≥ 3 ) . (69) \operatorname{Id}(M_n)\subseteq\operatorname{Id}(UT_3)=J^3\qquad(n\geq3). \tag*{(69)} Id ( M n ) ⊆ Id ( U T 3 ) = J 3 ( n ≥ 3 ) . (69)
In particular the theorem’s polynomial is not an identity in any of its asserted sizes. No such inclusion is used for n = 2 n=2 n = 2 .
If some common-D D D restriction is nonzero, the ordinary homogeneous symbols obtained by setting a = s 1 a=s1 a = s 1 , b = t 1 b=t1 b = t 1 satisfy the hypotheses of Theorem 6.1 . We therefore assume for the new branch that all original pair restrictions on a common D D D vanish, and choose a nonzero independent pair from Proposition 7.1. Then
∑ ∣ S ∣ = r c S = ∑ ∣ S ∣ = r e S = 0 ( 1 ≤ r ≤ d − 1 ) . \sum_{|S|=r}c_S=\sum_{|S|=r}e_S=0\qquad(1\leq r\leq d-1). ∣ S ∣ = r ∑ c S = ∣ S ∣ = r ∑ e S = 0 ( 1 ≤ r ≤ d − 1 ) .
It follows as a polynomial identity in all d d d coordinates that
P ( a , − a ) = a [ d ] ∑ S ( − 1 ) d − ∣ S ∣ c S = 0 , Q ( a , − a ) = 0. (70) P(a,-a)=a_{[d]}\sum_S(-1)^{d-|S|}c_S=0,\qquad Q(a,-a)=0. \tag*{(70)} P ( a , − a ) = a [ d ] S ∑ ( − 1 ) d − ∣ S ∣ c S = 0 , Q ( a , − a ) = 0. (70)
Thus H D H_D H D is hollow for every diagonal tuple and all full X , Y X,Y X , Y . It ignores diagonal parts of the active inputs, since both S S S and S c S^c S c are nonempty. The seed argument below only requires (67) , a nonzero pair, and (70) ; it does not require the stronger grouped coefficient sums once the endpoints have been established.
Independent-vector nilpotent tensor detection
Let V n = { X ∈ M n : X a a = 0 } V_n=\{X\in M_n:X_{aa}=0\} V n = { X ∈ M n : X aa = 0 } and, for a fixed diagonal tuple D = ( D 1 , … , D d ) D=(D_1,\ldots,D_d) D = ( D 1 , … , D d ) , define
Γ D ( X , Y , g ) = g H D ( X , Y ) g − 1 , g ∈ G L n . \Gamma_D(X,Y,g)=gH_D(X,Y)g^{-1},\qquad g\in GL_n. Γ D ( X , Y , g ) = g H D ( X , Y ) g − 1 , g ∈ G L n .
Its orbit directions are actual directions of the original polynomial: one simultaneously conjugates every D i , X , Y D_i,X,Y D i , X , Y . All tests and guards below concern the raw X , Y X,Y X , Y , before this conjugation. For S ⊆ [ d ] S\subseteq[d] S ⊆ [ d ] define the composition of commuting adjoint operators
K S ( X ) = ( ∏ i ∈ S ad D i ) ( X ) , K ∅ ( X ) = X . (71) K_S(X)=\left(\prod_{i\in S}\operatorname{ad}_{D_i}\right)(X),\qquad K_{\varnothing}(X)=X. \tag*{(71)} K S ( X ) = ( i ∈ S ∏ ad D i ) ( X ) , K ∅ ( X ) = X . (71)
Thus ( K S ( X ) ) a b = X a b ∏ i ∈ S ( ( D i ) a a − ( D i ) b b ) (K_S(X))_{ab}=X_{ab}\prod_{i\in S}((D_i)_{aa}-(D_i)_{bb}) ( K S ( X ) ) ab = X ab ∏ i ∈ S (( D i ) aa − ( D i ) bb ) ; (71) is not a product of the matrices ad D i ( X ) \operatorname{ad}_{D_i}(X) ad D i ( X ) .
Theorem 7.2 (One fixed diagonal open for all bilinear tests). Assume (67) , (70) and ( P , Q ) ≠ ( 0 , 0 ) (P,Q) \ne(0,0) ( P , Q ) = ( 0 , 0 ) . For every n ≥ 3 n \ge3 n ≥ 3 there is a nonempty open set Ω n \Omega_n Ω n of diagonal tuples, with each D i D_i D i regular, such that at every fixed D ∈ Ω n D \in\Omega_n D ∈ Ω n the tensors X ⊗ Y X \otimes Y X ⊗ Y of hollow pairs satisfying
N = H D ( X , Y ) ≠ 0 , rank N = 1 , N 2 = 0 , rank d Γ D ∣ ( X , Y , I ) = n 2 − 1 N=H_D(X,Y)\ne0,\qquad\operatorname{rank}N=1,\qquad N^2=0,\qquad\operatorname{rank}\mathrm{d}\Gamma_D|_{(X,Y,I)}=n^2-1 N = H D ( X , Y ) = 0 , rank N = 1 , N 2 = 0 , rank d Γ D ∣ ( X , Y , I ) = n 2 − 1 span V n ⊗ V n V_n\otimes V_n V n ⊗ V n . For n ≥ 4 n \ge4 n ≥ 4 the same assertion holds after imposing all 2 d 2^d 2 d guards
det K S ( X ) ≠ 0 ( S ⊆ [ d ] ) , (72) \det K_S(X)\ne0\qquad(S\subseteq[d]), \tag*{(72)} det K S ( X ) = 0 ( S ⊆ [ d ]) , (72) including S = ∅ S=\varnothing S = ∅ . Allowing arbitrary diagonal parts of X , Y X,Y X , Y then supplies one such original nilpotent seed where any prescribed nonzero bilinear form on full M n × M n M_n\times M_n M n × M n is nonzero.
The span is only a bilinear detector. It selects one input compatible with a subsequently specified nonzero test and does not add actual polynomial values. Both the fixed-D D D quantifier and the full active matrix spaces will be needed for the trace normal.
For notation write
P i k j = P ( v i − v k , v k − v j ) , Q i k j = Q ( v i − v k , v k − v j ) . P_{ikj}=P(v_i-v_k,v_k-v_j),\qquad Q_{ikj}=Q(v_i-v_k,v_k-v_j). P ik j = P ( v i − v k , v k − v j ) , Q ik j = Q ( v i − v k , v k − v j ) .
For every distinct triple i , k , j i,k,j i , k , j each nonzero symbol gives a nonzero polynomial in the diagonal parameters: the two vector differences can be prescribed independently. The product of all such nonzero path weights and all coordinatewise eigenvalue differences is therefore nonzero. We may impose their simultaneous nonvanishing on one diagonal open. At any such D D D , each guard determinant is a nonzero polynomial on the full affine space V h V_h V h , h ≥ 3 h\ge3 h ≥ 3 : take X X X supported on a directed Hamiltonian cycle, whose nonzero edges remain nonzero after every subset rescaling. This observation alone does not put the guards on a nilpotent fiber; that step is proved below.
Lemma 7.3 (The common zero row in size three). The unguarded assertion of Theorem 7.2 holds in size three on the simultaneous path-weight open just described.
Proof. Let R i ⊂ V 3 R_i\subset V_3 R i ⊂ V 3 be the matrices with row i i i zero. For X , Y ∈ R i X,Y\in R_i X , Y ∈ R i , the complementary two-by-two hollow block can contribute only diagonal products, and these vanish by (70) . Every nonzero output is consequently a column star supported in column i i i , of rank one and square zero.
Use i = 1 i=1 i = 1 first. If both symbols are nonzero, put
X = u E 23 + v E 32 , Y = c 2 E 21 + c 3 E 31 , u v c 2 c 3 ≠ 0. X=uE_{23}+vE_{32},\qquad Y=c_2E_{21}+c_3E_{31},\qquad uvc_2c_3\ne0. X = u E 23 + v E 32 , Y = c 2 E 21 + c 3 E 31 , uv c 2 c 3 = 0. The value has entries N 21 = P 231 u c 3 N_{21}=P_{231}uc_3 N 21 = P 231 u c 3 and N 31 = P 321 v c 2 N_{31}=P_{321}vc_2 N 31 = P 321 v c 2 , both nonzero. The Y Y Y variations E 21 , E 31 E_{21},E_{31} E 21 , E 31 control respectively H 31 , H 21 H_{31},H_{21} H 31 , H 21 ; the Y Y Y variations E 12 , E 13 E_{12},E_{13} E 12 , E 13 control H 13 , H 12 H_{13},H_{12} H 13 , H 12 through Q Q Q ; the X X X variations E 12 , E 13 E_{12},E_{13} E 12 , E 13 control H 32 , H 23 H_{32},H_{23} H 32 , H 23 through Q Q Q . The indicated weights and parameters are all nonzero, so these are six independent hollow controls. The actual orbit directions E 12 , E 13 E_{12},E_{13} E 12 , E 13 have diagonal projections N 21 ( E 11 − E 22 ) N_{21}(E_{11}-E_{22}) N 21 ( E 11 − E 22 ) and N 31 ( E 11 − E 33 ) N_{31}(E_{11}-E_{33}) N 31 ( E 11 − E 33 ) . Thus the saturated differential has rank eight.
If Q = 0 Q=0 Q = 0 , take every entry 21 , 31 , 23 , 32 21,31,23,32 21 , 31 , 23 , 32 of both X , Y X,Y X , Y nonzero. The Y 21 , Y 31 Y_{21},Y_{31} Y 21 , Y 31 variations give the two lower-column coordinates; X 12 , X 13 X_{12},X_{13} X 12 , X 13 give the upper row using Y 23 , Y 32 Y_{23},Y_{32} Y 23 , Y 32 ; and Y 12 , Y 13 Y_{12},Y_{13} Y 12 , Y 13 give the lower off-diagonal coordinates using X 31 , X 21 X_{31},X_{21} X 31 , X 21 . Additional lower-column components, if present, are removed with the first two controls. Again the hollow rank is six and the orbit rank is eight. If P = 0 P=0 P = 0 , exchange the actual active inputs. Relabeling vertices gives the construction on each R i × R i R_i\times R_i R i × R i .
The good conditions are a nonempty open in the whole irreducible space R i × R i R_i\times R_i R i × R i . A bilinear form vanishing on all good seeds therefore vanishes identically on each such space. Any two hollow matrix units omit a common row in size three; hence every tensor coefficient is zero. This proves the assertion without imposing a one-variable homogeneity condition or a size-three guard.
Cycle determinants with vector differences
Put a = v 1 − v 2 a=v_1-v_2 a = v 1 − v 2 , b = v 2 − v 3 b=v_2-v_3 b = v 2 − v 3 , and c = − a − b c=-a-b c = − a − b . Define
Δ ( a , b ) = P ( a , b ) P ( b , c ) P ( c , a ) + Q ( a , b ) Q ( b , c ) Q ( c , a ) . (73) \Delta(a,b)=P(a,b)P(b,c)P(c,a)+Q(a,b)Q(b,c)Q(c,a). \tag*{(73)} Δ ( a , b ) = P ( a , b ) P ( b , c ) P ( c , a ) + Q ( a , b ) Q ( b , c ) Q ( c , a ) . (73)
The norm is a polynomial in 2 d 2d 2 d independent coordinates. In size three, use the input and output orders
( Y 13 , Y 21 , Y 32 ; Y 12 , Y 23 , Y 31 ) (Y_{13},Y_{21},Y_{32};Y_{12},Y_{23},Y_{31}) ( Y 13 , Y 21 , Y 32 ; Y 12 , Y 23 , Y 31 ) , ( H 12 , H 23 , H 31 ; H 13 , H 21 , H 32 ) (H_{12},H_{23},H_{31};H_{13},H_{21},H_{32}) ( H 12 , H 23 , H 31 ; H 13 , H 21 , H 32 ) .
The operator L D , X : Y ↦ H D ( X , Y ) L_{D,X}:Y\mapsto H_D(X,Y) L D , X : Y ↦ H D ( X , Y ) then has the two cyclic blocks
( Q 132 X 32 0 P 132 X 13 P 213 X 21 Q 213 X 13 0 0 P 321 X 32 Q 321 X 21 ) , ( Q 123 X 23 P 123 X 12 0 0 Q 231 X 31 P 231 X 23 P 312 X 31 0 Q 312 X 12 ) . (74) \left(\begin{array}{ccc}
Q_{132}X_{32} & 0 & P_{132}X_{13}\\
P_{213}X_{21} & Q_{213}X_{13} & 0\\
0 & P_{321}X_{32} & Q_{321}X_{21}
\end{array}\right),\qquad
\left(\begin{array}{ccc}
Q_{123}X_{23} & P_{123}X_{12} & 0\\
0 & Q_{231}X_{31} & P_{231}X_{23}\\
P_{312}X_{31} & 0 & Q_{312}X_{12}
\end{array}\right). \tag*{(74)} Q 132 X 32 P 213 X 21 0 0 Q 213 X 13 P 321 X 32 P 132 X 13 0 Q 321 X 21 , Q 123 X 23 0 P 312 X 31 P 123 X 12 Q 231 X 31 0 0 P 231 X 23 Q 312 X 12 . (74)
Their determinants are respectively
( − 1 ) 3 d X 13 X 21 X 32 Δ ( b , a ) , X 12 X 23 X 31 Δ ( a , b ) . (-1)^{3d}X_{13}X_{21}X_{32}\Delta(b,a),\qquad X_{12}X_{23}X_{31}\Delta(a,b). ( − 1 ) 3 d X 13 X 21 X 32 Δ ( b , a ) , X 12 X 23 X 31 Δ ( a , b ) .
The sign follows from simultaneous reversal of every difference: P ( − b , − a ) = ( − 1 ) d P ( b , a ) P(-b,-a)=(-1)^dP(b,a) P ( − b , − a ) = ( − 1 ) d P ( b , a ) , and similarly for Q Q Q . Only total degree d d d is used, not homogeneity in one scalar difference. If Δ \Delta Δ is nonzero, both oriented factors are simultaneously nonzero on an open. If Δ = 0 \Delta=0 Δ = 0 , both P , Q P,Q P , Q are nonzero: when only one is present, the three invertible linear substitutions in its product cannot make a nonzero polynomial vanish in a domain.
Lemma 7.4 (Independent diagonal rectangle operators). Suppose P , Q ≠ 0 P,Q\ne0 P , Q = 0 and every K S ( X 0 ) K_S(X_0) K S ( X 0 ) is invertible in size h h h . Adjoin new independent diagonal entries z = ( z 1 , … , z d ) z=(z_1,\ldots,z_d) z = ( z 1 , … , z d ) and set E i = D i o l d − z i I h E_i=D_i^{\mathrm{old}}-z_iI_h E i = D i old − z i I h , E S = ∏ i ∈ S E i E_S=\prod_{i\in S}E_i E S = ∏ i ∈ S E i . At X = diag ( X 0 , 0 ) X=\operatorname{diag}(X_0,0) X = diag ( X 0 , 0 ) the complete two new Y Y Y rectangles are F ( z ) y F(z)y F ( z ) y and w G ( z ) wG(z) w G ( z ) , where
F ( z ) = ∑ S c S K S ( X 0 ) E S c , G ( z ) = ∑ S e S ( − 1 ) ∣ S ∣ E S K S c ( X 0 ) . (75) F(z)=\sum_S c_SK_S(X_0)E_{S^c},\qquad G(z)=\sum_S e_S(-1)^{|S|}E_SK_{S^c}(X_0). \tag*{(75)} F ( z ) = S ∑ c S K S ( X 0 ) E S c , G ( z ) = S ∑ e S ( − 1 ) ∣ S ∣ E S K S c ( X 0 ) . (75) Both determinant polynomials in the independent z i z_i z i are nonzero.
Proof. The block formula follows directly from (68) . In particular the P P P and Q Q Q sums act on separate rectangles. The old hollow operator is unchanged, and diagonal outputs vanish identically.
Assign weights w i = 2 i − 1 w_i=2^{i-1} w i = 2 i − 1 to the z i z_i z i . All subset weight sums are distinct, and every proper submonomial of a squarefree subset monomial has smaller weight. Choose S ∗ S_* S ∗ with c S ∗ ≠ 0 c_{S_*}\ne0 c S ∗ = 0 maximizing ∑ i ∈ S ∗ c w i \sum_{i\in S_*^c}w_i ∑ i ∈ S ∗ c w i . The unique top-weight term of F F F is
( − 1 ) ∣ S ∗ c ∣ c S ∗ K S ∗ ( X 0 ) z S ∗ c . (-1)^{|S_*^c|}c_{S_*}K_{S_*}(X_0)z_{S_*^c}. ( − 1 ) ∣ S ∗ c ∣ c S ∗ K S ∗ ( X 0 ) z S ∗ c . Every other monomial in every entry has strictly smaller weight. Thus in the determinant the unique top-weight monomial has coefficient
det ( ( − 1 ) ∣ S ∗ c ∣ c S ∗ K S ∗ ( X 0 ) ) ≠ 0 \det\left((-1)^{|S_*^c|}c_{S_*}K_{S_*}(X_0)\right)\ne0 det ( ( − 1 ) ∣ S ∗ c ∣ c S ∗ K S ∗ ( X 0 ) ) = 0 and monomial z S ∗ c z_{S_*^c} z S ∗ c . Any determinant product using a lower-weight term has smaller total weight and cannot cancel it. For G G G select S ∗ S_* S ∗ maximizing its subset weight among e S ≠ 0 e_S\ne0 e S = 0 . The signs from ( − 1 ) ∣ S ∣ E S (-1)^{|S|}E_S ( − 1 ) ∣ S ∣ E S cancel in the top coefficient, which is e S ∗ K S ∗ c ( X 0 ) e_{S_*}K_{S_*^c}(X_0) e S ∗ K S ∗ c ( X 0 ) , again invertible. This proves actual matrix determinant nonvanishing in every fixed size; it makes no assumption that a formal noncommutative leading word avoids matrix identities. □ \square □
Lemma 7.5 (Invertible hollow operators and bilinear detection). If Δ ≠ 0 \Delta\ne0 Δ = 0 , the guarded hollow assertion of Theorem 7.2 holds in every n ≥ 3 n\ge3 n ≥ 3 .
Proof. When both symbols are present, the cyclic determinants give the invertible L D , X L_{D,X} L D , X locus in size three. Intersect it with all subset guards in the full affine hollow X X X -space. Given such a size-h h h point, the cold operator and the two rectangles of (75) are independent blocks of the operator at X = diag ( X 0 , 0 ) X=\operatorname{diag}(X_0,0) X = diag ( X 0 , 0 ) . Lemma 7.4 permits one choice of z z z avoiding both determinant zero sets and every coordinatewise eigenvalue collision. The new operator is invertible. Its nonempty open locus in the entire new V h + 1 V_{h+1} V h + 1 intersects every new subset guard, preparing the next step. No constrained nilpotent fiber is used in this open intersection.
If Q = 0 Q=0 Q = 0 , a different proof avoids an absent rectangle. For each output column j j j , the operator on vertices other than j j j is the hollow ( n − 1 ) (n-1) ( n − 1 ) -square matrix
M j ( X ) i k = P i k j X i k ( i , k ≠ j , i ≠ k ) . M_j(X)_{ik}=P_{ikj}X_{ik}\quad(i,k\ne j,\ i\ne k). M j ( X ) ik = P ik j X ik ( i , k = j , i = k ) .
A derangement of these n − 1 ≥ 2 n-1\ge2 n − 1 ≥ 2 vertices contributes a determinant monomial with nonzero path-weight coefficient. Distinct permutations give distinct monomials in the independent entries of X X X , so det M j \det M_j det M j is nonzero. The product over j j j , and with all the subset guards, is nonzero. For P = 0 P=0 P = 0 the row version follows by transposition of the full map, with the two difference arguments interchanged. Thus it also produces an invertible fixed-X X X operator, rather than merely an invertible operator with the other input fixed.
A nonzero coefficient of det L D , X \det L_{D,X} det L D , X remains nonzero on a nonempty diagonal open. At each such fixed D D D let U D ⊂ V n U_D\subset V_n U D ⊂ V n be its dense invertibility-and-guards open. For X ∈ U D X\in U_D X ∈ U D , choose any full-support hollow column star N = w e j t N=we_j^t N = w e j t and set Y = L D , X − 1 N Y=L_{D,X}^{-1}N Y = L D , X − 1 N . This is an actual input; with both orders present Y Y Y need not itself be a column star. The Y Y Y derivative fills V n V_n V n , and the orbit directions have diagonal projections w i ( E j j − E i i ) w_i(E_{jj}-E_{ii}) w i ( E j j − E ii ) , i ≠ j i\ne j i = j . Hence this is a smooth nilpotent seed.
If T T T vanishes at all such seeds, for fixed X ∈ U D X\in U_D X ∈ U D the linear functional N ↦ T ( X , L D , X − 1 N ) N\mapsto T(X,L_{D,X}^{-1}N) N ↦ T ( X , L D , X − 1 N ) vanishes on a dense open of every hollow column space. It vanishes on all those spaces and therefore on their span V n V_n V n . Thus T ( X , Y ) = 0 T(X,Y)=0 T ( X , Y ) = 0 for all hollow Y Y Y ; density in X X X gives T = 0 T=0 T = 0 . No addition of actual polynomial values occurs in this linear-functional argument. □ \square □
The zero cycle norm on four vertices
It remains to treat Δ = 0 \Delta=0 Δ = 0 . Both symbols are then nonzero, since a nonzero one-order symbol has nonzero cycle norm. In size four choose a diagonal tuple with every D i D_i D i regular such that every triple-distinct P i k j P_{ikj} P ik j and Q i k j Q_{ikj} Q ik j is nonzero. Their finite product is a nonzero polynomial, so these choices form a nonempty open set. We first use three lower vertices a , b , c a,b,c a , b , c , reserving a fourth vertex 0 0 0 .
Lemma 7.6. Let A ∈ V 3 A\in V_3 A ∈ V 3 have all six entries nonzero. The complete lower operator L A : B ↦ H D l o w ( A , B ) L_A:B\mapsto H_{D_{\mathrm{low}}}(A,B) L A : B ↦ H D low ( A , B ) has rank four. Its kernel has a basis supported on the two opposite directed three-cycles, with each nonzero coordinate a fixed-D D D nonzero scalar times the corresponding entry of A A A . Its conormal for the hollow trace pairing also has a basis of two invertible matrices supported on opposite directed three-cycles.
Proof. In input coordinates ( B a c , B b a , B c b ) (B_{ac},B_{ba},B_{cb}) ( B a c , B ba , B c b ) and output coordinates ( H a b , H b c , H c a ) (H_{ab},H_{bc},H_{ca}) ( H ab , H b c , H c a ) one block is
( Q a c b A c b 0 P a c b A a c P b a c A b a Q b a c A a c 0 0 P c b a A c b Q c b a A b a ) (76) \begin{pmatrix}
Q_{acb}A_{cb} & 0 & P_{acb}A_{ac}\\
P_{bac}A_{ba} & Q_{bac}A_{ac} & 0\\
0 & P_{cba}A_{cb} & Q_{cba}A_{ba} \tag*{(76)}
\end{pmatrix} Q a c b A c b P ba c A ba 0 0 Q ba c A a c P c ba A c b P a c b A a c 0 Q c ba A ba (76)
The opposite cycle gives the other block, exactly as in (74) . Each determinant is zero by (73) , while its upper-left two-by-two minor is nonzero. Each block is of rank exactly two.
For the displayed block an explicit right-kernel matrix B ( 1 ) B^{(1)} B ( 1 ) is
B a c ( 1 ) = A a c , B b a ( 1 ) = − P b a c Q b a c A b a , B c b ( 1 ) = − Q a c b P a c b A c b , (77) B^{(1)}_{ac}=A_{ac},\qquad
B^{(1)}_{ba}=-\frac{P_{bac}}{Q_{bac}}A_{ba},\qquad
B^{(1)}_{cb}=-\frac{Q_{acb}}{P_{acb}}A_{cb}, \tag*{(77)} B a c ( 1 ) = A a c , B ba ( 1 ) = − Q ba c P ba c A ba , B c b ( 1 ) = − P a c b Q a c b A c b , (77)
with its other entries zero. The first two equations are immediate; the third is precisely P a c b P b a c P c b a + Q a c b Q b a c Q c b a = 0 P_{acb}P_{bac}P_{cba}+Q_{acb}Q_{bac}Q_{cba}=0 P a c b P ba c P c ba + Q a c b Q ba c Q c ba = 0 . Interchanging b , c b,c b , c gives B ( 2 ) B^{(2)} B ( 2 ) on the opposite cycle. In particular the six entries of A A A remain independent variables; the coefficients in these two kernel vectors depend only on D D D .
For an equally explicit conormal, a left null vector of (76) is
( 1 , − Q a c b A c b P b a c A b a , Q a c b Q b a c A a c P b a c P c b a A b a ) . \left(1,-\frac{Q_{acb}A_{cb}}{P_{bac}A_{ba}},\frac{Q_{acb}Q_{bac}A_{ac}}{P_{bac}P_{cba}A_{ba}}\right). ( 1 , − P ba c A ba Q a c b A c b , P ba c P c ba A ba Q a c b Q ba c A a c ) .
Its three coordinates are nonzero. Transposing its output positions for the trace pairing gives
C 1 = E b a − Q a c b A c b P b a c A b a E c b + Q a c b Q b a c A a c P b a c P c b a A b a E a c . (78) C_1=E_{ba}-\frac{Q_{acb}A_{cb}}{P_{bac}A_{ba}}E_{cb}
+\frac{Q_{acb}Q_{bac}A_{ac}}{P_{bac}P_{cba}A_{ba}}E_{ac}. \tag*{(78)} C 1 = E ba − P ba c A ba Q a c b A c b E c b + P ba c P c ba A ba Q a c b Q ba c A a c E a c . (78)
It satisfies tr ( C 1 L A ( B ) ) = 0 \operatorname{tr}(C_1L_A(B))=0 tr ( C 1 L A ( B )) = 0 for every hollow B B B , and is an invertible directed-cycle matrix. Interchanging b , c b,c b , c gives C 2 C_2 C 2 . Their supports are disjoint and opposite. They form a basis of the two-dimensional conormal of the full rank-four lower operator. □
A full size-four star differential.
Lemma 7.7. For every D D D in the size-four open just chosen, a nonempty open subset of the entire column-star parameter space
X = ( 0 0 0 A ) , Y = v e 0 t , ( A , v ) ∈ V 3 × K 3 , X=\begin{pmatrix}0&0\\0&A\end{pmatrix},\qquad Y=ve_0^t,\qquad(A,v)\in V_3\times K^3, X = ( 0 0 0 A ) , Y = v e 0 t , ( A , v ) ∈ V 3 × K 3 , consists of nonzero rank-one square-zero seeds for which the fixed-D D D derivative d H D dH_D d H D is onto V 4 V_4 V 4 . The same assertion holds for row stars. The lower block A A A can simultaneously satisfy all its subset adjoint guards.
Proof. At the displayed input,
H D ( X , Y ) = N = w e 0 t , w = F v , F i j = P i j 0 A i j ( i , j ∈ { a , b , c } ) , (79) H_D(X,Y)=N=we_0^t,\qquad w=Fv,\qquad F_{ij}=P_{ij0}A_{ij}\quad(i,j\in\{a,b,c\}), \tag*{(79)} H D ( X , Y ) = N = w e 0 t , w = F v , F ij = P ij 0 A ij ( i , j ∈ { a , b , c }) , (79)
where the diagonal of F F F is zero. The upper-row Y Y Y derivative is r ↦ r G r\mapsto rG r ↦ r G , with
G i j = Q 0 i j A i j ( i , j ∈ { a , b , c } ) , G i i = 0. G_{ij}=Q_{0ij}A_{ij}\quad(i,j\in\{a,b,c\}),\qquad G_{ii}=0. G ij = Q 0 ij A ij ( i , j ∈ { a , b , c }) , G ii = 0.
The determinants of F F F and G G G each have the two distinct cycle monomials A a b A b c A c a A_{ab}A_{bc}A_{ca} A ab A b c A c a and A a c A c b A b a A_{ac}A_{cb}A_{ba} A a c A c b A ba with nonzero coefficients. Each determinant is therefore a nonzero polynomial in the same six original entries of A A A . The determinants det K S ( A ) \det K_S(A) det K S ( A ) for all S ⊆ [ d ] S\subseteq[d] S ⊆ [ d ] are likewise nonzero polynomials, as is seen on a single directed-cycle support. Choose one A A A where all six entries, both rectangle determinants, and all those lower guards are nonzero. This is an intersection of opens in the full irreducible space V 3 V_3 V 3 .
The complete fixed-D D D hollow Y Y Y derivative is the direct sum of these two invertible three-dimensional rectangles and the rank-four operator L A L_A L A . Its rank is 3 + 3 + 4 = 10 3+3+4=10 3 + 3 + 4 = 10 . Its two-dimensional hollow conormal is precisely the span of C 1 , C 2 C_1,C_2 C 1 , C 2 from Lemma 7.6 , embedded in the lower block.
Now vary the three entries of the raw upper row of X X X by a = ( a j ) j ∈ { a , b , c } a=(a_j)_{j\in\{a,b,c\}} a = ( a j ) j ∈ { a , b , c } . Its only possibly nonzero output is the lower hollow block
( d H D ) i j = Q i 0 j v i a j ( i ≠ j ) . (80) (dH_D)_{ij}=Q_{i0j}v_i a_j\quad(i\ne j). \tag*{(80)} ( d H D ) ij = Q i 0 j v i a j ( i = j ) . (80)
The diagonal entries are zero by the endpoint hypothesis. For a lower conormal C C C , its pairing with this output is
tr ( C d H D ) = ∑ j a j ( M C v ) j , ( M C ) j i = C j i Q i 0 j , ( M C ) j j = 0. \operatorname{tr}(C\,dH_D)=\sum_j a_j(M_Cv)_j,\qquad(M_C)_{ji}=C_{ji}Q_{i0j},\qquad(M_C)_{jj}=0. tr ( C d H D ) = j ∑ a j ( M C v ) j , ( M C ) j i = C j i Q i 0 j , ( M C ) j j = 0.
Both M C 1 M_{C_1} M C 1 and M C 2 M_{C_2} M C 2 are still invertible directed-cycle matrices: every multiplier on their supports is nonzero. Their opposite disjoint supports prevent proportionality. It follows that M C 1 v , M C 2 v M_{C_1}v,M_{C_2}v M C 1 v , M C 2 v are independent on a nonempty open set of v v v . Indeed, dependence for every v v v would make every vector an eigenvector of M C 1 − 1 M C 2 M_{C_1}^{-1}M_{C_2} M C 1 − 1 M C 2 , forcing that operator to be scalar, contrary to the supports.
Choose v v v in that open with both v v v and F v Fv F v of full support. These conditions are simultaneously possible because F F F is invertible and the vector space is irreducible. The three actual upper-row X X X directions then fill the two-dimensional quotient of V 4 V_4 V 4 by the Y Y Y image. Thus the full fixed-D D D hollow derivative has rank 12. The value N N N in (79) is nonzero rank one and square-zero, with all three complementary column entries nonzero. The orbit directions E 0 i E_{0i} E 0 i have diagonal projections v i ( E 00 − E i i ) v_i(E_{00}-E_{ii}) v i ( E 00 − E ii ) , giving the remaining three independent directions and rank 15 for d Γ D d\Gamma_D d Γ D .
All the conditions used are open in the whole star parameter space, and we have shown their simultaneous nonemptiness. To obtain row stars for the same original symbols use
H P , Q ( D , X t , Y t ) = ( − 1 ) d H Q S W , P S W ( D , X , Y ) t , R s w ( a , b ) = R ( b , a ) . (81) H_{P,Q}(D,X^t,Y^t)=(-1)^dH_{\mathrm{QSW},\mathrm{PSW}}(D,X,Y)^t,\qquad R^{\mathrm{sw}}(a,b)=R(b,a). \tag*{(81)} H P , Q ( D , X t , Y t ) = ( − 1 ) d H QSW , PSW ( D , X , Y ) t , R sw ( a , b ) = R ( b , a ) . (81)
The transformed pair has zero endpoints and zero cycle norm, since its norm is Δ ( b , a ) \Delta(b,a) Δ ( b , a ) . Its triple-distinct weights are nonzero under our same conditions on D D D , by reversal of the path and homogeneity. The preceding column proof therefore applies to it. Transpose preserves all ranks and the subset adjoint guards, since K S ( X t ) = ( − 1 ) ∣ S ∣ K S ( X ) t K_S(X^t)=(-1)^{|S|}K_S(X)^t K S ( X t ) = ( − 1 ) ∣ S ∣ K S ( X ) t . □
:::
Restoring guards in the exact raw fiber.
Lemma 7.8. At any column star in the nonempty open constructed in Lemma 7.7 , the exact raw fiber H D = N H_D=N H D = N is smooth, and its local ring contains a nonzero product of all raw X X X guard determinants. Every function whose germ on this fiber is nonzero can be retained at an actual guarded smooth nilpotent seed in this same fiber. The corresponding assertion holds at row stars.
Proof. The surjectivity of the fixed-D D D hollow differential makes
F N = { ( X ′ , Y ′ ) ∈ V 4 × V 4 : H D ( X ′ , Y ′ ) = N } \mathcal{F}_N=\{(X',Y')\in V_4\times V_4:H_D(X',Y')=N\} F N = {( X ′ , Y ′ ) ∈ V 4 × V 4 : H D ( X ′ , Y ′ ) = N } smooth at the star p p p . Its local ring R = O F N , p R=\mathcal{O}_{\mathcal{F}_N,p} R = O F N , p is a regular local domain. The map from the three raw upper-row X X X variations to the two-dimensional quotient by the Y Y Y image has rank two. Choose a nonzero row a a a in its one-dimensional kernel. Its complete output lies in the Y Y Y image and can therefore be cancelled by an actual hollow Y Y Y variation. Independently, every raw lower-column X X X variation z z z has zero output: both products with the current Y = v e 0 t Y=v e_0^t Y = v e 0 t vanish. Consequently, for every z z z , the raw variation
X ˙ = ( 0 a z 0 ) \dot{X}=\begin{pmatrix}0&a\\z&0\end{pmatrix} X ˙ = ( 0 z a 0 ) can be completed by a hollow Y ˙ \dot{Y} Y ˙ to a tangent vector of the exact fiber F N \mathcal{F}_N F N . No output conjugation is involved.
Put E i = D i l o w − ( D i ) 00 I 3 E_i=D_i^{\mathrm{low}}-(D_i)_{00}I_3 E i = D i low − ( D i ) 00 I 3 , E S = ∏ i ∈ S E i E_S=\prod_{i\in S}E_i E S = ∏ i ∈ S E i and A S = K S ( A ) A_S=K_S(A) A S = K S ( A ) , with the latter computed using the lower diagonal tuple. All E i , A S E_i,A_S E i , A S are invertible. Smoothness lifts any such tangent to a formal arc in F N \mathcal{F}_N F N . Along it the raw X X X remains hollow, its upper and lower cross blocks start with t a ta t a and t z tz t z , and its lower block starts with A A A . The Schur complement gives, for every subset S ⊆ [ d ] S\subseteq[d] S ⊆ [ d ] ,
det K S ( X ( t ) ) = ( − 1 ) ∣ S ∣ + 1 t 2 det ( A S ) a E S A S − 1 E S z + O ( t 3 ) . (82) \det K_S(X(t))=(-1)^{|S|+1}t^2\det(A_S)aE_SA_S^{-1}E_Sz+O(t^3). \tag*{(82)} det K S ( X ( t )) = ( − 1 ) ∣ S ∣ + 1 t 2 det ( A S ) a E S A S − 1 E S z + O ( t 3 ) . (82) In particular second-order changes in the lower block or the cross blocks cannot alter the displayed coefficient; the upper-left raw entry is identically zero, even for S = ∅ S=\varnothing S = ∅ . For each S S S the row a E S A S − 1 E S aE_SA_S^{-1}E_S a E S A S − 1 E S is nonzero. Choose one z z z outside the finitely many annihilating hyperplanes. Every determinant in (82) is then nonzero on the formal arc. Their product is consequently a nonzero element of R R R . The fixed-D D D and saturated smoothness minors already nonzero at p p p are units in R R R .
Let b ∈ R b\in R b ∈ R be any nonzero function germ. The product of b b b , the guard product, and these minors is nonzero because R R R is a domain. On a sufficiently small finite-type neighborhood in the component through p p p , its nonvanishing defines a nonempty open set. As K K K is algebraically closed, this open set has an actual K K K -point. At that point the raw value is still exactly N N N , all guards hold, the seed is smooth, and b b b is nonzero. This proves the stated retention property, not merely a formal existence claim. The transpose identity (81) transports the entire raw-fiber argument to row stars.
Corollary 7.9. If a bilinear form T T T on V 4 × V 4 V_4\times V_4 V 4 × V 4 vanishes at every guarded smooth nilpotent seed, its entire germ on the exact raw fiber at every star in Lemma 7.7 is zero.
Proof. A nonzero germ could be retained at a guarded smooth seed in the same raw fiber by Lemma 7.8 , contradicting the hypothesis on T T T .
Six independent monomials and the guarded base.
Lemma 7.10. For each D D D in the above size-four diagonal open, the tensors of guarded smooth nonzero rank-one square-zero seeds span V 4 ⊗ V 4 V_4\otimes V_4 V 4 ⊗ V 4 .
Proof. Suppose a bilinear form T T T annihilates all such tensors. By Corollary 7.9 it vanishes at every generic column or row star. Polynomial continuation on the whole irreducible star parameter space makes its restriction identically zero there.
First consider two hollow units E a b , E c d E_{ab},E_{cd} E ab , E c d with { a , b } ≠ { c , d } \{a,b\}\ne\{c,d\} { a , b } = { c , d } . The second edge has an endpoint outside { a , b } \{a,b\} { a , b } . If d d d is such an endpoint, use the column star isolated at d d d : E a b E_{ab} E ab belongs to its
lower block and E c d E_{cd} E c d to its column. If c c c is such an endpoint, use the row star isolated at c c c instead. Thus
T ( E a b , E c d ) = 0 if { a , b } ≠ { c , d } . (83) T(E_{ab},E_{cd})=0 \quad\text{if } \{a,b\}\ne\{c,d\}. \tag*{(83)} T ( E ab , E c d ) = 0 if { a , b } = { c , d } . (83)
This eliminates four-distinct-vertex coefficients as well, without an embedding assertion from size three. No relation between the remaining same-edge and reversed-edge coefficients has been assumed.
Fix now an isolated vertex 0 0 0 and a generic lower block A A A . Choose a v v v making its column star one of the smooth points above. For either of the explicit lower kernel matrices B ( ν ) B^{(\nu)} B ( ν ) in (77) , the line
( X , Y t ) = ( ( 0 0 0 A ) , v e 0 t + t ( 0 0 0 B ( ν ) ) ) (84) (X,Y_t)=\left(\begin{pmatrix}0&0\\0&A\end{pmatrix},v e_0^t+t\begin{pmatrix}0&0\\0&B^{(\nu)}\end{pmatrix}\right) \tag*{(84)} ( X , Y t ) = ( ( 0 0 0 A ) , v e 0 t + t ( 0 0 0 B ( ν ) ) ) (84)
lies in the exact same raw fiber: the additional full output is t L A ( B ( ν ) ) = 0 tL_A(B^{(\nu)})=0 t L A ( B ( ν ) ) = 0 . The zero germ from Corollary 7.9 , restricted to this line, gives
T ( ( 0 0 0 A ) , ( 0 0 0 B ( ν ) ) ) = 0. T\left(\begin{pmatrix}0&0\\0&A\end{pmatrix},\begin{pmatrix}0&0\\0&B^{(\nu)}\end{pmatrix}\right)=0. T ( ( 0 0 0 A ) , ( 0 0 0 B ( ν ) ) ) = 0.
Let C \mathcal{C} C be the directed three-cycle supporting one such kernel vector, and write B e = γ e A e B_e=\gamma_eA_e B e = γ e A e on it. Each γ e ∈ K ∗ \gamma_e\in K^* γ e ∈ K ∗ depends only on D D D , and the cycle contains exactly one orientation of each unordered lower edge. Using (83) , the preceding identity is
∑ e ∈ C γ e ( T ( E e , E e ) A e 2 + T ( E e ˉ , E e ) A e ˉ A e ) = 0 , (85) \sum_{e\in\mathcal{C}}\gamma_e\left(T(E_e,E_e)A_e^2+T(E_{\bar e},E_e)A_{\bar e}A_e\right)=0, \tag*{(85)} e ∈ C ∑ γ e ( T ( E e , E e ) A e 2 + T ( E e ˉ , E e ) A e ˉ A e ) = 0 , (85)
where e ˉ \bar e e ˉ denotes the reverse edge. This identity holds for a nonempty open set of the six independent entries of A A A , hence is a polynomial identity in them. Its three square monomials and three unordered-edge product monomials are six distinct monomials. Every coefficient displayed in (85) therefore vanishes. The opposite kernel cycle kills the other three square coefficients and the opposite three ordered reverse-edge coefficients on this lower triangle.
Varying the isolated vertex covers every unordered edge of the four-vertex set. All coefficients left after (83) consequently vanish, and T = 0 T=0 T = 0 . The two kernel shifts were taken in a fiber of the full operator, at a common original input, rather than in fibers of its summands. □
Exact guarded extension and one common diagonal open.
Lemma 7.11 (Singleton extension in the exact saturated fiber). Suppose P , Q ≠ 0 P,Q\ne0 P , Q = 0 and a hollow smooth nilpotent seed in size h ≥ 4 h\ge4 h ≥ 4 satisfies every subset guard. For a generic new diagonal vector z = ( z 1 , … , z d ) z=(z_1,\ldots,z_d) z = ( z 1 , … , z d ) it extends to a guarded smooth nilpotent seed in size h + 1 h+1 h + 1 . Any raw function nonzero at the provisional input in the proof can be retained while restoring the guards.
Proof. Write H D o l d ( X 0 , Y 0 ) = N 0 = u 0 v 0 t H_D^{\mathrm{old}}(X_0,Y_0)=N_0=u_0v_0^t H D old ( X 0 , Y 0 ) = N 0 = u 0 v 0 t , with v 0 t u 0 = 0 v_0^tu_0=0 v 0 t u 0 = 0 , and provisionally take X = diag ( X 0 , 0 ) X=\operatorname{diag}(X_0,0) X = diag ( X 0 , 0 ) . By Lemma 7.4 , both F ( z ) , G ( z ) F(z),G(z) F ( z ) , G ( z ) are invertible for a generic z z z , simultaneously with every E i E_i E i invertible and all diagonal entries distinct in each passive coordinate. Put
Y = ( Y 0 0 λ v 0 t G ( z ) − 1 0 ) , λ ≠ 0. (86) Y=\begin{pmatrix}Y_0&0\\ \lambda v_0^tG(z)^{-1}&0\end{pmatrix},\qquad\lambda\ne0. \tag*{(86)} Y = ( Y 0 λ v 0 t G ( z ) − 1 0 0 ) , λ = 0. (86)
The complete raw value, with no discarded cross terms, is
N 1 = ( u 0 v 0 t 0 λ v 0 t 0 ) = ( u 0 λ ) ( v 0 t , 0 ) , rank N 1 = 1 , N 1 2 = 0. (87) N_1=\begin{pmatrix}u_0v_0^t&0\\ \lambda v_0^t&0\end{pmatrix}
=\begin{pmatrix}u_0\\\lambda\end{pmatrix}(v_0^t,0),\qquad\operatorname{rank}N_1=1,\qquad N_1^2=0. \tag*{(87)} N 1 = ( u 0 v 0 t λ v 0 t 0 0 ) = ( u 0 λ ) ( v 0 t , 0 ) , rank N 1 = 1 , N 1 2 = 0. (87)
The old saturated controls produce the old s l h \mathfrak{sl}_h sl h block. Any extra cross components they create are corrected with the two invertible Y Y Y rectangles, without changing that old block. These rectangles themselves supply the two full cross blocks. A genuine orbit direction Z = ( 0 e 0 0 0 ) Z=\begin{pmatrix}0&e_0\\0&0\end{pmatrix} Z = ( 0 0 e 0 0 ) has
[ Z , N 1 ] = ( λ e 0 v 0 t − N 0 e 0 0 − λ v 0 t e 0 ) . [Z,N_1]=\begin{pmatrix}\lambda e_0v_0^t&-N_0e_0\\0&-\lambda v_0^te_0\end{pmatrix}. [ Z , N 1 ] = ( λ e 0 v 0 t 0 − N 0 e 0 − λ v 0 t e 0 ) .
Choosing v 0 t e 0 ≠ 0 v_0^te_0\ne0 v 0 t e 0 = 0 gives the last trace-balanced diagonal direction. The saturated derivative is therefore onto s l h + 1 \mathfrak{sl}_{h+1} sl h + 1 . These controls can be taken in the old raw variables, the new Y Y Y rectangles and the auxiliary orbit variables. None changes the new raw cross blocks of X X X . Prescribe an arbitrary column a a a and row b b b for those two cross variations. Their output can be cancelled by the preceding controls, producing a tangent of the exact saturated fiber Γ D = N 1 \Gamma_D=N_1 Γ D = N 1 with these prescribed raw X X X components.
That fiber is smooth at the provisional point. Lift the tangent to a formal arc and keep raw X X X hollow. The new diagonal raw entry is identically zero, including for the empty-subset guard. With A S = K S ( X 0 ) A_S=K_S(X_0) A S = K S ( X 0 ) and E S = ∏ i ∈ S ( D i o l d − z i I h ) E_S=\prod_{i\in S}(D_i^{\mathrm{old}}-z_iI_h) E S = ∏ i ∈ S ( D i old − z i I h ) , the Schur complement gives
det K S ( X ( t ) ) = ( − 1 ) ∣ S ∣ + 1 t 2 det ( A S ) b E S A S − 1 E S a + O ( t 3 ) . (88) \det K_S(X(t))=(-1)^{|S|+1}t^2\det(A_S)\,bE_SA_S^{-1}E_Sa+O(t^3). \tag*{(88)} det K S ( X ( t )) = ( − 1 ) ∣ S ∣ + 1 t 2 det ( A S ) b E S A S − 1 E S a + O ( t 3 ) . (88)
The coefficient is a nonzero bilinear form in ( a , b ) (a,b) ( a , b ) , since E S , A S E_S,A_S E S , A S are invertible. Fix any a ≠ 0 a\ne0 a = 0 and choose b b b outside the finitely many annihilating hyperplanes. All coefficients are then nonzero. Unknown second-order corrections cannot cancel them: the upper-left old block begins at A S A_S A S , both cross blocks begin in order one, and the new scalar diagonal is identically zero.
The smooth local fiber ring is a regular local domain. The arc shows that its product of guards is nonzero. Multiply it by a surjectivity minor and any raw function nonzero at the provisional point; those latter functions are units locally. A finite-type localization of the component through the point is nonempty and has an actual point over the algebraically closed field. This is not an assertion that a chosen formal arc algebraizes. Discarding the auxiliary conjugator leaves a raw value conjugate to N 1 N_1 N 1 , so rank one and square zero persist, while the raw guards and test have been retained. In contrast to the size-four restoration, this argument fixes the saturated value, not necessarily the raw value. □
Lemma 7.12 (Tensor induction and fixed-diagonal descent). Guarded hollow tensor spanning in size four at generic independent diagonal parameters implies the same assertion in every n ≥ 4 n\ge4 n ≥ 4 , on one nonempty open of diagonal tuples independent of the test.
Proof. Work first over an algebraic closure of the field of all independent diagonal entries. On an old h = n − 1 h=n-1 h = n − 1 vertex set choose finitely many guarded seed tensors spanning V h ⊗ V h V_h\otimes V_h V h ⊗ V h over the algebraic closure of the old diagonal function field. The new d d d entries z i z_i z i remain algebraically independent over that field and over the finitely many algebraic coordinates of these seeds. Hence the two nonzero determinant polynomials from Lemma 7.4 stay nonzero, and Lemma 7.11 applies to each seed. The spanning property is preserved by scalar extension.
Let T T T vanish on all guarded good pairs in the new size. It must vanish at each provisional input: otherwise exact-fiber guard restoration retains a nonzero value of T T T . At (86) its value is
T h ( X 0 , Y 0 ) + λ T ( diag ( X 0 , 0 ) , ( 0 0 t v 0 G ( z ) − 1 0 ) ) . T_h(X_0,Y_0)+\lambda T\left(\operatorname{diag}(X_0,0),\begin{pmatrix}0&0\\ t v_0G(z)^{-1}&0\end{pmatrix}\right). T h ( X 0 , Y 0 ) + λ T ( diag ( X 0 , 0 ) , ( 0 t v 0 G ( z ) − 1 0 0 ) ) .
It vanishes for every nonzero λ \lambda λ , so its constant term vanishes. The old spanning collection gives T h = 0 T_h=0 T h = 0 . This works on every ( n − 1 ) (n-1) ( n − 1 ) -vertex subset. For n ≥ 5 n\ge5 n ≥ 5 , any two hollow matrix units use at most four vertices and fit in such a subset. Every coefficient of T T T is therefore zero, closing the induction from the guarded size-four base.
To obtain the claimed numerical open, choose finitely many generic seed tensors forming a basis and put their coordinates into one finite-type incidence scheme. Its conditions consist of the raw rank-one square-zero equations, a nonzero raw entry for each value, the chosen saturated surjectivity minors, the tensor-basis determinant, and all subset guards. The projection to the independent diagonal tuples is dominant, because the construction has a point over the algebraic closure of their function field. Its constructible image contains a nonempty open. Intersect with the coordinatewise regular-diagonal open. Every nonempty finite-type fiber over a K K K -point has a K K K -point, since K K K is algebraically closed. Thus every D D D in this one open supports a spanning collection simultaneously. The diagonal tuple is not reselected separately for different bilinear forms or tensor coordinates. □
Proof of Theorem 7.2 . Lemma 7.3 handles size three. If Δ ≠ 0 \Delta\ne0 Δ = 0 , Lemma 7.5 gives all sizes, including the guards. If Δ = 0 \Delta=0 Δ = 0 , both symbols are present. The full four-vertex construction in Lemma 7.10 gives the guarded base, and Lemma 7.12 gives every larger size and the one common diagonal open. These cases exhaust every nonzero symbol pair satisfying the zero-endpoint identities.
It remains to pass from hollow to full bilinear tests. Arbitrary independent diagonal parts can be added to X , Y X,Y X , Y without changing H D H_D H D , by the nonempty proper subset conditions in (67) . The hollow differential and its actual simultaneous-conjugation controls persist; the added diagonal parts are conjugated along with the other original inputs. Suppose a bilinear form on M n × M n M_n \times M_n M n × M n vanishes at every such enriched seed. Expanding in the two independent added diagonal matrices first kills its diagonal-by-diagonal part. Its two mixed parts vanish on the projections of the hollow seed set. Each projection spans V n V_n V n : otherwise a nonzero linear functional annihilating that projection, tensored with any nonzero functional on the other factor, would contradict hollow tensor spanning. Thus both mixed parts vanish. The hollow-by-hollow part vanishes by the already established tensor span. The full form is zero, proving the final assertion. □
If one also requires the full enriched input to retain the guards, the nonempty-subset guards are unchanged. The empty-subset guard det X \det X det X may change after a diagonal addition; restrict those additions to the open set where it stays nonzero. This open contains the zero addition at a guarded hollow seed, so the same polynomial-continuation argument applies. The trace transfer below only needs the enriched smooth nilpotent seed, not its guards.
An original-input chart along the commuting-passive locus
The independent passive matrices cannot be replaced by the linear common-D D D coordinates used in Theorem 6.1 . In particular, a nonzero polynomial on the original source need not remain nonzero on the locus of commuting passive tuples. We retain all transverse directions by the following chart. Write D n \mathcal D_n D n for the vector space of diagonal matrices and V n V_n V n for the hollow matrices. As above, d = m − 2 d=m-2 d = m − 2 .
Lemma 7.13 (A full original-input chart). Let D = ( D 1 , … , D d ) ∈ D n d D=(D_1,\ldots,D_d)\in\mathcal D_n^d D = ( D 1 , … , D d ) ∈ D n d , with D 1 D_1 D 1 having pairwise distinct diagonal entries. Take
A ∈ V n , Z i ∈ V n ( 2 ≤ i ≤ d ) , X , Y ∈ M n , A\in V_n,\qquad Z_i\in V_n\quad(2\le i\le d),\qquad X,Y\in M_n, A ∈ V n , Z i ∈ V n ( 2 ≤ i ≤ d ) , X , Y ∈ M n , and restrict to the open set where g = I n + A g=I_n+A g = I n + A is invertible. The map
Ψ ( D , A , X , Y , Z ) = ( g D 1 g − 1 , g ( D 2 + Z 2 ) g − 1 , … , g ( D d + Z d ) g − 1 , g X g − 1 , g Y g − 1 ) (89) \Psi(D,A,X,Y,Z)=\left(gD_1g^{-1},g(D_2+Z_2)g^{-1},\ldots,g(D_d+Z_d)g^{-1},gXg^{-1},gYg^{-1}\right) \tag*{(89)} Ψ ( D , A , X , Y , Z ) = ( g D 1 g − 1 , g ( D 2 + Z 2 ) g − 1 , … , g ( D d + Z d ) g − 1 , g X g − 1 , g Y g − 1 ) (89) puts these entries in their specified original positions. Its source has dimension m n 2 mn^2 m n 2 , and Ψ \Psi Ψ is étale at every point with A = 0 A=0 A = 0 and Z = 0 Z=0 Z = 0 . In particular, it is dominant onto M n m M_n^m M n m .
The subspace S = { Z = 0 } S=\{Z=0\} S = { Z = 0 } gives a local étale chart on the simultaneously conjugated commuting-passive locus with regular semisimple first passive input. Its dimension and codimension are
dim S = 3 n 2 + ( d − 1 ) n , codim S = ( d − 1 ) ( n 2 − n ) . \dim S=3n^2+(d-1)n,\qquad\operatorname{codim}S=(d-1)(n^2-n). dim S = 3 n 2 + ( d − 1 ) n , codim S = ( d − 1 ) ( n 2 − n ) .
If d Γ D d\Gamma_D d Γ D is onto s l n \mathfrak{sl}_n sl n at ( X , Y , I n ) (X,Y,I_n) ( X , Y , I n ) , the restriction of d ( f ∘ Ψ ) d(f\circ\Psi) d ( f ∘ Ψ ) to T ( D , 0 , X , Y , 0 ) S T_{(D,0,X,Y,0)}S T ( D , 0 , X , Y , 0 ) S is also onto s l n \mathfrak{sl}_n sl n .
Proof. The number of coordinates in the source of (89) is
d n + ( n 2 − n ) + ( d − 1 ) ( n 2 − n ) + 2 n 2 = ( d + 2 ) n 2 = m n 2 . dn+(n^2-n)+(d-1)(n^2-n)+2n^2=(d+2)n^2=mn^2. d n + ( n 2 − n ) + ( d − 1 ) ( n 2 − n ) + 2 n 2 = ( d + 2 ) n 2 = m n 2 .
At a point ( D , 0 , X , Y , 0 ) (D,0,X,Y,0) ( D , 0 , X , Y , 0 ) its derivative is
δ B 1 = δ D 1 + [ δ A , D 1 ] , \delta B_1=\delta D_1+[\delta A,D_1], δ B 1 = δ D 1 + [ δ A , D 1 ] ,
δ B i = δ D i + δ Z i + [ δ A , D i ] ( 2 ≤ i ≤ d ) , (90) \delta B_i=\delta D_i+\delta Z_i+[\delta A,D_i]\quad(2\le i\le d), \tag*{(90)} δ B i = δ D i + δ Z i + [ δ A , D i ] ( 2 ≤ i ≤ d ) , (90)
\delta B_X=\delta X+[\delta A,X],\qquad \delta B_Y=\delta Y+[\delta A,Y].
Given an arbitrary tangent vector $(\delta B_1,\ldots,\delta B_d,\delta B_X,\delta B_Y)$ to the original source, the diagonal of $\delta B_1$ determines $\delta D_1$. For $a\ne b$,
[\delta A,D_1]_{ab}=((D_1)_{bb}-(D_1)_{aa})\delta A_{ab}.
The nonzero eigenvalue differences therefore determine the hollow matrix δ A \delta A δ A uniquely. For each i ≥ 2 i\ge2 i ≥ 2 , subtract [ δ A , D i ] [\delta A,D_i] [ δ A , D i ] from δ B i \delta B_i δ B i and take its diagonal and hollow parts; these determine δ D i \delta D_i δ D i and δ Z i \delta Z_i δ Z i uniquely. Finally, the last line of (90) determines the unrestricted δ X , δ Y \delta X,\delta Y δ X , δ Y . Thus the derivative is an isomorphism between smooth spaces of equal dimension, proving étaleness at the stated point.
The source is a nonempty open subset of an affine space, hence is irreducible. The étale locus is open and contains the stated points, and an étale map is open. Consequently the image of Ψ \Psi Ψ contains a nonempty open subset of the irreducible original source. This proves dominance, and in particular injectivity of pullback on its ring of polynomial functions.
For completeness, the commuting-passive locus used here is smooth. A regular semisimple matrix B 1 B_1 B 1 has centralizer K [ B 1 ] K[B_1] K [ B 1 ] , of dimension n n n . Every matrix commuting with it has a unique expression
B i = ∑ r = 0 n − 1 b i r B 1 r . B_i=\sum_{r=0}^{n-1}b_{ir}B_1^r. B i = r = 0 ∑ n − 1 b i r B 1 r .
These expressions identify its centralizer bundle with the trivial rank-n n n bundle over the regular semisimple locus: the displayed powers are linearly independent in every fiber, and the inverse coefficients are regular locally, by an invertible matrix-entry minor. Choosing B 2 , … , B d B_2,\ldots,B_d B 2 , … , B d in this bundle already makes them commute with one another. The passive locus thus has dimension n 2 + ( d − 1 ) n n^2+(d-1)n n 2 + ( d − 1 ) n ; the two full active matrices add 2 n 2 2n^2 2 n 2 dimensions. The image of S S S lies in this locus. Its tangent map is injective by (90) , and its dimension equals that of the locus. This proves the asserted local chart statement and the codimension formula.
It remains to compare the allowed conjugation directions. By the actual restriction formula (68) , on S S S one has
( f ∘ Ψ ) ( D , A , X , Y , 0 ) = g H D ( X , Y ) g − 1 . (f\circ\Psi)(D,A,X,Y,0)=gH_D(X,Y)g^{-1}. ( f ∘ Ψ ) ( D , A , X , Y , 0 ) = g H D ( X , Y ) g − 1 .
The coordinate A A A provides every hollow infinitesimal conjugator. If B B B is diagonal, then [ B , D i ] = 0 [B,D_i]=0 [ B , D i ] = 0 for every i i i , and simultaneous conjugation by I n + t B I_n+tB I n + tB to first order has exactly the same input tangent as
δ X = [ B , X ] , δ Y = [ B , Y ] , δ A = 0 , δ D i = 0 , δ Z i = 0. \delta X=[B,X],\qquad\delta Y=[B,Y],\qquad\delta A=0,\qquad\delta D_i=0,\qquad\delta Z_i=0. δ X = [ B , X ] , δ Y = [ B , Y ] , δ A = 0 , δ D i = 0 , δ Z i = 0.
Both active variations are allowed because X , Y X,Y X , Y are full matrices. Equivariance gives the output derivative [ B , H D ( X , Y ) ] [B,H_D(X,Y)] [ B , H D ( X , Y )] . Decomposing an arbitrary infinitesimal conjugator into its hollow and diagonal parts proves that every direction supplied by d Γ D d\Gamma_D d Γ D is supplied in T S TS T S . No diagonal-torus direction has been lost by taking A A A hollow. □
The first actual trace term on the same exact fiber
The next argument uses the complete matrix-entry trace polynomial at the fixed size n n n . It does not substitute a free cyclic class for that polynomial, and does not require a trace to appear at a prescribed small order.
Proposition 7.14 (Trace transfer in the independent chart). Suppose the complete selected restriction of the original ordinary multilinear polynomial f f f is (68) , and its nonzero symbol pair satisfies the zero-endpoint hypotheses of Theorem 7.2. Fix n ≥ 3 n\ge3 n ≥ 3 and put h = tr f h=\operatorname{tr}f h = tr f on M n m M_n^m M n m . If h = 0 h=0 h = 0 , the original map into s l n \mathfrak{sl}_n sl n has a smooth input over a nonzero rank-one square-zero matrix, with local fiber dimension m n 2 − n 2 + 1 mn^2-n^2+1 m n 2 − n 2 + 1 , and its actual image is s l n \mathfrak{sl}_n sl n .
If h ≠ 0 h\ne0 h = 0 , the original map into M n M_n M n has a flat input over such a matrix, with local complete-intersection fiber of dimension m n 2 − n 2 mn^2-n^2 m n 2 − n 2 , and its actual image is M n M_n M n . More precisely, the construction has a first nonzero multilinear trace order 1 ≤ v ≤ d − 1 1\le v\le d-1 1 ≤ v ≤ d − 1 . Its differential has rank n 2 n^2 n 2 when v = 1 v=1 v = 1 and rank exactly n 2 − 1 n^2-1 n 2 − 1 when v ≥ 2 v\ge2 v ≥ 2 . Thus in the latter case the constructed point is flat but not smooth.
Proof. Let Ω n ⊂ D n d \Omega_n\subset D_n^d Ω n ⊂ D n d be the single nonempty open set supplied by Theorem 7.2; it already requires regular diagonal passive matrices. Put
π ( B ) = B − tr B n I n , F = f ∘ Ψ , G = π ∘ F . \pi(B)=B-\frac{\operatorname{tr}B}{n}I_n,\qquad F=f\circ\Psi,\qquad G=\pi\circ F. π ( B ) = B − n tr B I n , F = f ∘ Ψ , G = π ∘ F .
Trace invariance cancels g g g from the pulled-back trace:
( h ∘ Ψ ) ( D , A , X , Y , Z ) = h ~ ( D , X , Y , Z ) = tr f ( D 1 , D 2 + Z 2 , … , D d + Z d , X , Y ) . (91) (h\circ\Psi)(D,A,X,Y,Z)=\widetilde h(D,X,Y,Z)=\operatorname{tr}f(D_1,D_2+Z_2,\ldots,D_d+Z_d,X,Y). \tag*{(91)} ( h ∘ Ψ ) ( D , A , X , Y , Z ) = h ( D , X , Y , Z ) = tr f ( D 1 , D 2 + Z 2 , … , D d + Z d , X , Y ) . (91)
with the same original slot order as in (89) . In particular, this is a polynomial in D , X , Y , Z D, X, Y, Z D , X , Y , Z and is independent of A A A . The zero endpoints in (68) make H D ( X , Y ) H_D(X,Y) H D ( X , Y ) hollow for all full X , Y X,Y X , Y . Consequently
h ~ ( D , X , Y , 0 ) = 0 , F ∣ S = g H D ( X , Y ) g − 1 . \widetilde{h}(D,X,Y,0)=0,\qquad F|_S=gH_D(X,Y)g^{-1}. h ( D , X , Y , 0 ) = 0 , F ∣ S = g H D ( X , Y ) g − 1 .
If h = 0 h=0 h = 0 on the original source, choose any full seed from Theorem 7.2 . For example, its assertion applied to any nonzero bilinear form ensures that the seed set is nonempty. At the corresponding point p = ( D , 0 , X , Y , 0 ) p=(D,0,X,Y,0) p = ( D , 0 , X , Y , 0 ) , the value N = F ( p ) N=F(p) N = F ( p ) is nonzero rank-one square-zero. Lemma 7.13 makes d ( F ∣ S ) p d(F|_S)_p d ( F ∣ S ) p onto s l n \mathfrak{sl}_n sl n . Since Ψ \Psi Ψ is étale at p p p , the original differential is onto s l n \mathfrak{sl}_n sl n as well. The original map is therefore smooth there, and its fiber has dimension m n 2 − ( n 2 − 1 ) mn^2-(n^2-1) m n 2 − ( n 2 − 1 ) . Smoothness gives an open image neighborhood of N N N ; Theorem 2.1 gives the asserted actual image.
Now assume that the actual polynomial h h h is nonzero. Dominance of Ψ \Psi Ψ , proved in Lemma 7.13 , implies h ~ ≠ 0 \widetilde{h}\ne0 h = 0 . Expand by total degree in the independent hollow coordinates Z 2 , … , Z d Z_2,\ldots,Z_d Z 2 , … , Z d :
h ~ ( D , X , Y , Z ) = ∑ j = v d − 1 H j ( D , X , Y , Z ) , H v ≠ 0 , 1 ≤ v ≤ d − 1. (92) \widetilde{h}(D,X,Y,Z)=\sum_{j=v}^{d-1}H_j(D,X,Y,Z),\qquad H_v\ne0,\qquad1\le v\le d-1. \tag*{(92)} h ( D , X , Y , Z ) = j = v ∑ d − 1 H j ( D , X , Y , Z ) , H v = 0 , 1 ≤ v ≤ d − 1. (92)
Every H j H_j H j is homogeneous of degree j j j in the Z Z Z coordinates and bilinear in the full active matrices X , Y X,Y X , Y . Indeed, each original passive position other than the first contributes either its D i D_i D i or its Z i Z_i Z i , at most once, and each active position occurs exactly once. The term of degree zero vanishes by the preceding hollow restriction. The bound is d − 1 = m − 3 d-1=m-3 d − 1 = m − 3 because there are precisely that many transverse passive positions. All coefficients below order v v v vanish as polynomials in actual size-n n n entries. This includes every fixed-size trace identity and every cancellation involving higher-ideal terms of f f f .
There are D ∗ ∈ Ω n D^*\in\Omega_n D ∗ ∈ Ω n and fixed hollow matrices Z 0 = ( Z 2 0 , … , Z d 0 ) Z^0=(Z^0_2,\ldots,Z^0_d) Z 0 = ( Z 2 0 , … , Z d 0 ) such that
T ( X , Y ) = H v ( D ∗ , X , Y , Z 0 ) (93) T(X,Y)=H_v(D^*,X,Y,Z^0) \tag*{(93)} T ( X , Y ) = H v ( D ∗ , X , Y , Z 0 ) (93)
is a nonzero bilinear form on M n × M n M_n\times M_n M n × M n . Here is a coefficient-level justification of this simultaneous choice. Expand H v H_v H v in the matrix-entry variables of X , Y , Z X,Y,Z X , Y , Z . At least one coefficient is a nonzero polynomial in the independent diagonal coordinates of D D D . Its nonvanishing open set meets the nonempty open Ω n \Omega_n Ω n in the irreducible affine space D d D^d D d . At such a D ∗ D^* D ∗ the polynomial in X , Y , Z X,Y,Z X , Y , Z remains nonzero. Some coefficient of an X X X -entry times a Y Y Y -entry is then a nonzero polynomial in Z Z Z . Since K K K is infinite, choose Z 0 Z^0 Z 0 where this coefficient does not vanish. This proves the assertion without a density claim for commuting tuples in the original source.
Apply Theorem 7.2 to this T T T at this same D ∗ D^* D ∗ . It gives full original matrices X 0 , Y 0 X_0,Y_0 X 0 , Y 0 for which
T ( X 0 , Y 0 ) ≠ 0 , N = H D ∗ ( X 0 , Y 0 ) , rank N = 1 , N 2 = 0. T(X_0,Y_0)\ne0,\qquad N=H_{D^*}(X_0,Y_0),\qquad\operatorname{rank}N=1,\qquad N^2=0. T ( X 0 , Y 0 ) = 0 , N = H D ∗ ( X 0 , Y 0 ) , rank N = 1 , N 2 = 0.
and the saturated differential is onto s l n \mathfrak{sl}_n sl n . Set p = ( D ∗ , 0 , X 0 , Y 0 , 0 ) p=(D^*,0,X_0,Y_0,0) p = ( D ∗ , 0 , X 0 , Y 0 , 0 ) in the chart and a = Ψ ( p ) a=\Psi(p) a = Ψ ( p ) in the original source. The two properties required for the trace argument now hold at one input:
G ( p ) = N , G(p)=N,\qquad G ( p ) = N ,
d ( G ∣ S ) p : T p S ⟶ s l n is onto , H v ( D ∗ , X 0 , Y 0 , Z ) ≠ 0. d(G|_S)_p:T_pS\longrightarrow\mathfrak{sl}_n\ \text{is onto},\qquad H_v(D^*,X_0,Y_0,Z)\ne0. d ( G ∣ S ) p : T p S ⟶ sl n is onto , H v ( D ∗ , X 0 , Y 0 , Z ) = 0.
The second assertion follows by evaluation at Z 0 Z^0 Z 0 ; the first is Lemma 7.13 . Nothing here adds values from different input tuples.
We next solve the exact traceless equations without changing the normal coordinates. Write q = m n 2 q=mn^2 q = m n 2 and r = n 2 − 1 r=n^2-1 r = n 2 − 1 . Choose an r r r -dimensional linear subspace L ⊂ T p S L\subset T_pS L ⊂ T p S on which d G p dG_p d G p is an isomorphism onto s l n \mathfrak{sl}_n sl n . In the affine coordinates of the chart centered at p p p , choose coordinates ℓ \ell ℓ along L L L and complementary coordinates w w w within S S S , leaving every coordinate of Z Z Z untouched. Thus
( ℓ , w , Z ) are local coordinates , # ℓ = r , # ( w , Z ) = q − r , S = { Z = 0 } . (\ell,w,Z)\ \text{are local coordinates},\qquad\#\ell=r,\qquad\#(w,Z)=q-r,\qquad S=\{Z=0\}. ( ℓ , w , Z ) are local coordinates , # ℓ = r , # ( w , Z ) = q − r , S = { Z = 0 } .
Choose any linear coordinates on s l n \mathfrak{sl}_n sl n . The Jacobian of the r r r functions G − N G-N G − N with respect to ℓ \ell ℓ is invertible at p p p . The formal implicit function theorem therefore gives a unique formal solution
ℓ = ϕ ( w , Z ) , ϕ ( 0 , 0 ) = 0 , G ( ϕ ( w , Z ) , w , Z ) = N . (94) \ell=\phi(w,Z),\qquad\phi(0,0)=0,\qquad G(\phi(w,Z),w,Z)=N. \tag*{(94)} ℓ = ϕ ( w , Z ) , ϕ ( 0 , 0 ) = 0 , G ( ϕ ( w , Z ) , w , Z ) = N . (94)
In particular, for the exact partial fiber Y = G − 1 ( N ) \mathcal{Y}=G^{-1}(N) Y = G − 1 ( N ) ,
O ^ Y , p ≃ K [ [ w , Z ] ] . (95) \widehat{\mathcal{O}}_{\mathcal{Y},p}\simeq K[[w,Z]]. \tag*{(95)} O Y , p ≃ K [[ w , Z ]] . (95)
The correction ϕ \phi ϕ may have a linear term. That causes no problem: its entries have zero constant term, and no Z Z Z coordinate is replaced or eliminated.
We verify the initial trace term after this correction explicitly. Let m \mathfrak{m} m be the maximal ideal in the completed chart at p p p . Equation (92) gives
h ~ ≡ H v ( D ∗ , X 0 , Y 0 , Z ) ( m o d m v + 1 ) , h ~ ∈ m v . (96) \widetilde{h}\equiv H_v(D^{*},X_0,Y_0,Z)\pmod{\mathfrak{m}^{v+1}},\qquad\widetilde{h}\in\mathfrak{m}^{v}. \tag*{(96)} h ≡ H v ( D ∗ , X 0 , Y 0 , Z ) ( mod m v + 1 ) , h ∈ m v . (96)
To prove the congruence, every monomial in H v H_v H v already has Z Z Z -degree v v v . Replacing a coefficient variable among D , X , Y D,X,Y D , X , Y by its value at p p p changes that coefficient by an element of m \mathfrak{m} m , raising the total order by at least one. The terms H j H_j H j with j > v j>v j > v have total order at least v + 1 v+1 v + 1 before any such replacement. The polynomial is independent of A A A , so that coordinate introduces no further term. Upon substituting ℓ = ϕ ( w , Z ) \ell=\phi(w,Z) ℓ = ϕ ( w , Z ) , every centered coefficient variable remains in ( w , Z ) (w,Z) ( w , Z ) and the normal coordinates stay exactly Z Z Z . Hence (96) becomes
h ~ ∣ Y ≡ H v ( D ∗ , X 0 , Y 0 , Z ) ( m o d ( w , Z ) v + 1 ) in K [ [ w , Z ] ] . (97) \left.\widetilde{h}\right|_{\mathcal{Y}}\equiv H_v(D^{*},X_0,Y_0,Z)\pmod{(w,Z)^{v+1}}\quad\text{in }K[[w,Z]]. \tag*{(97)} h Y ≡ H v ( D ∗ , X 0 , Y 0 , Z ) ( mod ( w , Z ) v + 1 ) in K [[ w , Z ]] . (97)
Its right-hand side is nonzero. Thus the first surviving normal trace term is also the full lowest total Taylor term on the exact partial fiber; an implicit correction cannot cancel it.
The surjective differential of G G G makes R = O Y , p R=\mathcal{O}_{\mathcal{Y},p} R = O Y , p a regular local ring of dimension q − r = m n 2 − n 2 + 1 q-r=mn^2-n^2+1 q − r = m n 2 − n 2 + 1 . In particular, R R R is a domain. The completion map is injective (equivalently here, completion is faithfully flat and the maximal-ideal filtration is separated). Equation (97) shows that h ~ ∣ Y \left.\widetilde{h}\right|_{\mathcal{Y}} h Y is a nonzero element of R R R . It lies in the maximal ideal because F ( p ) = N F(p)=N F ( p ) = N has trace zero, and, since R R R is a domain, it is a non-zero-divisor. The full fiber over N N N is obtained by adding this one trace equation to G = N G=N G = N , so
dim O F − 1 ( N ) , p = ( q − r ) − 1 = m n 2 − n 2 . \dim\mathcal{O}_{F^{-1}(N),p}=(q-r)-1=mn^2-n^2. dim O F − 1 ( N ) , p = ( q − r ) − 1 = m n 2 − n 2 .
Moreover, the r r r traceless equations form a regular sequence in the regular local ring of the chart: their independent linear parts can be completed to a regular system of parameters. Appending the non-zero-divisor h ~ \widetilde{h} h gives a regular sequence of length n 2 n^2 n 2 . The full fiber is therefore a local complete intersection at p p p .
The target M n M_n M n and the chart source are regular, and the latter is Cohen–Macaulay. The displayed fiber dimension is the difference of their dimensions, so miracle flatness proves that F F F is flat at p p p . Since Ψ \Psi Ψ is étale at p p p , the original fiber at a = Ψ ( p ) a=\Psi(p) a = Ψ ( p ) has the same local dimension and is a local complete intersection. Flatness descends through this local faithfully flat change of source; equivalently, miracle flatness applies directly to the original regular local source of dimension m n 2 mn^2 m n 2 and its fiber of dimension m n 2 − n 2 mn^2-n^2 m n 2 − n 2 . Thus the asserted point belongs to the original map f f f , rather than just to a restriction or a quotient representative.
Flatness for morphisms of finite presentation is open on the source, and a flat morphism locally of finite presentation is open. It follows that the actual image contains an open neighborhood of N N N in M n M_n M n . Indeed, each K K K -point in this open set has a nonempty finite-type fiber, which has a K K K -point because K K K is algebraically closed. The degeneration in Theorem 2.1 now yields every nonscalar target. The scalar part of that theorem applies to the original ordinary multilinear polynomial f f f ; we spell it out to keep its scope explicit.
Choose Weyl matrices U , V ∈ M n U,V\in M_n U , V ∈ M n with U V = ζ V U UV=\zeta VU U V = ζ V U and U n = V n = I n U^n=V^n=I_n U n = V n = I n , where ζ \zeta ζ is a primitive n n n th root of unity. The matrices U a V b U^aV^b U a V b , 0 ≤ a , b < n 0\leq a,b<n 0 ≤ a , b < n , form a basis, and their traces are zero except for U 0 V 0 = I n U^0V^0=I_n U 0 V 0 = I n . Since f ≠ 0 f\ne0 f = 0 , some original input tuple has nonzero output trace. Expanding that tuple multilinearly in the Weyl basis shows that a tuple of basis matrices has nonzero output trace. Every word of f f f uses exactly the same original inputs once, so at this basis tuple every word is a scalar multiple of the same Weyl basis matrix, of degree ∑ i ( a i , b i ) \sum_i(a_i,b_i) ∑ i ( a i , b i ) in ( Z / n Z ) 2 (\mathbb{Z}/n\mathbb{Z})^2 ( Z / n Z ) 2 . Its nonzero trace forces that degree to be zero. The output is therefore a nonzero scalar matrix. Scaling one original input gives every scalar matrix. Together with the open-image argument this proves Val n ( f ) = M n \operatorname{Val}_n(f)=M_n Val n ( f ) = M n , as a set of single evaluations.
Finally, if v = 1 v=1 v = 1 , (97) is a nonzero linear form on the tangent space of Y \mathcal{Y} Y . Thus d h ~ p d\widetilde{h}_p d h p is nonzero on ker d G p \ker dG_p ker d G p , and the combined map ( G , h ~ ) (G,\widetilde{h}) ( G , h ) has rank r + 1 = n 2 r+1=n^2 r + 1 = n 2 . This is equivalent to d F p dF_p d F p having full rank. If v ≥ 2 v\geq2 v ≥ 2 , (96) gives d h ~ p = 0 d\widetilde{h}_p=0 d h p = 0 , whereas d G p dG_p d G p still has rank r r r . Hence d F p dF_p d F p has rank exactly n 2 − 1 n^2-1 n 2 − 1 . The étale chart preserves these ranks for d f a df_a d f a . The first case is smooth, and the second is flat but not smooth. □
Completion of the proof of Theorem 1.1 . If some ordered pair of original positions has a nonzero complete common-D D D restriction, Theorem 6.1 gives both the actual-image classification and the required original local fiber. For the remaining case every such complete restriction is zero. Proposition 7.1 supplies a nonzero independent pair, and (70) gives its zero endpoints. Apply Theorem 7.2 and Proposition 7.14 at the specified size n n n . These two cases exhaust proper ordinary J 2 ∖ J 3 J^2\setminus J^3 J 2 ∖ J 3 . Throughout, the test deciding the target is whether the actual polynomial tr f \operatorname{tr} f tr f on this M m n M_m^n M m n is zero. No conclusion about that test is inferred merely from its value on the commuting-passive slice, and its answer is allowed to depend on n n n . □
Higher-ideal corrections and the exact second-layer boundary.
Lemma 7.15 (Vanishing on the whole commuting-passive slice). Let R R R be ordinary multilinear and belong to J r J^r J r . If fewer than r r r original positions are active and all other original inputs commute with one another, then R R R vanishes for arbitrary matrices in the active positions. In particular, every ordinary multilinear R ∈ J 3 R\in J^3 R ∈ J 3 vanishes on the entire two-active, commuting-passive source in every matrix size.
Proof. Write R R R as a sum of products of r r r commutator-ideal factors, allowing arbitrary word contexts, and take its component of degree one in each original variable. In every surviving summand the variable sets of the factors and contexts are disjoint. With fewer than r r r active positions, at least one of the r r r ideal factors uses only passive inputs. Those matrices lie in a commutative subalgebra, on which the commutator ideal evaluates to zero. That factor, and therefore the whole summand including its surrounding words, vanishes.
One can also see that no cancellation or choice of presentation is being assumed by multiplying the active inputs by independent central parameters t 1 , … , t k t_1,\ldots,t_k t 1 , … , t k , where k < r k<r k < r . Modulo the ideal ( t 1 , … , t k ) (t_1,\ldots,t_k) ( t 1 , … , t k ) the evaluation takes values in a commutative algebra, so it sends J r J^r J r into ( t 1 , … , t k ) r (t_1,\ldots,t_k)^r ( t 1 , … , t k ) r . Ordinary multilinearity makes the evaluated R R R equal to t 1 ⋯ t k t_1\cdots t_k t 1 ⋯ t k times its unscaled value, of total parameter degree k < r k<r k < r . Its membership in that ideal forces the unscaled value to be zero. The identity holds on the entire slice and hence also along its simultaneous conjugates. □
Corollary 7.16 (Same-degree corrections with no lost trace terms). Let F F F be proper ordinary multilinear of degree m m m with F ∈ J 2 ∖ J 3 F\in J^2\setminus J^3 F ∈ J 2 ∖ J 3 . For every same-degree proper ordinary multilinear R ∈ J 3 R\in J^3 R ∈ J 3 , the corrected polynomial F + R F+R F + R has the conclusions of Theorem 1.1 in each size n ≥ 3 n\geq3 n ≥ 3 . Its complete independent symbol pair is unchanged for every selected active pair. Its target and its compatible nilpotent input are determined using the actual corrected polynomial.
Proof. The class of F + R F+R F + R in J 2 / J 3 J^2/J^3 J 2 / J 3 is the nonzero class of F F F . Lemma 7.15 shows that the entire selected commuting-passive restriction, not just one triangular value, is unchanged. Thus its complete independent symbols are unchanged. Apply Theorem 1.1 .
The restriction identity is the only use made of the vanishing of R R R on this slice. Its transverse derivatives need not vanish. Every one of them and every higher transverse trace coefficient is retained in (91) and (92) for f = F + R f=F+R f = F + R . The first surviving order and the bilinear form (93) may therefore change, and the seed is reselected for that form. The assertion does not say that a previously chosen triangular witness stays flat for every correction. Cross-partition terms outside J 3 J^3 J 3 are likewise not removed: their contributions are already in the full coefficient arrays of (67) . □
Remark 7.17 (The alternating quartic lies in the independent branch). Use the standard convention
s 4 ( x 1 , x 2 , x 3 , x 4 ) = ∑ σ ∈ S 4 sgn ( σ ) x σ ( 1 ) x σ ( 2 ) x σ ( 3 ) x σ ( 4 ) . s_4(x_1,x_2,x_3,x_4)=\sum_{\sigma\in S_4}\operatorname{sgn}(\sigma)x_{\sigma(1)}x_{\sigma(2)}x_{\sigma(3)}x_{\sigma(4)}. s 4 ( x 1 , x 2 , x 3 , x 4 ) = σ ∈ S 4 ∑ sgn ( σ ) x σ ( 1 ) x σ ( 2 ) x σ ( 3 ) x σ ( 4 ) .
Its commutator expansion is
s 4 = [ x 1 , x 2 ] [ x 3 , x 4 ] + [ x 3 , x 4 ] [ x 1 , x 2 ] − [ x 1 , x 3 ] [ x 2 , x 4 ] − [ x 2 , x 4 ] [ x 1 , x 3 ] + [ x 1 , x 4 ] [ x 2 , x 3 ] + [ x 2 , x 3 ] [ x 1 , x 4 ] . s_{4} = [x_{1},x_{2}][x_{3},x_{4}] + [x_{3},x_{4}][x_{1},x_{2}]
- [x_{1},x_{3}][x_{2},x_{4}] - [x_{2},x_{4}][x_{1},x_{3}]
+ [x_{1},x_{4}][x_{2},x_{3}] + [x_{2},x_{3}][x_{1},x_{4}]. s 4 = [ x 1 , x 2 ] [ x 3 , x 4 ] + [ x 3 , x 4 ] [ x 1 , x 2 ] − [ x 1 , x 3 ] [ x 2 , x 4 ] − [ x 2 , x 4 ] [ x 1 , x 3 ] + [ x 1 , x 4 ] [ x 2 , x 3 ] + [ x 2 , x 3 ] [ x 1 , x 4 ] .
Set x 1 = D 1 x_{1}=D_{1} x 1 = D 1 , x 2 = D 2 x_{2}=D_{2} x 2 = D 2 , x 3 = X x_{3}=X x 3 = X , x 4 = Y x_{4}=Y x 4 = Y , with D 1 , D 2 D_{1},D_{2} D 1 , D 2 diagonal. The first two products vanish, and the complete symbols in the convention of (68) are exactly
P ( a , b ) = a 2 b 1 − a 1 b 2 , Q ( a , b ) = a 1 b 2 − a 2 b 1 = − P ( a , b ) . (98) P(a,b)=a_{2}b_{1}-a_{1}b_{2}, \qquad Q(a,b)=a_{1}b_{2}-a_{2}b_{1}=-P(a,b). \tag*{(98)} P ( a , b ) = a 2 b 1 − a 1 b 2 , Q ( a , b ) = a 1 b 2 − a 2 b 1 = − P ( a , b ) . (98)
Indeed, the X Y XY X Y -ordered terms contribute − a 1 b 2 + a 2 b 1 -a_{1}b_{2}+a_{2}b_{1} − a 1 b 2 + a 2 b 1 , and the Y X YX Y X -ordered terms contribute its negative. Both common-D D D specializations are zero, both endpoints P ( a , − a ) , Q ( a , − a ) P(a,-a),Q(a,-a) P ( a , − a ) , Q ( a , − a ) are zero, and P P P is not zero. Writing c = − a − b c=-a-b c = − a − b , its triangle norm is
P ( a , b ) P ( b , c ) P ( c , a ) + Q ( a , b ) Q ( b , c ) Q ( c , a ) = 0. P(a,b)P(b,c)P(c,a)+Q(a,b)Q(b,c)Q(c,a)=0. P ( a , b ) P ( b , c ) P ( c , a ) + Q ( a , b ) Q ( b , c ) Q ( c , a ) = 0.
Thus this example uses the size-three zero-row and size-four cycle-kernel branch of Theorem 7.2 ; it is not covered by a nonzero common-D D D restriction. In fact every common-D D D chosen-pair restriction of s 4 s_{4} s 4 vanishes, because two of its original inputs coincide.
The polynomial is proper: inserting I I I in one position makes all its commutator products vanish. The expansion places it in J 2 J^{2} J 2 . Its nonzero independent restriction, together with Lemma 7.15 , proves s 4 ∉ J 3 s_{4}\notin J^{3} s 4 ∈ / J 3 . Cyclically moving the first letter of a four-letter word to the last position preserves its trace and changes the alternating sign by ( − 1 ) 3 = − 1 (-1)^{3}=-1 ( − 1 ) 3 = − 1 . Summing in s 4 s_{4} s 4 gives tr s 4 = − tr s 4 \operatorname{tr}s_{4}=-\operatorname{tr}s_{4} tr s 4 = − tr s 4 , hence tr s 4 = 0 \operatorname{tr}s_{4}=0 tr s 4 = 0 in characteristic zero. Theorem 1.1 consequently gives actual image s l n \mathfrak{sl}_{n} sl n and an original smooth nonzero rank-one square-zero input for every n ≥ 3 n\geq3 n ≥ 3 ; its local fiber dimension is 3 n 2 + 1 3n^{2}+1 3 n 2 + 1 .
For a small exact instance, take
D 1 = diag ( 0 , 1 , 2 ) , D 2 = diag ( 0 , 1 , 4 ) , X = E 23 + E 32 , Y = E 21 + E 31 . D_{1}=\operatorname{diag}(0,1,2), \qquad D_{2}=\operatorname{diag}(0,1,4), \qquad X=E_{23}+E_{32}, \qquad Y=E_{21}+E_{31}. D 1 = diag ( 0 , 1 , 2 ) , D 2 = diag ( 0 , 1 , 4 ) , X = E 23 + E 32 , Y = E 21 + E 31 .
Formula (98) gives the actual value N = − 2 E 21 + 2 E 31 N=-2E_{21}+2E_{31} N = − 2 E 21 + 2 E 31 , which has rank one and square zero. The all-size smoothness assertion above follows from the proved seed and trace arguments, not from extrapolation of this one value or from a numerical rank calculation.
Further questions
The size-two boundary
The image classification on M 2 M_{2} M 2 is due to Kanel-Belov, Malev and Rowen [15 Theorem 2] . The local statement of Theorem 1.1 has a separate size-two boundary. By the Amitsur–Levitzki theorem [4 ] , s 4 s_{4} s 4 is an identity on M 2 M_{2} M 2 , although s 4 ∈ J 2 ∖ J 3 s_{4}\in J^{2}\setminus J^{3} s 4 ∈ J 2 ∖ J 3 . Moreover, with zero endpoints in (68) , every surviving term requires three distinct vertices. Thus the independent-diagonal restriction used in that branch vanishes on M 2 M_{2} M 2 . For noncentral polynomials on M 2 M_{2} M 2 , it remains to determine the scope of the smooth and flat nilpotent-fiber conclusions.
The third commutator layer
The classification in degrees four through six is given in [6 Theorem A] . The higher-arity study in [7 ] includes local-fiber results for the entire six-slot third layer, for classes arising from s 6 s_{6} s 6 with same-degree J 4 J^{4} J 4 corrections in sizes n ≥ 4 n\geq4 n ≥ 4 , and for specified families of higher arity. The general proper third layer J 3 / J 4 J^{3}/J^{4} J 3 / J 4 in higher arity remains open. The fixed-size identity and central cases must be distinguished from the noncentral case. On M 3 M_{3} M 3 , higher-arity third-layer classes can have nonzero scalar image [7 section Central weighted third classes in size three] .
For an ordinary multilinear f ∈ J 3 ∖ J 4 f\in J^{3}\setminus J^{4} f ∈ J 3 ∖ J 4 and n ≥ 4 n\geq4 n ≥ 4 , some restriction with three active original variables and independently chosen diagonal passive inputs is nonzero. Indeed, I ( U T 4 ) = J 4 I(UT_{4})=J^{4} I ( U T 4 ) = J 4 by [3 Theorem 2.1] . In a nonzero evaluation on U T 4 UT_{4} U T 4 , expand each input into its diagonal part and its strictly upper triangular part. Terms with fewer than three strictly upper triangular inputs vanish by Lemma 7.15 . Terms with at least four vanish because the fourth power of the strictly upper triangular ideal of U T 4 UT_{4} U T 4 is zero. A nonzero term therefore has exactly three active inputs, and it embeds into M n M_{n} M n . By the same lemma, every same-degree multilinear correction in J 4 J^{4} J 4 vanishes on each three-active restriction. In size three, the three-active restrictions can all vanish on a nonidentity in J 3 ∖ J 4 J^3 \setminus J^4 J 3 ∖ J 4 . An example in seven variables is
∑ i = 1 5 ( − 1 ) i − 1 s 4 ( x 1 , … , x i ^ , … , x 5 ) [ [ x 6 , x 7 ] , x i ] , \sum_{i=1}^{5}(-1)^{i-1}s_4(x_1,\ldots,\widehat{x_i},\ldots,x_5)[[x_6,x_7],x_i], i = 1 ∑ 5 ( − 1 ) i − 1 s 4 ( x 1 , … , x i , … , x 5 ) [[ x 6 , x 7 ] , x i ] ,
where the hat indicates omission [7 section Higher third symbols and original correction trace fibers] . In this case one needs a construction using a larger set of original input directions.
For a noncentral polynomial f f f in the third layer, write h = tr f h=\operatorname{tr} f h = tr f and g = f − n − 1 h I n g=f-n^{-1}hI_n g = f − n − 1 h I n on the full original source M n m M_n^m M n m . The following question specifies a sufficient extension of the method of this paper.
Problem (Original fibers in the third layer). Let n ≥ 3 n \ge3 n ≥ 3 and let f f f be a proper ordinary multilinear polynomial in J 3 ∖ J 4 J^3 \setminus J^4 J 3 ∖ J 4 with at least one nonscalar value on M n M_n M n . Is there an original input a a a with f ( a ) = N f(a)=N f ( a ) = N , rank N = 1 \operatorname{rank} N=1 rank N = 1 , and N 2 = 0 N^2=0 N 2 = 0 such that
rank ( d g a ) = n 2 − 1 , h ∣ g − 1 ( N ) ≠ 0 in O g − 1 ( N ) , a if h ≠ 0 ? \operatorname{rank}(d g_a)=n^2-1,\qquad h|_{g^{-1}(N)}\ne0\ \text{in}\ \mathcal{O}_{g^{-1}(N),a}\quad\text{if }h\ne0? rank ( d g a ) = n 2 − 1 , h ∣ g − 1 ( N ) = 0 in O g − 1 ( N ) , a if h = 0 ?
For h = 0 h=0 h = 0 , the differential condition gives the smooth traceless fiber. For h ≠ 0 h\ne0 h = 0 , Proposition 2.3 gives the flat full-matrix fiber. Thus the rank condition and the trace condition must hold at the same original input. Nonvanishing on U T 4 UT_4 U T 4 supplies a restriction, and the conditions in the problem concern the local ring of the original fiber.
Suppose h ≠ 0 h\ne0 h = 0 and h h h vanishes on a three-active slice. In an original-input chart, the first nonzero transverse trace coefficient is trilinear in the three active matrices. A sufficient statement for extending Proposition 7.14 is that, for every passive tuple in a nonempty regular-diagonal open set, the active tensors X ⊗ Y ⊗ Z X\otimes Y\otimes Z X ⊗ Y ⊗ Z span M n ⊗ 3 M_n^{\otimes3} M n ⊗ 3 as ( X , Y , Z ) (X,Y,Z) ( X , Y , Z ) ranges over inputs with nonzero rank-one square-zero value at which the slice differential, with simultaneous conjugation, surjects onto s l n \mathfrak{sl}_n sl n . This would permit the choice of an input on which the first nonzero trace coefficient is nonzero. The exact traceless equations could then be solved along the slice with the transverse parameters fixed. Degree eight is the first degree in which a nonzero J 4 J^4 J 4 correction can occur, so it is the first case in which this trace condition must allow a nonzero correction with the same original variables. Polynomials lying wholly in J 4 J^4 J 4 require a separate treatment.
Beyond the proper second layer
For nonproper polynomials in higher degree, a unit restriction can supply a surjective traceless differential along the retained variables at a rank-one nilpotent value. After restoring the deleted inputs, one must control the trace on the exact traceless fiber of the original map, as in the bounded-degree argument of [6 ] . The constructions for traceless containment in [8 ] address the strengthened Mesyan conjecture in higher degrees. The local-fiber question here also requires full-matrix coverage for the traceful noncentral branch. The arbitrary-degree L’vov–Kaplansky conjecture remains open.
Acknowledgments
The author used ChatGPT to assist with manuscript drafting, revision, and mathematical computations. The author is responsible for the mathematical content of the paper. This work was supported by the Beijing Natural Science Foundation (Grant Nos. 1262017, 1252011).
References
School of Mathematics and Statistics, Beijing Jiaotong University, Beijing 100044, China
Email address: shypan@bjtu.edu.cn