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.

Pointwise eventual chronological entry is uniform on compact subsets

Statement

Let At be the increasing open chronological pasts in the preceding lemma, and let X be any fixed subset of the spacetime. Suppose every p∈X belongs to At for all sufficiently large t, with a threshold allowed to depend on p. Then each compact L⊂X has a finite common threshold tL for which L⊂At for every t≥tL. This is conditional on pointwise entry and supplies no missing accessibility premise.

Proof

Given: The stated data and explicit hypotheses.

Goal: Establish only the asserted conditional conclusion.

1.1givenF1F2F3

Use the whole real-indexed family (At)t∈R. For each p∈L, the pointwise eventual-entry hypothesis supplies a real threshold a such that p∈At for every t≥a; in particular p∈Aa+1. Hence L⊆⋃t∈RAt. Each member is ambient open by [F1], so this is an indexed ambient open cover as in [F2]. If L is nonempty, the indexed form of [F2] gives finitely many real indices t1,…,tk, with k≥1, such that L⊆At1∪⋯∪Atk.

2.1F1F3step 1.1∎

If L is empty take tL=0. Otherwise the finitely many real indices in step 1.1 have a greatest member: start with t1 and compare each subsequent index with the retained member, retaining the larger one at each of the finitely many comparisons. Call the resulting member tL; then tL≥ti for all i. For every t≥tL, monotonicity gives Ati⊆At when ti<t, and equality handles ti=t. The finite cover therefore gives L⊆At. This proves the asserted compact uniformity without strengthening the pointwise hypothesis or using integer cofinality.

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.