A History-Tagged Wheel: E/T = ⊥ — Unified Mega Paper v1–v12.1

This is a unified, corrected proof-sketch in 13 chapters (v1–v12.1) for a history-tagged wheel R_H^{ret}. Two histories E = [[e^{iπ}+1]] and T = [[1-1]] have the same value val = 0 but different histories. Their difference is measured by a soft charge Q_soft with Q_E = 1, Q_T = 0, and by an obstruction class [c] with c(E,T) = 1. The paper collects 11 invariants: E/T = ⊥, Q_soft, universality, [c], K_0, Ext^2, tilting, classifying topos with Ω = {0, ⊥, 1}, U-rank = ω, S-matrix soft correction, and an O(n log n) algorithm on regular histories. This version is a corrected sketch with Lean value-checks for the E,T pair, not a fully formalized monograph. Full proofs of H^2, D^b, topos, and QFT formalization are listed as open gaps in the Epilogue. history-tagged wheel, soft theorem, K-theory, Hochschild homology, classifying topos

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-04
DOI
https://doi.org/10.5281/zenodo.23949811
Primary Topic
Algebraic structures and combinatorial models
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A History-Tagged Wheel: E/T = ⊥ — Unified Mega Paper v1–v12.1

Robert Aaron Tseglin
Zenodo (CERN European Organization for Nuclear Research)
Algebraic structures and combinatorial models
article

A History-Tagged Wheel: E/T = ⊥ — Unified Mega Paper v1–v12.1

Robert Aaron Tseglin
article en

Abstract

This is a unified, corrected proof-sketch in 13 chapters (v1–v12.1) for a history-tagged wheel R_H^{ret}. Two histories E = [[e^{iπ}+1]] and T = [[1-1]] have the same value val = 0 but different histories. Their difference is measured by a soft charge Q_soft with Q_E = 1, Q_T = 0, and by an obstruction class [c] with c(E,T) = 1. The paper collects 11 invariants: E/T = ⊥, Q_soft, universality, [c], K_0, Ext^2, tilting, classifying topos with Ω = {0, ⊥, 1}, U-rank = ω, S-matrix soft correction, and an O(n log n) algorithm on regular histories. This version is a corrected sketch with Lean value-checks for the E,T pair, not a fully formalized monograph. Full proofs of H^2, D^b, topos, and QFT formalization are listed as open gaps in the Epilogue. history-tagged wheel, soft theorem, K-theory, Hochschild homology, classifying topos

Zenodo (CERN European Organization for Nuclear Research)
Openalex Percentile: Top 11%
Algebraic structures and combinatorial models
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon