- Algorithms
- >
- Recursion
- >
- Fixed points (mathematics)
- >
- Fixed-point theorems

- Computability theory
- >
- Recursion
- >
- Fixed points (mathematics)
- >
- Fixed-point theorems

- Fields of mathematics
- >
- Dynamical systems
- >
- Fixed points (mathematics)
- >
- Fixed-point theorems

- Fields of mathematics
- >
- Mathematical analysis
- >
- Fixed points (mathematics)
- >
- Fixed-point theorems

- Fields of mathematics
- >
- Mathematical analysis
- >
- Theorems in analysis
- >
- Fixed-point theorems

- Fields of mathematics
- >
- Topology
- >
- Fixed points (mathematics)
- >
- Fixed-point theorems

- Fields of mathematics
- >
- Topology
- >
- Theorems in topology
- >
- Fixed-point theorems

- Geometry
- >
- Topology
- >
- Fixed points (mathematics)
- >
- Fixed-point theorems

- Geometry
- >
- Topology
- >
- Theorems in topology
- >
- Fixed-point theorems

- Mathematical logic
- >
- Recursion
- >
- Fixed points (mathematics)
- >
- Fixed-point theorems

- Mathematical problems
- >
- Mathematical theorems
- >
- Theorems in analysis
- >
- Fixed-point theorems

- Mathematical problems
- >
- Mathematical theorems
- >
- Theorems in topology
- >
- Fixed-point theorems

- Mathematics
- >
- Mathematical theorems
- >
- Theorems in analysis
- >
- Fixed-point theorems

- Mathematics
- >
- Mathematical theorems
- >
- Theorems in topology
- >
- Fixed-point theorems

- Theorems
- >
- Mathematical theorems
- >
- Theorems in analysis
- >
- Fixed-point theorems

- Theorems
- >
- Mathematical theorems
- >
- Theorems in topology
- >
- Fixed-point theorems

Knaster–Tarski theorem

In the mathematical areas of order and lattice theory, the Knaster–Tarski theorem, named after Bronisław Knaster and Alfred Tarski, states the following: Let (L, ≤) be a complete lattice and let f : L

Fixed-point theorems in infinite-dimensional spaces

In mathematics, a number of fixed-point theorems in infinite-dimensional spaces generalise the Brouwer fixed-point theorem. They have applications, for example, to the proof of existence theorems for

Caristi fixed-point theorem

In mathematics, the Caristi fixed-point theorem (also known as the Caristi–Kirk fixed-point theorem) generalizes the Banach fixed-point theorem for maps of a complete metric space into itself. Caristi

Fixed-point iteration

In numerical analysis, fixed-point iteration is a method of computing fixed points of a function. More specifically, given a function defined on the real numbers with real values and given a point in

Banach fixed-point theorem

In mathematics, the Banach fixed-point theorem (also known as the contraction mapping theorem or contractive mapping theorem) is an important tool in the theory of metric spaces; it guarantees the exi

Discrete fixed-point theorem

In discrete mathematics, a discrete fixed-point is a fixed-point for functions defined on finite sets, typically subsets of the integer grid . Discrete fixed-point theorems were developed by Iimura, M

Schauder fixed-point theorem

The Schauder fixed-point theorem is an extension of the Brouwer fixed-point theorem to topological vector spaces, which may be of infinite dimension. It asserts that if is a nonempty convex closed sub

Lefschetz fixed-point theorem

In mathematics, the Lefschetz fixed-point theorem is a formula that counts the fixed points of a continuous mapping from a compact topological space to itself by means of traces of the induced mapping

Bourbaki–Witt theorem

In mathematics, the Bourbaki–Witt theorem in order theory, named after Nicolas Bourbaki and Ernst Witt, is a basic fixed point theorem for partially ordered sets. It states that if X is a non-empty ch

Markov–Kakutani fixed-point theorem

In mathematics, the Markov–Kakutani fixed-point theorem, named after Andrey Markov and Shizuo Kakutani, states that a commuting family of continuous affine self-mappings of a compact convex subset in

Bekić's theorem

In computability theory, Bekić's theorem or Bekić's lemma is a theorem about fixed-points which allows splitting a mutual recursion into recursions on one variable at a time. It was created by Hans Be

Atiyah–Bott fixed-point theorem

In mathematics, the Atiyah–Bott fixed-point theorem, proven by Michael Atiyah and Raoul Bott in the 1960s, is a general form of the Lefschetz fixed-point theorem for smooth manifolds M, which uses an

Kleene fixed-point theorem

In the mathematical areas of order and lattice theory, the Kleene fixed-point theorem, named after American mathematician Stephen Cole Kleene, states the following: Kleene Fixed-Point Theorem. Suppose

Nielsen theory

Nielsen theory is a branch of mathematical research with its origins in topological . Its central ideas were developed by Danish mathematician Jakob Nielsen, and bear his name. The theory developed in

Earle–Hamilton fixed-point theorem

In mathematics, the Earle–Hamilton fixed point theorem is a result in geometric function theory giving sufficient conditions for a holomorphic mapping of an open domain in a complex Banach space into

Fixed-point theorems

In mathematics, a fixed-point theorem is a result saying that a function F will have at least one fixed point (a point x for which F(x) = x), under some conditions on F that can be stated in general t

Kakutani fixed-point theorem

In mathematical analysis, the Kakutani fixed-point theorem is a fixed-point theorem for set-valued functions. It provides sufficient conditions for a set-valued function defined on a convex, compact s

Tarski's fixed-point theorem

No description available.

Ryll-Nardzewski fixed-point theorem

In functional analysis, a branch of mathematics, the Ryll-Nardzewski fixed-point theorem states that if is a normed vector space and is a nonempty convex subset of that is compact under the weak topol

Fixed-point lemma for normal functions

The fixed-point lemma for normal functions is a basic result in axiomatic set theory stating that any normal function has arbitrarily large fixed points (Levy 1979: p. 117). It was first proved by Osw

Poincaré–Birkhoff theorem

In symplectic topology and dynamical systems, Poincaré–Birkhoff theorem (also known as Poincaré–Birkhoff fixed point theorem and Poincaré's last geometric theorem) states that every area-preserving, o

Brouwer fixed-point theorem

Brouwer's fixed-point theorem is a fixed-point theorem in topology, named after L. E. J. (Bertus) Brouwer. It states that for any continuous function mapping a compact convex set to itself there is a

Single-crossing condition

In monotone comparative statics, the single-crossing condition or single-crossing property refers to a condition where the relationship between two or more functions is such that they will only cross

Categorical trace

In category theory, a branch of mathematics, the categorical trace is a generalization of the trace of a matrix.

Bruhat–Tits fixed point theorem

No description available.

Borel fixed-point theorem

In mathematics, the Borel fixed-point theorem is a fixed-point theorem in algebraic geometry generalizing the Lie–Kolchin theorem. The result was proved by Armand Borel.

Infinite compositions of analytic functions

In mathematics, infinite compositions of analytic functions (ICAF) offer alternative formulations of analytic continued fractions, series, products and other infinite expansions, and the theory evolvi

Browder fixed-point theorem

The Browder fixed-point theorem is a refinement of the Banach fixed-point theorem for uniformly convex Banach spaces. It asserts that if is a nonempty convex closed bounded set in uniformly convex Ban

© 2023 Useful Links.