OctoInformBeta

Nonexpansive fixed points in reflexive Banach spaces

Let XX be a real Banach space and C⊆XC\subseteq X a nonempty norm-closed bounded convex set. A map F:C→CF:C\to C is nonexpansive if ∥F(a)−F(b)∥≤∥a−b∥\|F(a)-F(b)\|\leq\|a-b\| for all a,b∈Ca,b\in C. The fixed point property for nonexpansive maps means that every such map on every such set has a fixed point. The space XX is reflexive if its canonical map into its continuous bidual is onto. The question is whether reflexivity alone guarantees the fixed point property in the given norm.

Browder and Göhde proved the fixed point property for uniformly convex spaces. Alspach constructed a weakly compact convex subset of L1[0,1]L^1[0,1] with a fixed-point-free nonexpansive selfmap. Domínguez Benavides proved that every reflexive Banach space admits an equivalent norm with the fixed point property.

The preprint proves that every real reflexive Banach space has the fixed point property for nonexpansive maps in its given norm. For reflexive XX and any pairwise commuting family of nonexpansive selfmaps of CC, the preprint also deduces from Bruck’s theorem a nonexpansive map from CC onto the common fixed set that fixes every point of that set, a consequence not contained in the Lean library.

Lean has checked every result of the Lean library Nonexpansive, so the Lean library is the reference for the statements on these pages. The Lean library takes completeness and reflexivity of XX, and the stated conditions on CC and FF, as hypotheses of its fixed point theorem. Each result on these pages is stated as in the Lean library and linked to its declaration. Where the preprint states a result differently, its statement is given beside the Lean library’s. The preprint is a guide only, giving the results their order and names.

The Lean library: Nonexpansive

Nonexpansive is a Lean library: 26 items, in five groups. Each has a page written by OctoInform, listed below.

§1. Introduction 2 items
  1. §1 (setting): original-norm nonexpansiveness and reflexivity Nonexpansive maps in the given norm.
  2. Theorem 1.1 [Nonexpansive fixed points] Canonical reflexivity gives nonexpansive fixed points.
§2. Weak compactness and a minimal invariant set 6 items
  1. §2 (setting): weak topology, invariant sets, and the difference ball Weak topology and the difference ball.
  2. Lemma 2.1 [Weak compactness and separation facts] Weak topology and finite norm approximation.
  3. Lemma 2.2 [Separable normalized minimal invariant reduction] Reflexive counterexamples admit normalized minimal sets.
  4. §2 (setting): the standing normalized counterexample Fixing a normalized minimal counterexample.
  5. Lemma 2.3 [Goebel-Karlovitz diameter lemma] Distance limits on a normalized minimal invariant set.
  6. Lemma 2.4 [Compact detector] Compact detection near approximate fixed points.
§3. An anchor for successive choices 9 items
  1. Lemma 3.1 [Resolvents] Anchored contractions determine unique resolvents.
  2. §3.1 (setting): generated maps and resolvent tails Resolvents generate maps with controlled displacement.
  3. §3.2 (setting): maps with the pointwise weak topology Selfmaps with the pointwise weak topology.
  4. Lemma 3.2 [Finite simultaneous approximation] Convex families approximate weak closure points.
  5. Lemma 3.3 [Idempotent in a compact semigroup] An idempotent in all the closures.
  6. §3.2 (setting): tail closures and the anchor tail set Weak tails attached to an anchor.
  7. Proposition 3.4 [An anchor point] Weak compactness yields a resolvent tail anchor.
  8. Lemma 3.5 [Adaptive finite selection] Adaptive choices approximate an anchor.
  9. §3.3 (setting): one common terminal sequence One anchor supplies a common terminal sequence.
§4. A tree of maps and separating functionals 4 items
  1. §4.1 (setting): ordered weighted trees and nonlinear root evaluation Weighted trees evaluate nonlinear maps at the root.
  2. §4.2 (setting): earlier candidates and compact prediction families Compact detector families from earlier candidates.
  3. Proposition 4.1 [Tree data] An adaptive tree retains fixed separating functionals.
  4. §4.3 (setting): inserting final coefficients in a preselected prediction Final coefficients identify the ideal cutoff.
§5. Switching leaves and completing the proof 5 items
  1. §5 (setting): finite descendant blocks and switch vectors Root increments over descendant blocks.
  2. Proposition 5.1 [A finite witness] Switching trees admit finite witnesses.
  3. §5 (proof of Proposition 5.1): one terminal and the block estimate One terminal controls every finite switching block.
  4. §5 (proof of Proposition 5.1): weighted deficit A good leaf from weighted deficit bounds.
  5. §5 (proof of Theorem 1.1): a common branch vector and pointwise vanishing Common branch detection excludes normalized minimal counterexamples.

No item matches.