**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# Math-101(en) / Min/Max, Inf/Sup

Description

This lecture covers the concepts of minimum and maximum, infimum and supremum in the context of real numbers. It explains the definitions and properties of these concepts, providing examples and proofs to illustrate their application.

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

MATH-101(en): Analysis I (English)

We study the fundamental concepts of analysis, calculus and the integral of real-valued functions of a real variable.

Related concepts (182)

Upper and lower bounds

In mathematics, particularly in order theory, an upper bound or majorant of a subset S of some preordered set (K, ≤) is an element of K that is greater than or equal to every element of S. Dually, a lower bound or minorant of S is defined to be an element of K that is less than or equal to every element of S. A set with an upper (respectively, lower) bound is said to be bounded from above or majorized (respectively bounded from below or minorized) by that bound.

Bounded set

In mathematical analysis and related areas of mathematics, a set is called bounded if it is, in a certain sense, of finite measure. Conversely, a set which is not bounded is called unbounded. The word "bounded" makes no sense in a general topological space without a corresponding metric. Boundary is a distinct concept: for example, a circle in isolation is a boundaryless bounded set, while the half plane is unbounded yet has a boundary. A bounded set is not necessarily a closed set and vice versa.

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.

Proof (truth)

A proof is sufficient evidence or a sufficient argument for the truth of a proposition. The concept applies in a variety of disciplines, with both the nature of the evidence or justification and the criteria for sufficiency being area-dependent. In the area of oral and written communication such as conversation, dialog, rhetoric, etc., a proof is a persuasive perlocutionary speech act, which demonstrates the truth of a proposition.

Infimum and supremum

In mathematics, the infimum (abbreviated inf; plural infima) of a subset of a partially ordered set is the greatest element in that is less than or equal to each element of if such an element exists. In other words, it is the greatest element of that is lower or equal to the lowest element of . Consequently, the term greatest lower bound (abbreviated as ) is also commonly used. The supremum (abbreviated sup; plural suprema) of a subset of a partially ordered set is the least element in that is greater than or equal to each element of if such an element exists.

Related lectures (1,000)

Properties of Real Numbers: Bounds, Density, Absolute ValueMATH-101(en): Analysis I (English)

Covers the properties of real numbers, including bounds, density, and absolute value.

Logic and Sets

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

Proofs and Logic: Introduction

Introduces logic, proofs, sets, functions, and algorithms in mathematics and computer science.

Hamiltonian Homeomorphisms on Surfaces

Explores the action of Hamiltonian homeomorphisms on surfaces and discusses related mathematical concepts.

Proofs: Logic, Mathematics & AlgorithmsCS-101: Advanced information, computation, communication I

Explores proof concepts, techniques, and applications in logic, mathematics, and algorithms.