The Setting
Successive choices may change which maps are admissible at the next step. The approximation sought is a convex combination of their values at a prescribed point.
Let be a subset of a real normed space . The weak carrier is the copy of with the topology induced by the weak topology of .✦ The norm-to-weak identification is the canonical bijection sending each point to its weak representative; the underlying norm point of is its representative in . A subset is weakly compact when its image in the weakly topologized ambient space is compact.✦
For a family of sets of selfmaps of and , the weak tail image closure at is the closed subset of given by (1) The anchor tail-limit set is the subset of obtained from the closures in (1) by (2)✦ An anchor for is a point whose tail-limit set from (2) is a nonempty weakly compact subset of satisfying (3) The convex hull and its norm closure in (3) are taken in .
For a set of possible choices, an evaluation map assigns a point to each choice, and is the family admissible at level . Let be a set of states with initial state and positive integer thresholds , for and . An admissible transition rule on the state set with choices in is a family of relations such that every has a successor with .
A legal selection of length consists of states and choices satisfying (4)
The Claim
Theorem 1 (Adaptive finite selection). Suppose is metrizable, is an anchor for as in (3), and . Fix a state set and positive thresholds, with an admissible transition rule for and . There are a positive integer , a legal selection with choices as in (4), and real coefficients satisfying (5): (5)✦
More generally, suppose is metrizable, is an evaluation map, , and and satisfy the density conditions (6): (6) For every and every admissible transition rule with positive thresholds and initial state , there are a positive integer , a legal selection with choices , and real coefficients satisfying (7): (7)✦
For any finite list and nonnegative real coefficients with , there are a positive integer and a strictly increasing map satisfying (8): (8)✦
In the paper, the result reads: for the anchor of Proposition 3.4 and , any finite integer prescribed before the th choice, depending on the entire preceding history and already fixed auxiliary data, admits a successive selection procedure choosing that terminates after finitely many steps with coefficients assigned at termination, and , and deleting the zero coefficients leaves a nonempty positive list in the original selection order.
What Is Checked
The selection statements concern anchors and evaluation families on with metrizable weak carrier, subject to admissible state transitions, while the positive-support statement concerns arbitrary finite convex combinations in .