A Classification of Elements of Sequence Space <em>Seq</em>(R)
Bibliographic record
Abstract
The sequence space of all real-valued sequences, denoted Seq(R), is typically investigated through the lens of infinite-dimensional vector spaces, utilizing Banach space norms or Schauder bases. This work proposes a complementary, constructive classification based instead on the asymptotic limit profile encoded by the pair lim infan, lim supan. We demonstrate that this perspective naturally partitions Seq(R) into seven mutually disjoint macroscale blocks, covering behaviors from finite convergence to bounded and unbounded oscillation. For each block, we provide explicit closed-form representative sequences and establish that every constituent class possesses the cardinality of the continuum. Furthermore, we investigate the structural relationships between these blocks at two distinct levels of granularity. At the macroscale, we employ injective mappings to define an idealized connectivity graph, while at the microscale, we introduce a connection relation governed by the Hadamard (pointwise) product. This dual analysis reveals a rich directed graph structure where the block of finite convergent sequences functions as a global attractor with no outgoing connections. Statistical comparisons between the idealized and realized adjacency matrices indicate that the pointwise product structure realizes approximately two-thirds of the theoretically possible macroscale relations. Ultimately, this partition-based framework endows the seemingly chaotic space Seq(R) with a transparent, geometrically interpretable internal structure.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.006 | 0.008 |
| Meta-epidemiology (narrow) | 0.002 | 0.002 |
| Meta-epidemiology (broad) | 0.003 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.004 | 0.007 |
| Research integrity | 0.002 | 0.002 |
| Insufficient payload (model declined to judge) | 0.003 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; both teacher heads agree on what is shown here.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".