Documentation

LeanPool.BrillNoetherGraphs.Bananas.Basics.BananaGeometry

Global geometry of banana graphs #

This file records structural facts about bananas which follow directly from their presentation as positive subdivisions of a two-vertex parallel-edge core.

The two-vertex core underlying every banana is connected.

Every positive-length banana graph is connected.

theorem Bananas.core_twoEdgeConnected {g : ℕ} (hg : 1 ≤ g) (B : Banana g) :

With at least two strands, the parallel-edge core has no one-edge cut.

Thus a nontrivial banana has no bridge in its subdivided graph.

Distinct vertices of a nontrivial banana represent distinct degree-one divisor classes.

Convenient orientation of degree-one rigidity for an ordered marked pair.

The subdivision model has the advertised genus.

The canonical divisor of a genus-g banana is supported at its two multivalent endpoints, with coefficient g - 1 at each endpoint. The coefficient is an integer, so this also correctly covers the genus-zero single-strand case.