What was already known
Ordoñez’s Problem 4.14 and Camargo–Ordoñez–Ramírez Questions 3.5 and 3.21 asked about the attainable finite sizes. Earlier subtree counts already realize graph counts from 90 onward, combined with an appropriate geometric realization.
AI involvement
The retained near-cone construction comes from Claude within a human-directed proof.
- All finite cardinalities of the hyperspace of regular subcontinuaAll finite cardinalities of the hyperspace of regular subcontinua
Importance
Gives a complete finite classification and fills all remaining values above the cutoff.
Technical verification
The author documents a Lean 4 verification of all of Theorem A, reports the standard axioms, and provides exact checking programs for finite graph counts. No independent expert review is reported.
Formal checking
The author documents a Lean 4 verification of all of Theorem A, reports the standard axioms, and provides exact checking programs for finite graph counts. No independent expert review is reported.
- Checker
- Alves de Almeida’s Lean verification
- Scope
- The exact cardinality classification in Theorem A
- Basis
- Reported by the linked checker
- All finite cardinalities of the hyperspace of regular subcontinua repositoryAll finite cardinalities of the hyperspace of regular subcontinua repository
Human understanding
Alves de Almeida supplied and describes the geometric realization and reduction to graphs. The available provenance does not separate a human explanation of Claude’s near-cone induction from the model-generated exposition.
Other useful sources
Correction and publication history
Historical curation based on the cited claim, AI attribution and checking scope.
Read this published revision