Papers › On rectification and enrichment of infinity properads
On rectification and enrichment of infinity properads
Hongyi Chu, Philip Hackney
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
We develop a theory of infinity properads enriched in a general symmetric monoidal infinity category. These are defined as presheaves, satisfying a Segal condition and a Rezk completeness condition, over certain categories of graphs. In particular, we introduce a new category of level graphs which also allow us to give a framework for algebras over an enriched infinity properad. We show that one can vary the category of graphs without changing the underlying theory. We also show that infinity properads cannot always be rectified, indicating that a conjecture of the second author and Robertson is unlikely to hold. This stands in stark contrast to the situation for infinity operads, and we further demarcate these situations by examining the cases of infinity dioperads and infinity output properads. In both cases, we provide a rectification theorem that says that each up-to-homotopy object is equivalent to a strict one.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections