Documentation

LeanPool.BrillNoetherGraphs.Bananas.Jacobian.BananaJacobianProposition214

The banana Jacobian presentation #

This closes the kernel calculation in Proposition 2.14. The reduction algorithm supplies a paper-reduced representative modulo the displayed relations, while reduced-coordinate kernel triviality forces that representative to vanish. The first isomorphism theorem then identifies the displayed quotient with the range of the graph-level divisor-class map.

Proposition 2.14, relation-lattice equality. The diagonal and strand-length relations displayed in the paper generate every relation of the banana coordinate map to divisor classes.

@[reducible, inline]

The divisor-class image of the banana coordinate map. By the degree-zero surjectivity theorem, this is the graph Jacobian component; using the range here avoids introducing a second, redundant model of that group.

Equations
Instances For

    Proposition 2.14, quotient form. Coordinates modulo the paper's displayed lattice are additively isomorphic to the degree-zero divisor-class range of the banana graph.

    Equations
    Instances For