Alphabeta Math
LemmaStatement: AI-generatedProof: AI-generated
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Uniform hitting for a compact closed family of ray segments

Statement

Assume Dependent Choice. Let (Z,d) be a metric space with its metric topology, let (B,T) be a topological space, and let π:Z→B be continuous. Write C([0,∞),Z) for the set of continuous maps from the nonnegative real half-line, with the relative topology inherited from the metric ∣s−t∣ on R, to Z. A complete forward path is an element of this set; its base path is π∘q. Let F⊆C([0,∞),Z) and let A⊆C([0,∞),Z) be a specified set of paths called admissible. Let U∈T.

For maps on [0,m], uniform convergence means that, for every ε>0, eventually d(qn(t),v(t))<ε for every t∈[0,m]. Locally uniform convergence on [0,∞) means uniform convergence on each [0,m], for every positive integer m. Assume the following two properties.

  • For every sequence (qn) in F and every positive integer m, some subsequence of the restrictions qn∣[0,m] converges uniformly to a map v:[0,m]→Z. This quantifies over every sequence, including every subsequence of any previously selected sequence.
  • Every locally uniform limit q:[0,∞)→Z of a sequence from F belongs to A.

If every such limiting path q∈A satisfies π(q(t))∈U for some finite t≥0, then there is L<∞ such that every q∈F satisfies π(q(t))∈U for some t∈[0,L]. The formulation is abstract: a generalized-ray application supplies its own continuous phase paths and admissible class. Neither uniqueness through an initial point nor an admissible extension of an arbitrary finite segment is assumed.

Facts & Assumptions

[F2]

Uniform convergence has the metric meaning of Uniform convergence, and the topology of uniform convergence: the metric topology of the uniform metric on Y^X and on C(X,Y). Claim 2 of A uniform limit of continuous functions is continuous, so C(X,Y) is closed in Y^X under the uniform metric makes every uniform limit of continuous maps on the nonempty interval [0,m] continuous. Completeness of Z is unnecessary because the finite-interval hypothesis supplies limits in Z.

[F3]

Assume The axiom of dependent choice: a relation in which every element is related to something admits an ℕ-indexed chain. It selects the avoiding sequence by extension of finite lists, and is also the stated choice hypothesis of the diagonal supplier.

[F4]

Use the abstract part of Diagonal gluing without a single-valued reflected flow with A0(I)=C(I,Z) for every nonempty time interval I⊂[0,∞). These are auxiliary interval classes, distinct from the specified complete-path class A. Restrictions are continuous by the subspace-topology supplier. The local admissibility contract follows from the definition of continuity: if near each t∈I a map is continuous on a relative interval neighbourhood, every open neighbourhood of its value has a preimage containing a neighbourhood of t in I. Thus the map is continuous at every t. The hereditary extraction hypothesis will be checked for the actual avoiding sequence; no geometric ray construction is used in this abstract application.

Proof

Given: The metric phase space, topological base, continuous projection, path classes, two compactness/closedness assumptions, limiting-path hitting assumption, and Dependent Choice. Goal: A finite common hitting bound for F.

1.1givenF3

Suppose no common bound exists. For every positive integer n there is a path in F whose base avoids U throughout [0,n]. Consider finite lists of paths whose nth entry has this property, including the empty list. Extending a list by one suitable entry is an entire relation on these lists, since failure of a common bound supplies that entry. Dependent Choice starting at the empty list yields a sequence (qj)j≥1 with π(qj(t))∉U for 0≤t≤j.

2.1givenF2F4step 1.1

Set aj=qj∣[0,j]. These curves belong to A0([0,j]) by restriction continuity. Fix a positive integer m and any strictly increasing indices jk≥m. The sequence (qjk) consists of members of F, so the finite-interval compactness hypothesis gives a further subsequence converging uniformly on [0,m] to a map into Z. That limit is continuous by the uniform limit theorem and therefore belongs to A0([0,m]). This verifies the hereditary extraction property of the diagonal supplier, including extraction from every previously selected subsequence.

3.1givenF3F4step 2.1

Apply the diagonal supplier to (aj) and the interval classes A0(I). It gives strictly increasing indices nk and one continuous path q:[0,∞)→Z such that qnk→q uniformly on every bounded time interval, since ank and qnk agree there whenever nk exceeds the endpoint. The closedness assumption in the Statement puts q in A, and the limiting-path hitting assumption supplies a finite t≥0 with π(q(t))∈U.

4.1F1F2step 1.1step 3.1∎

Put z=q(t) and choose δ>0 as in F1 so that d(w,z)<δ implies π(w)∈U. Choose an integer m>t. Uniform convergence on [0,m] gives d(qnk(t),z)<δ for all sufficiently large k, hence π(qnk(t))∈U. But nk→∞, so also nk≥t for large k, contradicting the avoidance property in step 1.1. The contradiction proves that a finite common bound exists.

Depends on

Used by · 1

Dependency tree · 2 levels

Each result is drawn at its shortest distance from this item. Arrows run from prerequisites to the items that use them; this item has a heavier outline. External source nodes link directly to the cited text. The view shows up to two dependency steps; open a prerequisite to continue.