**Are you an EPFL student looking for a semester project?**

Work with us on data science and visualisation projects, and deploy your project as an app on top of GraphSearch.

Lecture# Lebesgue Integration: Cantor Set

Description

This lecture covers the construction of the Lebesgue function on the Cantor set, exploring the binary expansion and the uniqueness of the binary operation. It also delves into the properties of the function, such as strict increasing behavior and its characterization as points with only digits 0 and 2. The lecture concludes with a proof regarding the measurability of certain sets and the implications for the function's injectivity.

Login to watch the video

Official source

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

In course

Instructor

Related concepts (165)

Related lectures (984)

MATH-205: Analysis IV

Learn the basis of Lebesgue integration and Fourier analysis

Set theory

Set theory is the branch of mathematical logic that studies sets, which can be informally described as collections of objects. Although objects of any kind can be collected into a set, set theory, as a branch of mathematics, is mostly concerned with those that are relevant to mathematics as a whole. The modern study of set theory was initiated by the German mathematicians Richard Dedekind and Georg Cantor in the 1870s. In particular, Georg Cantor is commonly considered the founder of set theory.

Borel set

In mathematics, a Borel set is any set in a topological space that can be formed from open sets (or, equivalently, from closed sets) through the operations of countable union, countable intersection, and relative complement. Borel sets are named after Émile Borel. For a topological space X, the collection of all Borel sets on X forms a σ-algebra, known as the Borel algebra or Borel σ-algebra. The Borel algebra on X is the smallest σ-algebra containing all open sets (or, equivalently, all closed 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.

Fuzzy set

In mathematics, fuzzy sets (a.k.a. uncertain sets) are sets whose elements have degrees of membership. Fuzzy sets were introduced independently by Lotfi A. Zadeh in 1965 as an extension of the classical notion of set. At the same time, defined a more general kind of structure called an L-relation, which he studied in an abstract algebraic context. Fuzzy relations, which are now used throughout fuzzy mathematics and have applications in areas such as linguistics , decision-making , and clustering , are special cases of L-relations when L is the unit interval [0, 1].

Rough set

In computer science, a rough set, first described by Polish computer scientist Zdzisław I. Pawlak, is a formal approximation of a crisp set (i.e., conventional set) in terms of a pair of sets which give the lower and the upper approximation of the original set. In the standard version of rough set theory (Pawlak 1991), the lower- and upper-approximation sets are crisp sets, but in other variations, the approximating sets may be fuzzy sets. The following section contains an overview of the basic framework of rough set theory, as originally proposed by Zdzisław I.

Open Mapping Theorem

Explains the Open Mapping Theorem for holomorphic maps between Riemann surfaces.

Logic and Sets

Introduces logic, sets, and their operations, including subsets, Cartesian product, and set equivalence.

Sets: Fundamentals and Operations

Covers set fundamentals, operations, and cardinality, including set notation, equality, subsets, and operations like union and intersection.

Measure Spaces: Integration and Inequalities

Covers measure spaces, integration, Radon-Nikodym property, and inequalities like Jensen, Hölder, and Minkowski.

Cantor's Diagonal Argument

Explores Cantor's Diagonal Argument and the concept of uncountability through binary digit sequences.