Linear relation

From testwiki
Revision as of 09:29, 8 July 2024 by imported>Rzuwig (Fixed LintErrors)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Template:Short description In linear algebra, a linear relation, or simply relation, between elements of a vector space or a module is a linear equation that has these elements as a solution.

More precisely, if e1,,en are elements of a (left) module Template:Mvar over a ring Template:Mvar (the case of a vector space over a field is a special case), a relation between e1,,en is a sequence (f1,,fn) of elements of Template:Mvar such that

f1e1++fnen=0.

The relations between e1,,en form a module. One is generally interested in the case where e1,,en is a generating set of a finitely generated module Template:Mvar, in which case the module of the relations is often called a syzygy module of Template:Mvar. The syzygy module depends on the choice of a generating set, but it is unique up to the direct sum with a free module. That is, if S1 and S2 are syzygy modules corresponding to two generating sets of the same module, then they are stably isomorphic, which means that there exist two free modules L1 and L2 such that S1L1 and S2L2 are isomorphic.

Higher order syzygy modules are defined recursively: a first syzygy module of a module Template:Mvar is simply its syzygy module. For Template:Math, a Template:Mvarth syzygy module of Template:Mvar is a syzygy module of a Template:Math-th syzygy module. Hilbert's syzygy theorem states that, if R=K[x1,,xn] is a polynomial ring in Template:Mvar indeterminates over a field, then every Template:Mvarth syzygy module is free. The case Template:Math is the fact that every finite dimensional vector space has a basis, and the case Template:Math is the fact that Template:Math is a principal ideal domain and that every submodule of a finitely generated free Template:Math module is also free.

The construction of higher order syzygy modules is generalized as the definition of free resolutions, which allows restating Hilbert's syzygy theorem as a polynomial ring in Template:Mvar indeterminates over a field has global homological dimension Template:Mvar.

If Template:Mvar and Template:Mvar are two elements of the commutative ring Template:Mvar, then Template:Math is a relation that is said trivial. The module of trivial relations of an ideal is the submodule of the first syzygy module of the ideal that is generated by the trivial relations between the elements of a generating set of an ideal. The concept of trivial relations can be generalized to higher order syzygy modules, and this leads to the concept of the Koszul complex of an ideal, which provides information on the non-trivial relations between the generators of an ideal.

Basic definitions

Let Template:Mvar be a ring, and Template:Mvar be a left Template:Mvar-module. A linear relation, or simply a relation between Template:Mvar elements x1,,xk of Template:Mvar is a sequence (a1,,ak) of elements of Template:Mvar such that

a1x1++akxk=0.

If x1,,xk is a generating set of Template:Mvar, the relation is often called a syzygy of Template:Mvar. It makes sense to call it a syzygy of M without regard to x1,..,xk because, although the syzygy module depends on the chosen generating set, most of its properties are independent; see Template:Slink, below.

If the ring Template:Mvar is Noetherian, or, at least coherent, and if Template:Mvar is finitely generated, then the syzygy module is also finitely generated. A syzygy module of this syzygy module is a second syzygy module of Template:Mvar. Continuing this way one can define a Template:Mvarth syzygy module for every positive integer Template:Mvar.

Hilbert's syzygy theorem asserts that, if Template:Mvar is a finitely generated module over a polynomial ring K[x1,,xn] over a field, then any Template:Mvarth syzygy module is a free module.

Stable properties

Template:Hatnote

Generally speaking, in the language of K-theory, a property is stable if it becomes true by making a direct sum with a sufficiently large free module. A fundamental property of syzygies modules is that there are "stably independent" of choices of generating sets for involved modules. The following result is the basis of these stable properties.

Template:Math theorem

Proof. As {x1,,xm} is a generating set, each yi can be written yi=αi,jxj. This provides a relation ri between x1,,xm,y1,,yn. Now, if r=(a1,,am,b1,,bn) is any relation, then rbiri is a relation between the x1,,xm only. In other words, every relation between x1,,xm,y1,,yn is a sum of a relation between x1,,xm, and a linear combination of the ris. It is straightforward to prove that this decomposition is unique, and this proves the result.

This proves that the first syzygy module is "stably unique". More precisely, given two generating sets S1 and S2 of a module Template:Mvar, if S1 and S2 are the corresponding modules of relations, then there exist two free modules L1 and L2 such that S1L1 and S2L2 are isomorphic. For proving this, it suffices to apply twice the preceding proposition for getting two decompositions of the module of the relations between the union of the two generating sets.

For obtaining a similar result for higher syzygy modules, it remains to prove that, if Template:Mvar is any module, and Template:Mvar is a free module, then Template:Mvar and Template:Math have isomorphic syzygy modules. It suffices to consider a generating set of Template:Math that consists of a generating set of Template:Mvar and a basis of Template:Mvar. For every relation between the elements of this generating set, the coefficients of the basis elements of Template:Mvar are all zero, and the syzygies of Template:Math are exactly the syzygies of Template:Mvar extended with zero coefficients. This completes the proof to the following theorem.

Template:Math theorem

Relationship with free resolutions

Given a generating set g1,,gn of an Template:Mvar-module, one can consider a free module of Template:Mvar of basis G1,,Gn, where G1,,Gn are new indeterminates. This defines an exact sequence

LM0,

where the left arrow is the linear map that maps each Gi to the corresponding gi. The kernel of this left arrow is a first syzygy module of Template:Mvar.

One can repeat this construction with this kernel in place of Template:Mvar. Repeating again and again this construction, one gets a long exact sequence

LkLk1L0M0,

where all Li are free modules. By definition, such a long exact sequence is a free resolution of Template:Mvar.

For every Template:Math, the kernel Sk of the arrow starting from Lk1 is a Template:Mvarth syzygy module of Template:Mvar. It follows that the study of free resolutions is the same as the study of syzygy modules.

A free resolution is finite of length Template:Math if Sn is free. In this case, one can take Ln=Sn, and Lk=0 (the zero module) for every Template:Math.

This allows restating Hilbert's syzygy theorem: If R=K[x1,,xn] is a polynomial ring in Template:Mvar indeterminates over a field Template:Mvar, then every free resolution is finite of length at most Template:Mvar.

The global dimension of a commutative Noetherian ring is either infinite, or the minimal Template:Mvar such that every free resolution is finite of length at most Template:Mvar. A commutative Noetherian ring is regular if its global dimension is finite. In this case, the global dimension equals its Krull dimension. So, Hilbert's syzygy theorem may be restated in a very short sentence that hides much mathematics: A polynomial ring over a field is a regular ring.

Trivial relations

In a commutative ring Template:Mvar, one has always Template:Math. This implies trivially that Template:Math is a linear relation between Template:Mvar and Template:Mvar. Therefore, given a generating set g1,,gk of an ideal Template:Mvar, one calls trivial relation or trivial syzygy every element of the submodule the syzygy module that is generated by these trivial relations between two generating elements. More precisely, the module of trivial syzygies is generated by the relations

ri,j=(x1,,xr)

such that xi=gj, xj=gi, and xh=0 otherwise.

History

The word syzygy came into mathematics with the work of Arthur Cayley.[1] In that paper, Cayley used it in the theory of resultants and discriminants.[2] As the word syzygy was used in astronomy to denote a linear relation between planets, Cayley used it to denote linear relations between minors of a matrix, such as, in the case of a 2×3 matrix:

a|bcef|b|acdf|+c|abde|=0.

Then, the word syzygy was popularized (among mathematicians) by David Hilbert in his 1890 article, which contains three fundamental theorems on polynomials, Hilbert's syzygy theorem, Hilbert's basis theorem and Hilbert's Nullstellensatz.

In his article, Cayley makes use, in a special case, of what was later[3] called the Koszul complex, after a similar construction in differential geometry by the mathematician Jean-Louis Koszul.

Notes

Template:Reflist

References

  1. 1847[Cayley 1847] A. Cayley, “On the theory of involution in geometry”, Cambridge Math. J. 11 (1847), 52–61. See also Collected Papers, Vol. 1 (1889), 80–94, Cambridge Univ. Press, Cambridge.
  2. [Gel’fand et al. 1994] I. M. Gel’fand, M. M. Kapranov, and A. V. Zelevinsky, Discriminants, resultants, and multidimensional determinants, Mathematics: Theory & Applications, Birkhäuser, Boston, 1994.
  3. Serre, Jean-Pierre Algèbre locale. Multiplicités. (French) Cours au Collège de France, 1957–1958, rédigé par Pierre Gabriel. Seconde édition, 1965. Lecture Notes in Mathematics, 11 Springer-Verlag, Berlin-New York 1965 vii+188 pp.; this is the published form of mimeographed notes from Serre's lectures at the College de France in 1958.