Categorical calculations · Question 3.3
Arborealization of singularities of Lagrangian skeleta · AIMPL workshop record
Editorial mapping of AIMPL list topic: Arborealization of singularities of Lagrangian skeleta. http://aimpl.org/arborlagrange/ Not an author-supplied MSC code.
Problem statement
Can any smooth stable -category be realized as a finite colimit of categories associated to arboreal singularities? (This turns out to be true for tautological reasons, so we should demand further that such a colimit corresponds to a geometric gluing of the singularities.)
Lean 4
No Lean statement or proof is attached yet. Have a formalization? Share its source to add it to this problem.
Background
Workshop introduction
This page is intended to collect the problems arising from the AIM workshop, "Arborealization of singularities of Lagrangian skeleta."
Section context
For applications to mirror symmetry and representation theory, we are interested in better understanding the category of microlocal sheaves along an arboreal Lagrangian, both in specific cases of interest and in the abstract.
Question context
It is a well-known "fact" that "every category is a Fukaya category." Can the theory of arboreal spaces be used to give a proof of this assertion?
Progress & source assessment
Dated source record, inspected 2026-09-10. Current status has not been independently reassessed. Source-reported results have not been independently verified.
The source supplies no separate status note for this question.
- [1]Arborealization of singularities of Lagrangian skeleta · Original question link
- [2]AIMPL source bibliography link
- [3]AIMPL text license · CC BY-SA 3.0 linkAIM Problem Lists (AIMPL), original contributors; CC BY-SA 3.0. Adaptation: structural TeX converted to Markdown, documented source macros expanded, and source bibliography links added. Mathematical wording retained. These adapted source texts remain under CC BY-SA 3.0.
Recorded progress
Add yours →Nothing recorded yet. A pointer to a paper the entry is missing counts.
Machine attempts
0 recordedAttempts run against the statement below and are recorded in full, including the failures. The point is to stop the next model — and the next person — from re-walking a road that is already known to end. Each attempt costs 25 credits.
No machine attempts recorded.
Sign in to run an attempt. New accounts start with enough credits for ten.
Discussion
0 notesNotes are for clarifying the statement, flagging a missing reference, or recording why an approach fails. Claimed solutions belong in a submission, where they can be reviewed.
No notes yet.
Sign in to add a note.