Lecture

Limit Superior and Limit Inferior

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-101(g): Analysis I

Étudier les concepts fondamentaux d'analyse et le calcul différentiel et intégral des fonctions réelles d'une variable. ...

Description

This lecture covers the concepts of limsup and liminf, illustrated with an exam-type exercise and examples. It explains the Bolzano-Weierstrass theorem, accumulation points, and the properties of bounded sequences. The lecture also delves into the concepts of lower and upper limits, convergence of subsequences, and the convergence of bounded sequences. The instructor demonstrates the calculation of limsup and liminf for various sequences, emphasizing the importance of accumulation points and the convergence of bounded sequences.

Instructors (2)

Annalisa Buffa

Teaching & PhD PhD Students Gonzalo Bonilla Moreno, Philipp Christoph Weder, Yannis Dirk Voet, Fabio Marcinno, Ferhat Sindy, Francesco Sala, Markus Renoldner, Mohamed Ben Abdelouahab, Davor Dobrota Past EPFL PhD Students Luca Coradello, Ondine Chanon, Riccardo Puppi Courses Numerical approximation of PDEs MATH-451 The course is about the derivation, theoretical analysis and implementation of the finite element method for the numerical approximation of partial differential equations in on

Lénaïc Chizat

Teaching & PhD PhD Students Javier Esteban Maass Martinez Past EPFL PhD Students Guillaume Yitian Wang Courses Computational optimal transport MATH-528 Computational aspects of measure transportation, from classical optimal transport to modern denoising diffusion models. Topics in machine learning MATH-520 Mathematical analysis of modern supervised machine learning techniques, with an emphasis on the mathematics of artificial neural networks.

Official source

Ontological neighbourhood

Mathematics

Topology: General topology

Related concepts (22)

Subsequence

In mathematics, a subsequence of a given sequence is a sequence that can be derived from the given sequence by deleting some or no elements without changing the order of the remaining elements. For example, the sequence is a subsequence of obtained after removal of elements and The relation of one sequence being the subsequence of another is a preorder. Subsequences can contain consecutive elements which were not consecutive in the original sequence.

Bounded function

In mathematics, a function f defined on some set X with real or complex values is called bounded if the set of its values is bounded. In other words, there exists a real number M such that for all x in X. A function that is not bounded is said to be unbounded. If f is real-valued and f(x) ≤ A for all x in X, then the function is said to be bounded (from) above by A. If f(x) ≥ B for all x in X, then the function is said to be bounded (from) below by B. A real-valued function is bounded if and only if it is bounded from above and below.

Sequence

In mathematics, a sequence is an enumerated collection of objects in which repetitions are allowed and order matters. Like a set, it contains members (also called elements, or terms). The number of elements (possibly infinite) is called the length of the sequence. Unlike a set, the same elements can appear multiple times at different positions in a sequence, and unlike a set, the order does matter. Formally, a sequence can be defined as a function from natural numbers (the positions of elements in the sequence) to the elements at each position.

Uniform convergence

In the mathematical field of analysis, uniform convergence is a mode of convergence of functions stronger than pointwise convergence. A sequence of functions converges uniformly to a limiting function on a set as the function domain if, given any arbitrarily small positive number , a number can be found such that each of the functions differs from by no more than at every point in .

Karl Weierstrass

Karl Theodor Wilhelm Weierstrass (Weierstraß ˈvaɪɐʃtʁaːs; 31 October 1815 – 19 February 1897) was a German mathematician often cited as the "father of modern analysis". Despite leaving university without a degree, he studied mathematics and trained as a school teacher, eventually teaching mathematics, physics, botany and gymnastics. He later received an honorary doctorate and became professor of mathematics in Berlin.

Related lectures (64)

Convergent Sequences: Definitions and Illustrations

Explains convergent sequences, bounded sequences, subsequences, and compact sets with illustrations and proofs.

Subsequences and Bolzano-Weierstrass Theorem

Covers the proof of the Squeeze Theorem, Quotient Criteria, and the Bolzano-Weierstrass Theorem.

Bolzano-Weierstrass: Advanced Analysis I

Explores the Bolzano-Weierstrass theorem on bounded sequences and convergent subsequences.

Convergence and Cauchy Sequences

Covers convergence, Cauchy sequences, and limit superior and limit inferior of bounded sequences.

Sequences and Convergence