Lecture

Abbreviated Calculation: Structures and Sets

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 introduces the concept of abbreviated calculation through restoration and comparison, focusing on the study of structures and operations. It covers the definition and study of structures, the study of operations, and the comparison of sets. The lecture also delves into the unique properties of sets, such as subsets, empty sets, and pairs. Examples are provided to illustrate these concepts, along with discussions on sets that contain themselves and the equality of sets. The lecture concludes with a detailed explanation of how to define quantities and establish equality between sets.

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)

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.

Set (mathematics)

A set is the mathematical model for a collection of different things; a set contains elements or members, which can be mathematical objects of any kind: numbers, symbols, points in space, lines, other geometrical shapes, variables, or even other sets. The set with no element is the empty set; a set with a single element is a singleton. A set may have a finite number of elements or be an infinite set. Two sets are equal if they have precisely the same elements. Sets are ubiquitous in modern mathematics.

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 .

Category of sets

In the mathematical field of , the category of sets, denoted as Set, is the whose are sets. The arrows or morphisms between sets A and B are the total functions from A to B, and the composition of morphisms is the composition of functions. Many other categories (such as the , with group homomorphisms as arrows) add structure to the objects of the category of sets and/or restrict the arrows to functions of a particular kind.

Empty set

In mathematics, the empty set is the unique set having no elements; its size or cardinality (count of elements in a set) is zero. Some axiomatic set theories ensure that the empty set exists by including an axiom of empty set, while in other theories, its existence can be deduced. Many possible properties of sets are vacuously true for the empty set. Any set other than the empty set is called non-empty. In some textbooks and popularizations, the empty set is referred to as the "null set".

Related lectures (64)

Sets and Operations: Introduction to Mathematics

Covers the basics of sets and operations in mathematics, from set properties to advanced operations.

Sets and Relations

Introduces sets, Cartesian product, order importance, and relations on sets.

Linear Algebra: Sets and Operations

Introduces fundamental concepts of linear algebra, focusing on sets and operations.

Sets and Functions

Introduces sets and functions, covering union, intersection, complement, functions terminology, and set operations analogies.

Cartesian Product and Induction