Cryptomorphism

Cryptomorphism

In mathematics, two objects, especially systems of axioms or semantics for them, are called cryptomorphic if they are equivalent (possibly in some informal sense) but not obviously equivalent. This word is a play on the many morphisms in mathematics, but "cryptomorphism" is only very distantly related to "isomorphism", "homomorphism", or "morphisms".

Etymology

The word was coined by Garrett Birkhoff before 1967, for use in the third edition of his book Lattice Theory. Birkhoff did not give it a formal definition, though others working in the field have made some attempts since.

Use in matroid theory

Its informal sense was popularized (and greatly expanded in scope) by Gian-Carlo Rota in the context of matroid theory: there are dozens of equivalent axiomatic approaches to matroids, but two different systems of axioms often look very different.

In his 1997 book Indiscrete Thoughts, Rota describes the situation as follows:

Like many another great idea, matroid theory was invented by one of the great American pioneers, Hassler Whitney. His paper, which is still today the best entry to the subject, flagrantly reveals the unique peculiarity of this field, namely, the exceptional variety of cryptomorphic definitions for a matroid, embarrassingly unrelated to each other and exhibiting wholly different mathematical pedigrees. It is as if one were to condense all trends of present day mathematics onto a single finite structure, a feat that anyone would a priori deem impossible, were it not for the fact that matroids do exist.

Though there are many cryptomorphic concepts in mathematics outside of matroid theory and universal algebra, the word has not caught on among mathematicians generally. It is, however, in fairly wide use among researchers in matroid theory.

References

  • Birkhoff, G.: Lattice Theory, 3rd edition. American Mathematical Society Colloquium Publications, Vol. XXV. 1967.
  • Crapo, H. and Rota, G-C.: On the foundations of combinatorial theory: Combinatorial geometries. M.I.T. Press, Cambridge, Mass. 1970.
  • Elkins, James: Chapter Cryptomorphs in Why Are Our Pictures Puzzles?: On the Modern Origins of Pictorial Complexity, 1999
  • Rota, G-C.: Indiscrete Thoughts, Birkhäuser Boston, Inc., Boston, MA. 1997.
  • White, N., editor: Theory of Matroids, Encyclopedia of Mathematics and its Applications, 26. Cambridge University Press, Cambridge. 1986.

Wikimedia Foundation. 2010.

Игры ⚽ Поможем написать реферат

Look at other dictionaries:

  • cryptomorphism — noun the condition of being cryptomorphic …   Wiktionary

  • Matroid — In combinatorics, a branch of mathematics, a matroid (  /ˈmeɪ …   Wikipedia

  • List of mathematics articles (C) — NOTOC C C closed subgroup C minimal theory C normal subgroup C number C semiring C space C symmetry C* algebra C0 semigroup CA group Cabal (set theory) Cabibbo Kobayashi Maskawa matrix Cabinet projection Cable knot Cabri Geometry Cabtaxi number… …   Wikipedia

  • Cryptomorphisme — En mathématiques, deux objets, et plus spécialement deux systèmes d axiomes ou leurs sémantiques sont dits cryptomorphes en français[réf. nécessaire] (cryptomorphic en anglais) s ils sont équivalents mais pas de manière évidente. C est une… …   Wikipédia en Français

  • cryptomorphic — adjective Two objects, especially systems of axioms or semantics for them, are called cryptomorphic if they are equivalent (possibly in some informal sense) but not obviously equivalent. See Also: cryptomorphism …   Wiktionary

  • Oriented matroid — theory allows a combinatorial approach to the max flow min cut theorem. A network with the value of flow equal to the capacity of an s t cut An oriented matroid is a mathematical structure that abstracts the properties of directed graphs and of… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”