Lecture

Isomorphism Criterion of Coverings

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-225: Topology II - fundamental groups

On étudie des notions de topologie générale: unions et quotients d'espaces topologiques; on approfondit les notions de revêtements et de groupe fondamental,et d'attachements de cellules et on démontre le Théorème de Seifert-van Kampen. Des exemples de surf ...

Description

This lecture presents the proof that two coverings P: E x and Pi: X are conjugates in TAlx; xo), pow ple) = xo = plé! The instructor explains the isomorphism of coverings and the existence of morphisms of F. The proof involves showing that two coverings P: E x and Pi: X are conjugates in TA (X; xo), pow ple) = xo = plé? The lecture also covers the lifting theory and the composition of functions, demonstrating the isomorphism criterion of coverings.

Instructors (2)

Jérôme Scherer

Teaching & PhD PhD Students Virgile Simon Constantin Past EPFL PhD Students Samuel Lavenir Past EPFL PhD Students as codirector Kay Remo Werndli, Lyne Moser Courses Topology IV.a - Cohomology rings MATH-506 Singular cohomology is defined by dualizing the singular chain complex for spaces. We will study its basic properties, see how it acquires a multiplicative structure and becomes a graded commutative algebra. We study an algebraic version, namely group cohomology, and compare both approa

Dimitri Stelio Wyss

I did my PhD under the supervision of Tamas Hausel at EPFL and the Institue of Science and Technology Austria . From 2017-2019 I was a postdoctoral researcher at the Sorbonne University Paris 6 with François Loeser. Since September 2019 I hold the chair of arithmetic geometry at EPFL as a tenure track assistant professor. For more information see my CV.I work in algebraic and arithmetic geometry. My research uses ideas from p-adic and motivic integration to study the interplay between geometric and arithmet

Official source

Related concepts (30)

Isomorphism

In mathematics, an isomorphism is a structure-preserving mapping between two structures of the same type that can be reversed by an inverse mapping. Two mathematical structures are isomorphic if an isomorphism exists between them. The word isomorphism is derived from the Ancient Greek: ἴσος isos "equal", and μορφή morphe "form" or "shape". The interest in isomorphisms lies in the fact that two isomorphic objects have the same properties (excluding further information such as additional structure or names of objects).

Mathematical proof

A mathematical proof is a deductive argument for a mathematical statement, showing that the stated assumptions logically guarantee the conclusion. The argument may use other previously established statements, such as theorems; but every proof can, in principle, be constructed using only certain basic or original assumptions known as axioms, along with the accepted rules of inference. Proofs are examples of exhaustive deductive reasoning which establish logical certainty, to be distinguished from empirical arguments or non-exhaustive inductive reasoning which establish "reasonable expectation".

Isomorphism theorems

In mathematics, specifically abstract algebra, the isomorphism theorems (also known as Noether's isomorphism theorems) are theorems that describe the relationship between quotients, homomorphisms, and subobjects. Versions of the theorems exist for groups, rings, vector spaces, modules, Lie algebras, and various other algebraic structures. In universal algebra, the isomorphism theorems can be generalized to the context of algebras and congruences.

Morphism

In mathematics, particularly in , a morphism is a structure-preserving map from one mathematical structure to another one of the same type. The notion of morphism recurs in much of contemporary mathematics. In set theory, morphisms are functions; in linear algebra, linear transformations; in group theory, group homomorphisms; in analysis and topology, continuous functions, and so on.

Proof theory

Proof theory is a major branch of mathematical logic and theoretical computer science within which proofs are treated as formal mathematical objects, facilitating their analysis by mathematical techniques. Proofs are typically presented as inductively-defined data structures such as lists, boxed lists, or trees, which are constructed according to the axioms and rules of inference of a given logical system. Consequently, proof theory is syntactic in nature, in contrast to model theory, which is semantic in nature.

Related lectures (64)

Differentiating under the integral sign

Explores differentiating under the integral sign and continuity of functions in integrals.

Differentiating under the integral sign

Explores differentiating under the integral sign and conditions for differentiation, with examples and extensions to functions on open intervals.

Fourier Series: Extension and Periodicity

Covers the extension and periodicity of Fourier series and the interpretation of coefficients.

Harmonic Functions: Properties and Mollification

Covers the properties of harmonic functions and the concept of mollification.

Harmonic Forms: Main Theorem