Lecture

Application Reciproque and Composition of Applications

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

In course

MATH-110(a): Advanced linear algebra I - vector spaces

L'objectif du cours est d'introduire les notions de base de l'algèbre linéaire (pour les futurs mathématiciens) et de démontrer rigoureusement les résultats principaux de ce sujet. ...

Description

This lecture covers the concepts of Application Reciproque and Composition of Applications, exploring the relationships between functions and sets, as well as the properties of injective, surjective, and bijective mappings. The instructor explains how to determine the properties of composite functions based on the properties of the individual functions involved, providing examples and proofs to illustrate the concepts.

Instructors (2)

Philippe Michel

Ph. Michel's main research interest lie in the field of analytic number theory and range over a variety of techniques and methods which include: arithmetic geometry, exponential sums, sieve methods, automorphic forms and allied representations, L-functions and more recently ergodic theory. Ph. Michel is a former student of ENS Cachan and obtained his PhD in Universté Paris XI in 1995 under the guidance of E. Fouvry. From 1995 to 1998 he was maître de conférence at Universté Paris XI and full professor at Université Montpellier II until 2008 then when he joined EPFL. Ph. Michel was awarded the Peccot-Vimont prize, has been member of the Institut Universitaire de France and wa invited speaker at the 2006 International Congress of Mathematician.

Daniel Kressner

Official source

Ontological neighbourhood

Mathematics

Mathematical logic: Set theory

Related concepts (32)

Injective module

In mathematics, especially in the area of abstract algebra known as module theory, an injective module is a module Q that shares certain desirable properties with the Z-module Q of all rational numbers. Specifically, if Q is a submodule of some other module, then it is already a direct summand of that module; also, given a submodule of a module Y, any module homomorphism from this submodule to Q can be extended to a homomorphism from all of Y to Q. This concept is to that of projective modules.

Injective hull

In mathematics, particularly in algebra, the injective hull (or injective envelope) of a module is both the smallest injective module containing it and the largest essential extension of it. Injective hulls were first described in . A module E is called the injective hull of a module M, if E is an essential extension of M, and E is injective. Here, the base ring is a ring with unity, though possibly non-commutative. An injective module is its own injective hull. The injective hull of an integral domain is its field of fractions .

Family of sets

In set theory and related branches of mathematics, a collection of subsets of a given set is called a family of subsets of , or a family of sets over More generally, a collection of any sets whatsoever is called a family of sets, set family, or a set system. A family of sets may be defined as a function from a set , known as the index set, to , in which case the sets of the family are indexed by members of .

Injective object

In mathematics, especially in the field of , the concept of injective object is a generalization of the concept of injective module. This concept is important in cohomology, in homotopy theory and in the theory of . The dual notion is that of a projective object. An in a is said to be injective if for every monomorphism and every morphism there exists a morphism extending to , i.e. such that . That is, every morphism factors through every monomorphism . The morphism in the above definition is not required to be uniquely determined by and .

Disjoint sets

In mathematics, two sets are said to be disjoint sets if they have no element in common. Equivalently, two disjoint sets are sets whose intersection is the empty set. For example, {1, 2, 3} and {4, 5, 6} are disjoint sets, while {1, 2, 3} and {3, 4, 5} are not disjoint. A collection of two or more sets is called disjoint if any two distinct sets of the collection are disjoint. This definition of disjoint sets can be extended to families of sets and to indexed families of sets.

Related lectures (64)

Sets and Functions

Introduces sets, functions, and their properties, including injective and surjective functions, composition, and inverse functions.

Mathematical Analysis: Functions and Composition

Covers the analysis of functions, composition, and mathematical induction.

Mapping Functions and Surjections

Explores mapping functions, surjections, injective and surjective functions, and bijective functions.

Sets, Functions and Relations: Q&A

Covers examples of relation composition, Cartesian product, and injective functions.

Functions: Definitions and Notations