Bracket ring
In-game article clicks load inline without leaving the challenge.
In mathematics invariant theory, the bracket ring is the subring of the ring of polynomials k[x11,...,xdn] generated by the d-by-d minors of a generic d-by-n matrix (xij).
The bracket ring may be regarded as the ring of polynomials on the image of a Grassmannian under the Plücker embedding.
For given d ≤ n we define as formal variables the brackets [λ1 λ2 ... λd] with the λ taken from {1,...,n}, subject to [λ1 λ2 ... λd] = − [λ2 λ1 ... λd] and similarly for other transpositions. The set Λ(n,d) of size ( n d ) {\displaystyle {\binom {n}{d}}} generates a polynomial ring K[Λ(n,d)] over a field K. There is a homomorphism Φ(n,d) from K[Λ(n,d)] to the polynomial ring K[xi,j] in nd indeterminates given by mapping [λ1 λ2 ... λd] to the determinant of the d by d matrix consisting of the columns of the xi,j indexed by the λ. The bracket ring B(n,d) is the image of Φ. The kernel I(n,d) of Φ encodes the relations or syzygies that exist between the minors of a generic n by d matrix. The projective variety defined by the ideal I is the (n−d)d dimensional Grassmann variety whose points correspond to d-dimensional subspaces of an n-dimensional space.
To compute with brackets it is necessary to determine when an expression lies in the ideal I(n,d). This is achieved by a straightening law due to Young (1928).
See also
Notes
- Dieudonné, Jean A.; Carrell, James B. (1970), "Invariant theory, old and new", Advances in Mathematics, 4: 1–80, doi:, ISSN , MR , Zbl
- Dieudonné, Jean A.; Carrell, James B. (1971), Invariant Theory, Old and New, Boston, MA: Academic Press, doi:, ISBN 978-0-12-215540-6, MR , Zbl
- Sturmfels, Bernd (2008), Algorithms in Invariant Theory, Texts and Monographs in Symbolic Computation (2nd ed.), Springer-Verlag, ISBN 978-3211774168, Zbl
- Sturmfels, Bernd; White, Neil (1990), , Mathematica Scandinavica, 67 (2): 183–189, doi:, ISSN , MR , Zbl , archived from on 1997-11-15