In mathematics, in particular algebraic geometry, a moduli space is a geometric space (usually a scheme or an algebraic stack) whose points represent algebro-geometric objects of some fixed kind, or isomorphism classes of such objects. Such spaces frequently arise as solutions to classification problems: If one can show that a collection of interesting objects (e.g., the smooth algebraic curves of a fixed genus) can be given the structure of a geometric space, then one can parametrize such objects by introducing coordinates on the resulting space. In this context, the term "modulus" is used synonymously with "parameter"; moduli spaces were first understood as spaces of parameters rather than as spaces of objects. A variant of moduli spaces is formal moduli. Bernhard Riemann first used the term "moduli" in 1857. Moduli spaces are spaces of solutions of geometric classification problems. That is, the points of a moduli space correspond to solutions of geometric problems. Here different solutions are identified if they are isomorphic (that is, geometrically the same). Moduli spaces can be thought of as giving a universal space of parameters for the problem. For example, consider the problem of finding all circles in the Euclidean plane up to congruence. Any circle can be described uniquely by giving three points, but many different sets of three points give the same circle: the correspondence is many-to-one. However, circles are uniquely parameterized by giving their center and radius: this is two real parameters and one positive real parameter. Since we are only interested in circles "up to congruence", we identify circles having different centers but the same radius, and so the radius alone suffices to parameterize the set of interest. The moduli space is, therefore, the positive real numbers. Moduli spaces often carry natural geometric and topological structures as well. In the example of circles, for instance, the moduli space is not just an abstract set, but the absolute value of the difference of the radii defines a metric for determining when two circles are "close".

À propos de ce résultat
Cette page est générée automatiquement et peut contenir des informations qui ne sont pas correctes, complètes, à jour ou pertinentes par rapport à votre recherche. Il en va de même pour toutes les autres pages de ce site. Veillez à vérifier les informations auprès des sources officielles de l'EPFL.

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.