For faster navigation, this Iframe is preloading the Wikiwand page for Hironaka decomposition.

Hironaka decomposition

In mathematics, a Hironaka decomposition is a representation of an algebra over a field as a finitely generated free module over a polynomial subalgebra or a regular local ring. Such decompositions are named after Heisuke Hironaka, who used this in his unpublished master's thesis at Kyoto University (Nagata 1962, p.217).

Hironaka's criterion (Nagata 1962, theorem 25.16), sometimes called miracle flatness, states that a local ring R that is a finitely generated module over a regular Noetherian local ring S is Cohen–Macaulay if and only if it is a free module over S. There is a similar result for rings that are graded over a field rather than local.

Explicit decomposition of an invariant algebra

[edit]

Let be a finite-dimensional vector space over an algebraically closed field of characteristic zero, , carrying a representation of a group , and consider the polynomial algebra on , . The algebra carries a grading with , which is inherited by the invariant subalgebra

.

A famous result of invariant theory, which provided the answer to Hilbert's fourteenth problem, is that if is a linearly reductive group and is a rational representation of , then is finitely-generated. Another important result, due to Noether, is that any finitely-generated graded algebra with admits a (not necessarily unique) homogeneous system of parameters (HSOP). A HSOP (also termed primary invariants) is a set of homogeneous polynomials, , which satisfy two properties:

  1. The are algebraically independent.
  2. The zero set of the , , coincides with the nullcone (link) of .

Importantly, this implies that the algebra can then be expressed as a finitely-generated module over the subalgebra generated by the HSOP, . In particular, one may write

,

where the are called secondary invariants.

Now if is Cohen–Macaulay, which is the case if is linearly reductive, then it is a free (and as already stated, finitely-generated) module over any HSOP. Thus, one in fact has a Hironaka decomposition

.

In particular, each element in can be written uniquely as 􏰐, where , and the product of any two secondaries is uniquely given by , where . This specifies the multiplication in unambiguously.

See also

[edit]

References

[edit]
  • Nagata, Masayoshi (1962), Local rings, Interscience Tracts in Pure and Applied Mathematics, vol. 13, New York-London: Interscience Publishers a division of John Wiley & Sons, ISBN 0-88275-228-6, MR 0155856
  • Sturmfels, Bernd; White, Neil (1991), "Computing combinatorial decompositions of rings", Combinatorica, 11 (3): 275–293, doi:10.1007/BF01205079, MR 1122013
{{bottomLinkPreText}} {{bottomLinkText}}
Hironaka decomposition
Listen to this article

This browser is not supported by Wikiwand :(
Wikiwand requires a browser with modern capabilities in order to provide you with the best reading experience.
Please download and use one of the following browsers:

This article was just edited, click to reload
This article has been deleted on Wikipedia (Why?)

Back to homepage

Please click Add in the dialog above
Please click Allow in the top-left corner,
then click Install Now in the dialog
Please click Open in the download dialog,
then click Install
Please click the "Downloads" icon in the Safari toolbar, open the first download in the list,
then click Install
{{::$root.activation.text}}

Install Wikiwand

Install on Chrome Install on Firefox
Don't forget to rate us

Tell your friends about Wikiwand!

Gmail Facebook Twitter Link

Enjoying Wikiwand?

Tell your friends and spread the love:
Share on Gmail Share on Facebook Share on Twitter Share on Buffer

Our magic isn't perfect

You can help our automatic cover photo selection by reporting an unsuitable photo.

This photo is visually disturbing This photo is not a good choice

Thank you for helping!


Your input will affect cover photo selection, along with input from other users.

X

Get ready for Wikiwand 2.0 🎉! the new version arrives on September 1st! Don't want to wait?