Concept

Lift (mathematics)

In , a branch of mathematics, given a morphism f: X → Y and a morphism g: Z → Y, a lift or lifting of f to Z is a morphism h: X → Z such that f = g∘h. We say that f factors through h. A basic example in topology is lifting a path in one topological space to a path in a covering space. For example, consider mapping opposite points on a sphere to the same point, a continuous map from the sphere covering the projective plane. A path in the projective plane is a continuous map from the unit interval [0,1]. We can lift such a path to the sphere by choosing one of the two sphere points mapping to the first point on the path, then maintain continuity. In this case, each of the two starting points forces a unique path on the sphere, the lift of the path in the projective plane. Thus in the with continuous maps as morphisms, we have Lifts are ubiquitous; for example, the definition of fibrations (see Homotopy lifting property) and the valuative criteria of separated and proper maps of schemes are formulated in terms of existence and (in the last case) uniqueness of certain lifts. In algebraic topology and homological algebra, tensor product and the Hom functor are adjoint; however, they might not always lift to an exact sequence. This leads to the definition of the Ext functor and the Tor functor. Calculus of relations The notations of first-order predicate logic are streamlined when quantifiers are relegated to established domains and ranges of binary relations. Gunther Schmidt and Michael Winter have illustrated the method of lifting traditional logical expressions of topology to calculus of relations in their book Relational Topology. They aim "to lift concepts to a relational level making them point free as well as quantifier free, thus liberating them from the style of first order predicate logic and approaching the clarity of algebraic reasoning." For example, a partial function M corresponds to the inclusion where denotes the identity relation on the range of M.

À 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.