OpenFrontiers
← Back to the index
OP-10199Status unassessedGeometry and topology

Structures in arboreal geometry · Question 5.1

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.

Workshop record · status unassessedAs of 2026-09-10 source snapshot; not a current-status certificationSource & evidence ↓

Problem statement

Is there a theory of cobordism for closed arboreal spaces?

Lean 4

Not yet attached

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

The theory of arboreal spaces (or "arborifolds") offers a rich new geometry with many interesting questions. The theory also offers us a new language for presenting already useful or important structures from symplectic, differential, and complex geometry.

Question context

By splitting a closed (n+1)(n+1)-dimensional arboreal space along an nn-dimensional arboreal space, we can treat it as a relation between two nn-dimensional arboreal spaces. This geometry motivates the following question:

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.

References
  1. [1]Arborealization of singularities of Lagrangian skeleta · Original question link
  2. [2]AIMPL source bibliography link
  3. [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 recorded

Attempts 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 notes

Notes 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.