Documentation

TauCeti.LowDimTopology.Heegaard.Nice

Nice Heegaard diagrams and the index of their positive domains #

A pointed Heegaard diagram is nice (Sarkar–Wang) when every region containing no basepoint is a bigon or a square: a disk with two or four corners. In a nice diagram the hat differential counts positive domains of Maslov index one avoiding the basepoints, and each of them is an empty embedded bigon or an empty embedded rectangle, so the chain complex is computed combinatorially. This file proves the index estimate behind this, for the abstract region incidence data TauCeti.HeegaardRegionSystem with region Euler characteristics χ.

Lipshitz's formula μ(D) = e(D) + n_x(D) + n_y(D) (TauCeti.HeegaardRegionSystem.maslovIndex) splits the index into an Euler measure and two point measures. For a nonnegative domain D from x to y, each α-curve on which x and y have different points contributes a corner of D at the point of x and one at the point of y, so it contributes at least 1 / 4 to each of n_x(D) and n_y(D). In a nice diagram a bigon has Euler measure 1 / 2 and a square has Euler measure 0, so e(D) ≥ 0 when D avoids the basepoints. Hence, if x and y differ on m curves, then μ(D) ≥ m / 2. The point-measure half of this estimate, TauCeti.HeegaardRegionSystem.IsDomainBetween.eulerMeasure_add_half_hammingDist_le_maslovIndex, holds in every diagram; niceness supplies the sign of the Euler measure.

In particular, in a nice diagram a positive domain of index at most one avoiding the basepoints moves at most two points. If the diagram is also weakly admissible, the only such domain of index at most zero is zero, so one of index one moves exactly one point, as a bigon does, or exactly two, as a rectangle does.

Main definitions #

Main results #

References #

def TauCeti.HeegaardRegionSystem.IsNice {n : ℕ} {Point : Type u} {Region : Type v} {Basepoint : Type w} (H : HeegaardRegionSystem n Point Region Basepoint) [Fintype Point] [DecidableEq Region] (χ : Region → ℤ) :

A pointed Heegaard diagram, with region Euler characteristics χ, is nice when every region containing no basepoint is a bigon or a square: a disk, of Euler characteristic one, with two or four corners.

Instances For
    theorem TauCeti.HeegaardRegionSystem.isNice_iff {n : ℕ} {Point : Type u} {Region : Type v} {Basepoint : Type w} {H : HeegaardRegionSystem n Point Region Basepoint} [Fintype Point] [DecidableEq Region] {χ : Region → ℤ} :
    H.IsNice χ ↔ ∀ (r : Region), (∀ (z : Basepoint), H.basepoint z ≠ r) → χ r = 1 ∧ (H.cornerCount r = 2 ∨ H.cornerCount r = 4)

    Unfolding TauCeti.HeegaardRegionSystem.IsNice.

    theorem TauCeti.HeegaardRegionSystem.IsNice.eulerMeasure_nonneg {n : ℕ} {Point : Type u} {Region : Type v} {Basepoint : Type w} {H : HeegaardRegionSystem n Point Region Basepoint} {D : Region → ℤ} [Fintype Point] [DecidableEq Region] {χ : Region → ℤ} [Fintype Region] (h : H.IsNice χ) (hD0 : 0 ≤ D) (hz : ∀ (z : Basepoint), D (H.basepoint z) = 0) :
    0 ≤ (H.eulerMeasure χ) D

    In a nice diagram, a nonnegative domain avoiding the basepoints has nonnegative Euler measure: bigons have Euler measure 1 / 2 and squares have Euler measure 0.

    theorem TauCeti.HeegaardRegionSystem.IsNice.hammingDist_le_two_mul_maslovIndex {n : ℕ} {Point : Type u} {Region : Type v} {Basepoint : Type w} {H : HeegaardRegionSystem n Point Region Basepoint} {x y : H.Generator} {D : Region → ℤ} [Fintype Point] [DecidableEq Region] {χ : Region → ℤ} [Fintype Region] [DecidableEq Point] (h : H.IsNice χ) (hD : IsDomainBetween x y D) (hD0 : 0 ≤ D) (hz : ∀ (z : Basepoint), D (H.basepoint z) = 0) :
    ↑(hammingDist (H.point x) (H.point y)) ≤ 2 * (H.maslovIndex χ x y) D

    In a nice diagram, a nonnegative domain from x to y avoiding the basepoints has Maslov index at least half the number of α-curves on which x and y differ.

    theorem TauCeti.HeegaardRegionSystem.IsNice.maslovIndex_nonneg {n : ℕ} {Point : Type u} {Region : Type v} {Basepoint : Type w} {H : HeegaardRegionSystem n Point Region Basepoint} {x y : H.Generator} {D : Region → ℤ} [Fintype Point] [DecidableEq Region] {χ : Region → ℤ} [Fintype Region] (h : H.IsNice χ) (hD0 : 0 ≤ D) (hz : ∀ (z : Basepoint), D (H.basepoint z) = 0) :
    0 ≤ (H.maslovIndex χ x y) D

    In a nice diagram, a nonnegative domain avoiding the basepoints has nonnegative Maslov index.

    theorem TauCeti.HeegaardRegionSystem.IsNice.hammingDist_le_two_of_maslovIndex_le_one {n : ℕ} {Point : Type u} {Region : Type v} {Basepoint : Type w} {H : HeegaardRegionSystem n Point Region Basepoint} {x y : H.Generator} {D : Region → ℤ} [Fintype Point] [DecidableEq Region] {χ : Region → ℤ} [Fintype Region] [DecidableEq Point] (h : H.IsNice χ) (hD : IsDomainBetween x y D) (hD0 : 0 ≤ D) (hz : ∀ (z : Basepoint), D (H.basepoint z) = 0) (hμ : (H.maslovIndex χ x y) D ≤ 1) :
    hammingDist (H.point x) (H.point y) ≤ 2

    In a nice diagram, a nonnegative domain from x to y avoiding the basepoints with Maslov index at most one moves the points of x on at most two α-curves.

    theorem TauCeti.HeegaardRegionSystem.IsNice.eq_of_maslovIndex_nonpos {n : ℕ} {Point : Type u} {Region : Type v} {Basepoint : Type w} {H : HeegaardRegionSystem n Point Region Basepoint} {x y : H.Generator} {D : Region → ℤ} [Fintype Point] [DecidableEq Region] {χ : Region → ℤ} [Fintype Region] (h : H.IsNice χ) (hD : IsDomainBetween x y D) (hD0 : 0 ≤ D) (hz : ∀ (z : Basepoint), D (H.basepoint z) = 0) (hμ : (H.maslovIndex χ x y) D ≤ 0) :
    x = y

    In a nice diagram, a nonnegative domain from x to y avoiding the basepoints with Maslov index at most zero connects x to itself.

    theorem TauCeti.HeegaardRegionSystem.IsNice.eq_zero_of_maslovIndex_nonpos {n : ℕ} {Point : Type u} {Region : Type v} {Basepoint : Type w} {H : HeegaardRegionSystem n Point Region Basepoint} {x y : H.Generator} {D : Region → ℤ} [Fintype Point] [DecidableEq Region] {χ : Region → ℤ} [Fintype Region] (h : H.IsNice χ) (hW : H.WeaklyAdmissible) (hD : IsDomainBetween x y D) (hD0 : 0 ≤ D) (hz : ∀ (z : Basepoint), D (H.basepoint z) = 0) (hμ : (H.maslovIndex χ x y) D ≤ 0) :
    D = 0

    In a weakly admissible nice diagram, a nonnegative domain avoiding the basepoints with Maslov index at most zero is the zero domain.

    theorem TauCeti.HeegaardRegionSystem.IsNice.hammingDist_eq_one_or_eq_two_of_maslovIndex_eq_one {n : ℕ} {Point : Type u} {Region : Type v} {Basepoint : Type w} {H : HeegaardRegionSystem n Point Region Basepoint} {x y : H.Generator} {D : Region → ℤ} [Fintype Point] [DecidableEq Region] {χ : Region → ℤ} [Fintype Region] [DecidableEq Point] (h : H.IsNice χ) (hW : H.WeaklyAdmissible) (hD : IsDomainBetween x y D) (hD0 : 0 ≤ D) (hz : ∀ (z : Basepoint), D (H.basepoint z) = 0) (hμ : (H.maslovIndex χ x y) D = 1) :
    hammingDist (H.point x) (H.point y) = 1 ∨ hammingDist (H.point x) (H.point y) = 2

    In a weakly admissible nice diagram, a nonnegative domain from x to y avoiding the basepoints with Maslov index one moves the points of x on exactly one α-curve, as a bigon does, or on exactly two, as a rectangle does.