Discrete fixed-point theorem

Continuous fixed-point theorems often require a continuous function. Since continuity is not meaningful for functions on discrete sets, it is replaced by conditions such as a direction-preserving function. Such conditions imply that the function does not change too drastically when moving between neighboring points of the integer grid. There are various direction-preservation conditions, depending on whether neighboring points are considered points of a hypercube (HGDP), of a simplex (SGDP) etc. See the page on direction-preserving function for definitions. Continuous fixed-point theorems often require a convex set. The analogue of this property for discrete sets is an integrally-convex set. A fixed point of a discrete function f is defined exactly as for continuous functions: it is a point x for which f(x)=x. == For functions on discrete sets ==

We focus on functions f: X\to \mathbb{R}^n, where the domain X is a nonempty subset of the Euclidean space \mathbb{R}^n. ch(X) denotes the convex hull of X. Iimura-Murota-Tamura theorem: This is a discrete analogue of the Brouwer fixed-point theorem. • [3.9] If X = \mathbb{Z}^n, f: X\to \mathbb{R}^n is bounded and f(x)-x is SGDP, then f has a fixed-point (this follows easily from the previous theorem by taking X to be a subset of \mathbb{Z}^n that bounds f). • [3.10] If X is a finite integrally-convex subset of \mathbb{Z}^n, F: X\to 2^X a point-to-set mapping, and for all x in X: F(x) = \text{ch}(F(x))\cap \mathbb{Z}^n , and there is a function f such that f(x)\in \text{ch}(F(x)) and f(x)-x is SGDP, then there is a point y in X such that y \in F(y). This is a discrete analogue of the Kakutani fixed-point theorem, and the function f is an analogue of a continuous selection function. • [3.12] Suppose X is a finite integrally-convex subset of \mathbb{Z}^n, and it is also symmetric in the sense that x is in X iff -x is in X. If f: X\to \mathbb{R}^n is SGDP w.r.t. a weakly-symmetric triangulation of ch(X) (in the sense that if s is a simplex on the boundary of the triangulation iff -s is), and f(x)\cdot f(-y) \leq 0 for every pair of simplicially-connected points x, y in the boundary of ch(X), then f has a zero point. • See the survey for more theorems. • == For discontinuous functions on continuous sets ==

Discrete fixed-point theorems are closely related to fixed-point theorems on discontinuous functions. These, too, use the direction-preservation condition instead of continuity. Herings-Laan-Talman-Yang fixed-point theorem: Let X be a non-empty convex compact subset of \mathbb{R}^n. Let f: X → X be a locally gross direction preserving (LGDP) function: at any point x that is not a fixed point of f, the direction of f(x)-x is grossly preserved in some neighborhood of x, in the sense that for any two points y, z in this neighborhood, its inner product is non-negative, i.e.: (f(y)-y)\cdot (f(z)-z) \geq 0. Then f has a fixed point in X. The theorem is originally stated for polytopes, but Philippe Bich extends it to convex compact sets.Note that every continuous function is LGDP, but an LGDP function may be discontinuous. An LGDP function may even be neither upper nor lower semi-continuous. Moreover, there is a constructive algorithm for approximating this fixed point. == Applications ==

Discrete fixed-point theorems have been used to prove the existence of a Nash equilibrium in a discrete game, and the existence of a Walrasian equilibrium in a discrete market. == References ==