Lemma 1, Case 2 — a Fejér-monotone sequence converges or its limit points lie on a sphere with axis
ProvedRelaxationMethod.LowDim.lemma1_case2Let be nonempty, let be the affine span of , and assume (that is, ). Let be Fejér-monotone with respect to . Then either converges to a point, or there is a point such that every limit point of lies on the spherical surface having as its axis and passing through :
Together with Case 1 (: convergence), this is the paper's Lemma 1. Case 2 is what makes a non-convergent run accumulate on a sphere around the axis , the starting point of both cases of Theorem 2.
Formalization Note The paper states the lemma for the polytope ; it is stated here for an arbitrary nonempty set , which is stronger (the proof on p. 398 uses only that spans , and §10 applies it to a convex set). "Limit point of the sequence" is a cluster point (MapClusterPt x atTop q), not a point of the closure of the range. The condition excludes the degenerate one-point locus.
import Mathlib import Definitions.Def_RelaxationMethod_Shared_FejerMonotone import Definitions.Def_RelaxationMethod_LowDim_AxisSphere open Filter Topology
namespace RelaxationMethod.LowDim
/-- Lemma 1, Case 2, p. 397: if `A` is nonempty and its affine span `L_r` is not the whole space
(`r < n`), a Fejér-monotone sequence with respect to `A` either converges or all its limit
points lie on one spherical surface having `L_r` as its axis. Stated for an arbitrary nonempty
set `A` (the paper states it for the polytope `A`). -/
theorem lemma1_case2 {n : ℕ} (A : Set (EuclideanSpace ℝ (Fin n))) (hA : A.Nonempty)
(hr : affineSpan ℝ A ≠ ⊤) (q : ℕ → EuclideanSpace ℝ (Fin n))
(hq : RelaxationMethod.Shared.IsFejerMonotone A q) :
(∃ l, Tendsto q atTop (𝓝 l)) ∨
∃ c ∉ affineSpan ℝ A,
∀ x, MapClusterPt x atTop q → x ∈ axisSphere (affineSpan ℝ A) c := by sorry
end RelaxationMethod.LowDim
Read-back
What the Lean code literally says, in plain math · claude-opus-5-5
Setting. Work in with Euclidean distance.
- is an arbitrary nonempty set. It need not be a polytope, convex, or closed.
- , the affine span of , is assumed not to be all of .
- is a sequence satisfying the predicate "Fejér-monotone with respect to ". That predicate comes from the imported definition
RelaxationMethod.Shared.IsFejerMonotone, whose text is not included in the code provided, so the hypothesis cannot be unfolded here. - For an affine subspace and a point , write
Claim. At least one of the following holds.
- converges to some point .
- There is a point such that every cluster point of lies in . A cluster point is a point such that every neighbourhood of contains for infinitely many . Membership in means
The point is not required to be related to the sequence in any other way.
Degenerate cases:
- No cluster points. If has no cluster points (for example, if ), the second alternative holds automatically. A point always exists because .
- One cluster point. If there is exactly one cluster point , the second alternative holds with whenever .
- . The affine span of a nonempty set is the whole space, so the hypothesis on fails and the statement is vacuous.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.