· 9,685 chars · 12 deps · depth 22 Reason: Proof of the localisation lemma: near-maximising pairs converge to the maximum point by sequential strictness, the one-sided value bounds follow from the closed superlevel sets of the two functions, and the remaining two by solving for one value in terms of the other.
Four reductions: near-maximising pairs converge to the maximum point by sequential strictness; the one-sided value bounds come from the closed superlevel sets of the two functions; the remaining two follow by solving for one value in terms of the other.
Proof
Each result cited is universally quantified over the data in its own statement, and is applied here to the data named in the statement of the lemma.
Claim 1 (near-maximising pairs converge). Let (xk,yk)k∈N be a sequence in A×A with M0−εk<Φ(xk,yk) for every k∈N. Then (xk)k∈N converges to xˉ and (yk)k∈N converges to yˉ in (E,d).
Claim 2 (localisation of the points). For every positive ε∈R there is a positive η∈R such that every (x,y)∈A×A with M0−η<Φ(x,y) satisfies ∣x−xˉ∣<ε and ∣y−yˉ∣<ε.
Proof. Suppose the assertion fails for some positive ε. Then for each k∈N, failure for the positive number εk provides (xk,yk)∈A×A with M0−εk<Φ(xk,yk) for which at least one of ∣xk−xˉ∣<ε and ∣yk−yˉ∣<ε fails, that is, for which ε≤∣xk−xˉ∣ or ε≤∣yk−yˉ∣. By Claim 1 the sequences (xk) and (yk) converge to xˉ and to yˉ in (E,d), so there is k0∈N such that ∣xk−xˉ∣<ε and ∣yk−yˉ∣<ε both hold for every k with k0≤k (take the larger of the two thresholds obtained for σ=ε, using claim 9 of Elementary Order Arithmetic in an Ordered Field on the corresponding indices). For k=k0 this contradicts the previous sentence. This proves Claim 2.
Claim 3 (one-sided value bounds). For every positive ε∈R there is a positive η∈R such that every (x,y)∈A×A with M0−η<Φ(x,y) satisfies
u(x)<u(xˉ)+εandv(yˉ)−ε<v(y).
Proof. Suppose the first inequality fails to hold for all such pairs, for every positive η. Then for each k∈N there is (xk,yk)∈A×A with M0−εk<Φ(xk,yk) and u(xˉ)+ε≤u(xk). By Claim 1 the sequence (xk) lies in A and converges to xˉ in (E,d). The real number t=u(xˉ)+ε satisfies t≤u(xk) for every k, and u has closed superlevel sets in E, so claim 1 of Functions with Closed Superlevel Sets: Sequential Characterisation, Semicontinuity, Perturbation and Limits gives t≤u(xˉ), that is ε≤0 by claim 3 of Elementary Arithmetic in an Ordered Field, contradicting 0<ε. Hence some positive η′ makes the first inequality hold for all pairs as described.
The second inequality is the first one applied to −v and yˉ: if for every positive η some pair (x,y)∈A×A with M0−η<Φ(x,y) had v(y)≤v(yˉ)−ε, that is −v(yˉ)+ε≤−v(y), then choosing such a pair (xk,yk) for η=εk and using that (yk) converges to yˉ by Claim 1, that −v has closed superlevel sets in E, and claim 1 of Functions with Closed Superlevel Sets: Sequential Characterisation, Semicontinuity, Perturbation and Limits would give −v(yˉ)+ε≤−v(yˉ), again contradicting 0<ε. Hence some positive η′′ makes the second inequality hold. Taking for η the lesser of η′ and η′′, positive because it is one of them (claim 9 of Elementary Order Arithmetic in an Ordered Field), proves Claim 3.
Claim 4 (stability of the penalty). Let σ∈R satisfy 0<σ≤1 and let x,y∈E satisfy ∣x−xˉ∣<σ and ∣y−yˉ∣<σ. Then
Claim 5 (the remaining value bounds). For every positive ε∈R there is a positive η∈R such that every (x,y)∈A×A with M0−η<Φ(x,y) satisfies
u(xˉ)−ε<u(x)andv(y)<v(yˉ)+ε.
Proof. Let ε be positive. Choose a positive σ≤1 with 2∣α∣σ(R+1)<4ε, as follows: if α=0 take σ=1, so that the left-hand side is 0; otherwise ∣α∣ is positive by claim 1 of Properties of the Absolute Value in an Ordered Field and R+1 is positive, so the quotient 16∣α∣(R+1)ε exists and is positive by claim 7 of Elementary Order Arithmetic in an Ordered Field, and taking for σ the lesser of it and 1 gives 2∣α∣σ(R+1)≤8ε<4ε.
Let η1 be a number provided by Claim 2 for σ, let η2 be one provided by Claim 3 for 2ε, and let η be the least of η1, η2 and 4ε, positive because it is one of them.
Conclusion. Let ε∈R be positive. Let η1, η2 and η3 be numbers provided for ε by Claims 2, 3 and 5 respectively, and let η be the least of the three, positive because it is one of them. Let (x,y)∈A×A satisfy Φ(xˉ,yˉ)−η<Φ(x,y). Claim 2 gives ∣x−xˉ∣<ε and ∣y−yˉ∣<ε. Claims 3 and 5 give