How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Type-A nilpotent orbit closures are normal via chain varieties
Statement
Assume the Axiom of Choice. Let be a nilpotent endomorphism of a finite-dimensional complex vector space (Nilpotent endomorphisms and their nilpotency index), let be the closure in of its conjugacy orbit (Classical complex matrix Lie algebras), and let . Then is a reduced irreducible normal domain and . This holds for every Jordan type, not only the regular nilpotent cone.
The proof uses the chain schemes: if the Jordan partition of has column lengths , put and for . Let with coordinates and let be the closed subscheme , . Then is a complete intersection, smooth outside a closed subset of codimension , reduced, irreducible and normal, and the invariant ring under is the coordinate ring of via the end map when . For the empty Jordan diagram (, ) and the single-column diagram (, ), the chain has no variables or equations: take , trivial and ; the equation list above is imposed only on existing links. In these cases is a point, its boundary is empty, and its boundary codimension is .
Facts & Assumptions
Given: AC; a finite-dimensional complex vector space of dimension , a nilpotent of Jordan type with column lengths , , the spaces , , and the chain scheme of the Statement.
Jordan strings: every nilpotent endomorphism has a Jordan-string basis; conjugacy classes in are -orbits, and nilpotent elements form a closed cone; for , the nilpotency index of a type- element is the largest part ; on the least-positive-exponent nilpotency index is while the Jordan diagram is empty (Every finite-dimensional nilpotent endomorphism has a basis of Jordan strings, Nilpotent endomorphisms and their nilpotency index, Classical complex matrix Lie algebras).
Orbit dimension and boundary: for the orbit of a closed point under a connected smooth group, and is a union of orbits of strictly smaller dimension; an orbit of a connected group is irreducible, so its closure is irreducible (Fibre dimension and orbit dimension add to the dimension of the group).
Nilpotent type invariants: for a nilpotent of type , ; the conditions for all are equivalent to (dominance of partitions, equivalently ); and . To compute the stabilizer dimension, each string-pair homomorphism is determined by a top-vector image killed by the source string length, giving parameters; summing gives . Counting that same sum rowwise gives (Every finite-dimensional nilpotent endomorphism has a basis of Jordan strings, Fibre dimension and orbit dimension add to the dimension of the group, Nilpotent endomorphisms and their nilpotency index).
Jacobian criterion for : at a closed point , is regular iff . Krull's height theorem: every minimal prime over an ideal generated by elements has height at most . Cohen-Macaulay: a quotient of a polynomial ring by a regular sequence is Cohen-Macaulay; a Cohen-Macaulay ring satisfies for all ; homogeneous localization detects injectivity of graded maps; and a finitely generated module over a local Cohen-Macaulay ring whose parameter system has length equal to the dimension satisfies the parameter theorem (Jacobian rank detects regularity at closed points, Krull's height theorem, Parameters and regular sequences in Cohen--Macaulay modules, Polynomial extensions of Cohen--Macaulay rings, Regular quotients and Cohen--Macaulayness).
Serre conditions: a Noetherian ring is reduced iff it satisfies and , and normal iff it satisfies and (serre r zero s one characterises reducedness, serre normality criterion).
Invariants: finite-dimensional rational -modules are completely reducible, and the -invariants of tensor powers of and are the permutation contractions (Schur-Weyl double centralizer); invariant vectors of rational quotients lift to invariant vectors (Weyl's complete reducibility theorem, The Schur-Weyl mutual centralizer theorem on tensor powers).
Proof
Given: AC, the nilpotent endomorphism , its Jordan columns , and the chain scheme and end map of the Statement, including its empty-chain conventions.
Empty chains. If , take ; if on a nonzero space, its Jordan diagram has a single column and . In either case there are no chain variables or equations, , is trivial and . Its image is the point orbit closure, its coordinate ring is a normal domain, and the empty equation sequence is regular. The boundary is empty and has codimension . All conclusions follow in these cases. Henceforth .
The open chain locus. Put and . The differential of the chain equations is , with the index-zero terms zero. If each is injective or is surjective, these equations can be solved successively for any prescribed right-hand sides: use a left inverse of to choose , or a right inverse of to choose , after the preceding pair is fixed. Thus the open locus with this condition is smooth of dimension by [F4]. It is nonempty: use , inclusions , and restrictions , transported to the fixed spaces. These maps satisfy the equations and have end map .
Alternating strings and their stabilizers. For a nilpotent pair , , the odd operator on with these components has a homogeneous Jordan-string decomposition: kernels and images of its powers are graded, so the complements in the Jordan construction may be chosen homogeneous. Every string alternates letters from and from . Removing all letters gives the Jordan rows of , and removing all letters gives those of . The ranks of alternating composites recover the numbers of strings of each length and starting letter, so a diagram determines one pair orbit and there are finitely many diagrams in fixed dimensions. The pair stabilizer is the unit group of its even endomorphism algebra, an open subset of a vector space and hence smooth and irreducible. On a string kills exactly a terminal and misses exactly an initial ; consequently is injective iff every string ends in , and is surjective iff every string begins in .
Even orbit drops. Distinct dominated types have strictly smaller orbit dimension. One can move from a dominating partition to a dominated one by repeatedly moving a box from an earlier row to a later allowable row: choose an excess row and a subsequent deficit row, taking the last row of the source plateau and the first allowed destination to preserve the partition inequalities, and repeat until the target is reached. A move from row to row increases by and therefore decreases the orbit dimension by that positive even number. Each allowable unit move from row lengths with is realized by a one-parameter degeneration. On chains and of the destination type, keep the usual lowering maps except send to , with . At the type is ; for the ranks of powers are those of (the chain generated by has length , and the remaining chain has length ). Keeping other strings fixed proves that dominated types belong to the top orbit closure. Hence a drop of exactly two consists of one box moved to the next row; any other drop is at least four. Equivalently, parity also follows from for the total sum; individual summands in a difference of square sums need not be even.
The pair-orbit dimension. Write , , and let be the dimensions of the even and odd centralizers of . A homomorphism between Jordan strings of lengths has possible shifts. Counting the parity of those shifts, odd strings of the same endpoint type contribute to the even-minus-odd count, and odd strings of opposite type contribute ; the two opposite Hom directions for an odd/even pair cancel, and even/even pairs contribute zero. Summing gives , because the difference between the numbers of odd -type and odd -type strings is . The pair orbit therefore has dimension , half the dimension of the ordinary orbit of . If a string has letters and letters , then except for equal odd lengths with opposite endpoint types, where the left side is larger by one. Let count the odd strings of length beginning with the two respective letters, and put . Writing and for the ordinary conjugacy orbits, the ordinary Jordan centralizer counts now give . This is a dimension identity for the orbit, not for the full matrix space minus the pair orbit.
Chain strata. Stratify by its compatible alternating-string diagrams at every link. Compatibility means that the -diagram of one link equals the -diagram of the next. These are finitely many locally closed strata. For a link , , projection of its pair orbit to the orbit of has fiber ; projection to the orbit of instead has fiber . Indeed the numerator is the stabilizer of the specified endomorphism in the full acting group, and the denominator is the pair stabilizer. These are smooth homogeneous fibrations. Each numerator is connected and smooth, being a product of unit groups of finite-dimensional endomorphism algebras, and the pair stabilizer is smooth by step 1.3; hence the fibers are smooth and irreducible. Iterating these fibrations proves each nonempty chain stratum smooth and irreducible. The dimension at each fiber-product step is the preceding dimension plus the pair-orbit dimension minus the shared Jordan-orbit dimension. The intermediate orbit dimensions cancel in the formula of step 2.1, giving , where is the type of its final end map.
Dominance and the top stratum. The chain equations make factor through , so and . Thus its type is dominated by by [F3]. For a -diagram , every row must first be filled internally by alternating letters; this requires exactly letters, the size of the diagram obtained by deleting its first column. Over the top diagram , this equals , leaving no extra letters: every string starts and ends in and the lower diagram is exactly the first-column deletion of . Repeat down the chain. There is exactly one top stratum; it has both maximal-rank maps at every link, lies in , and has every . Finally, expanding gives , so its dimension is .
Drops of at least four. By the stratum formula and the nonnegativity of all , a final orbit drop of at least four gives . Every non-top stratum has dimension at most . This latter estimate establishes uniqueness of the dense top stratum but does not assert that every non-top stratum has codimension two: some are smooth divisors inside .
Drops of two and the nonsmooth-locus bound. Suppose is obtained from by moving a box to the next row. Let and denote first-column deletions and let , . At the last link the available number of letters is and its -diagram must be dominated by , since its powers factor through the shorter chain. If the receiving row was nonempty, : internal filling consumes every , all strings begin and end in , and the same next-row degeneration passes to the shorter chain. If a new singleton row is created, . After internal filling there is one extra . It can be attached at either end of the shortened last row, at either end of the new singleton row, or placed in a new singleton row. No earlier row can receive it: its -diagram would gain a box earlier than the removed last-row box and violate dominance by . In the first four placements one map is maximal rank; the lower diagram is either or its next-row degeneration. In the fifth placement both maps fail maximal rank, and singleton strings of both types occur, giving . This remains valid when the shortened row is itself a singleton, when there can be more than one singleton . Inducting through the shorter chain shows that either every link has a maximal-rank map and , or some . In the latter case the dimension formula gives . Together with step 5.1, this proves .
Complete intersection and reducedness. Every irreducible component of the scheme cut out by its equations has dimension at least by [F4]. The top stratum has dimension and all other strata have smaller dimension by step 5.1, so every component has dimension . Thus the equation ideal has height . Its homogeneous generators form a regular sequence in the polynomial ring: at the homogeneous maximal ideal, every prefix of length has height at least , since adjoining the remaining equations raises height by at most ; the opposite inequality is Krull's bound. Complete the generators to a system of parameters and apply the Cohen-Macaulay parameter theorem in [F4]. Homogeneous localization detects a kernel in a multiplication map, so regularity is global. The quotient is Cohen-Macaulay, hence satisfies and . Every component meets the smooth open by step 6.1, so it satisfies ; [F5] implies reducedness.
Irreducibility and normality of the chain. The unique top stratum is irreducible. Its closure contains every component: otherwise a component of dimension would have a nonempty open subset outside that closure, contained in a finite union of strata of dimensions at most , which is impossible. Thus the reduced chain ring is a domain. Its singular locus is contained in , of codimension at least two by step 6.1, so it satisfies ; it satisfies by step 7.1. Serre's criterion [F5] gives normality.
The invariant quotient. For one pair , , invariants under are generated by entries of : the scalar matrices force equal polynomial degrees in , polarization turns a bihomogeneous invariant into a mixed tensor invariant, and [F6] expresses it as permutation contractions. Each contraction is a product of entries of , with possible cyclic traces also polynomials in those entries. For rational finite-dimensional modules, the central scalar torus splits the space into integer weight spaces. On each weight space apply the semisimple Lie algebra complete-reducibility theorem [F6] to ; an invariant complement then respects the center as well. It respects the group because elementary unipotents and diagonal matrices generate . Thus rational quotient invariants lift by complete reducibility in bounded polynomial degree, so the same description applies to a stable closed subscheme with its induced relations. Eliminate vertices in order. At the first vertex the invariant generators are and the remaining variables; the chain equation replaces by . The quotient is consequently the graph over the remaining variables with the induced rank and nilpotency relations, and eliminating the next vertex applies the same one-pair calculation. Repeating leaves precisely the entries of . Thus is generated by those entries, and is the coordinate ring of the closure of . The rank bounds of step 4.1 put the image in the orbit closure of , while the inclusion/restriction construction of step 1.2, applied to every conjugate of , puts its full orbit in the image. Hence that closure is and .
Normality and boundary of the orbit closure. An element of integral over is also integral over the normal domain , hence belongs to it. Being a fraction of invariant elements it is fixed by , so it belongs to ; no equality between the full invariant fraction field and the fraction field of the invariant ring is needed. Therefore is a normal domain, reduced and irreducible. The finitely many boundary nilpotent orbits have positive even dimension drops by step 1.4, so their union has codimension at least two. The point cases and their empty boundary were proved in step 1.1. This proves all chain and orbit conclusions.
Remarks
-
The chain scheme parametrizes compatible alternating-string data: its smooth open part dominates the conjugacy orbit of through the end map , and the invariant quotient collapses the chain data to the orbit closure. No rational-singularity or Hochster-Roberts input is used.
-
The nonsmooth-locus estimate of step 6.1 is the ab-string computation of the source: the strata are read off from alternating letter strings, whose graded Hom dimension counts give the correction terms . Non-top strata may be smooth divisors; it is the complement of that has codimension at least two. The singleton-string case is retained in the five-placement induction.
Depends on
- Nilpotent endomorphisms and their nilpotency index
- Every finite-dimensional nilpotent endomorphism has a basis of Jordan strings
- Classical complex matrix Lie algebras
- Fibre dimension and orbit dimension add to the dimension of the group
- Jacobian rank detects regularity at closed points
- Parameters and regular sequences in Cohen--Macaulay modules
- Polynomial extensions of Cohen--Macaulay rings
- Regular quotients and Cohen--Macaulayness
- Krull's height theorem
- serre r zero s one characterises reducedness
- serre normality criterion
- Weyl's complete reducibility theorem
- The Schur-Weyl mutual centralizer theorem on tensor powers
- The Axiom of Choice
Used by
Dependency tree · two levels
93 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Hanspeter Kraft and Claudio Procesi, Closures of conjugacy classes of matrices are normal, Inventiones Math. 53 (1979) 227-247 (standard reference, not scraped)
- W. Borho and H. Kraft, Ueber Bahnen und deren Deformationen bei linearen Aktionen reduktiver Gruppen, Comment. Math. Helv. 54 (1979) 61-104 (standard reference, not scraped)