All compact subsets form a CG-cover
ProvedQAlgorithms.Papers.Independent.Intakethird100.P32.allCompactSubsets_isCGCoverLet be a compactly generated Hausdorff space. Index a family by all compact subsets , with each member the inclusion . Then
No exhaustion or countability choice is required. This supplies the compact-subset covering family used throughout the paper, also for the empty space.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P32
namespace QAlgorithms.Papers.Independent.Intakethird100.P32
universe u
open Set Topology
/-- Corollary 3.1, PDF p.18: the inclusion family of all compact subsets covers
any CGH space in the CG topology, including the empty space. -/
theorem allCompactSubsets_isCGCover (X : Type u) [TopologicalSpace X]
[T2Space X] [CompactlyGeneratedSpace X] : CGCover (allCompactSubsets X) := by sorry
end QAlgorithms.Papers.Independent.Intakethird100.P32
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every Hausdorff, compactly generated topological space , consider the family indexed by all compact subsets , whose member at index is itself. For every compact subset , there exists a finite set of such compact subsets of satisfying
where interiors are taken in the subspace topology on . Equivalently, each point of lies in the relative interior of its intersection with at least one compact set selected by . Empty compact subsets are included among the indices, may be empty, and for empty the finite set may be empty.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.