Source-pinned research

Research proof index

Search theorem names, mathematical ideas, modules, topics, projects, and role-labelled researchers. Open a result for its complete indexed Lean declaration and source record.

This index contains 1 research declarations. Search 10,000 more complete Mathlib declarations.

1 topic
Project-declaredLean 4.32.0

Conditionally Complete Lattice le bi Sup

ConditionallyCompleteLattice.le_biSup

Plain-language statement

In a conditionally complete linear order, suppose the values f(i)f(i) for isi\in s are bounded above. If one of those values is exactly aa, then aa is at most the supremum supisf(i)\sup_{i\in s} f(i).

harmonic analysisFourier analysismeasure theory

Source project: Carleson formalization

Person-level attribution pending.

View proof record