K-equivalence

In mathematics, -equivalence, or contact equivalence, is an equivalence relation between map germs. It was introduced by John Mather in his seminal work in Singularity theory in the 1970s as a technical tool for studying stable maps. Since then it has proved important in its own right. Roughly speaking, two map germs ƒ, g are -equivalent if ƒ1(0) and g1(0) are diffeomorphic.

Definition

Two map germs are -equivalent if there is a diffeomorphism

of the form Ψ(x,y) = (φ(x),ψ(x,y)), satisfying,

, and
.

In other words, Ψ maps the graph of f to the graph of g, as well as the graph of the zero map to itself. In particular, the diffeomorphism φ maps f1(0) to g1(0). The name contact is explained by the fact that this equivalence is measuring the contact between the graph of f and the graph of the zero map.

Contact equivalence is the appropriate equivalence relation for studying the sets of solution of equations, and finds many applications in dynamical systems and bifurcation theory, for example.

It is easy to see that this equivalence relation is weaker than A-equivalence, in that any pair of -equivalent map germs are necessarily -equivalent.

KV-equivalence

This modification of -equivalence was introduced by James Damon in the 1980s. Here V is a subset (or subvariety) of Y, and the diffeomorphism Ψ above is required to preserve not but (that is, ). In particular, Ψ maps f1(V) to g1(V).

gollark: You can redo the halloween whatsit?
gollark: I vote for a dragon which is literally a pure white rectangle.
gollark: 2G prizes are typically considered worth more than that, probably, so I don't know.
gollark: How can you be bothered to mouseover all the eggs to check their codes?
gollark: I just try to be very clear and capitalize 90% of it.

See also

References

  • J. Martinet, Singularities of Smooth Functions and Maps, Volume 58 of LMS Lecture Note Series. Cambridge University Press, 1982.
  • J. Damon, The Unfolding and Determinacy Theorems for Subgroups of and . Memoirs Amer. Math. Soc. 50, no. 306 (1984).
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.