Effective parts of curve divisors
DefinitionZero part of a divisor#✓fully proved
For a divisor \(D\) on a set of points \(C\), the zero part \(D^+\) of \(D\) is the divisor on \(C\) whose coefficient at each point \(P \in C\) is \(\max(D(P), 0)\).
noncomputable def divZeros (D : CurveDivisor C) : CurveDivisor C :=
D⁺
abbrev CurveDivisor (C : Type*) := C →₀ ℤ
MathlibExt/AlgebraicGeometry/Curve/Divisor.lean:24
Uses 1 · Used by 3
DefinitionPole part of a divisor#✓fully proved
For a divisor \(D\) on a set of points \(C\), the pole part \(D^-\) of \(D\) is the divisor on \(C\) whose coefficient at each point \(P \in C\) is \(\max(-D(P), 0)\).
noncomputable def divPoles (D : CurveDivisor C) : CurveDivisor C :=
D⁻
abbrev CurveDivisor (C : Type*) := C →₀ ℤ
MathlibExt/AlgebraicGeometry/Curve/Divisor.lean:24
Uses 1 · Used by 3
TheoremCoefficients of the zero part#✓fully proved
For every divisor \(D\) on a set of points \(C\) and every point \(P \in C\), the coefficient at \(P\) of the zero part \(D^+\) of \(D\) is \(\max(D(P), 0)\).
@[simp]
theorem divZeros_apply (D : CurveDivisor C) (P : C) :
divZeros D P = max (D P) 0
abbrev CurveDivisor (C : Type*) := C →₀ ℤ
MathlibExt/AlgebraicGeometry/Curve/Divisor.lean:24
noncomputable def divZeros (D : CurveDivisor C) : CurveDivisor C :=
D⁺
MathlibExt/AlgebraicGeometry/Curve/EffectiveParts.lean:28
Uses 2
TheoremCoefficients of the pole part#✓fully proved
For every divisor \(D\) on a set of points \(C\) and every point \(P \in C\), the coefficient at \(P\) of the pole part \(D^-\) of \(D\) is \(\max(-D(P), 0)\).
@[simp]
theorem divPoles_apply (D : CurveDivisor C) (P : C) :
divPoles D P = max (-(D P)) 0
abbrev CurveDivisor (C : Type*) := C →₀ ℤ
MathlibExt/AlgebraicGeometry/Curve/Divisor.lean:24
noncomputable def divPoles (D : CurveDivisor C) : CurveDivisor C :=
D⁻
MathlibExt/AlgebraicGeometry/Curve/EffectiveParts.lean:32
Uses 2
TheoremThe zero part of a divisor is effective#✓fully proved
For every divisor \(D\) on a set of points \(C\), the zero part \(D^+\) of \(D\) is effective: \(D^+(P) \ge 0\) for every point \(P \in C\).
@[simp]
theorem divZeros_nonneg (D : CurveDivisor C) : 0 ≤ divZeros D
abbrev CurveDivisor (C : Type*) := C →₀ ℤ
MathlibExt/AlgebraicGeometry/Curve/Divisor.lean:24
noncomputable def divZeros (D : CurveDivisor C) : CurveDivisor C :=
D⁺
MathlibExt/AlgebraicGeometry/Curve/EffectiveParts.lean:28
Uses 2
TheoremThe pole part of a divisor is effective#✓fully proved
For every divisor \(D\) on a set of points \(C\), the pole part \(D^-\) of \(D\) is effective: \(D^-(P) \ge 0\) for every point \(P \in C\).
@[simp]
theorem divPoles_nonneg (D : CurveDivisor C) : 0 ≤ divPoles D
abbrev CurveDivisor (C : Type*) := C →₀ ℤ
MathlibExt/AlgebraicGeometry/Curve/Divisor.lean:24
noncomputable def divPoles (D : CurveDivisor C) : CurveDivisor C :=
D⁻
MathlibExt/AlgebraicGeometry/Curve/EffectiveParts.lean:32
Uses 2
TheoremA divisor is its zero part minus its pole part#✓fully proved
For every set of points \(C\) and every divisor \(D\) on \(C\), let \(D^+\) be its zero part, with coefficient \(\max(D(P), 0)\) at each point \(P\), and \(D^-\) its pole part, with coefficient \(\max(-D(P), 0)\) at each point \(P\). Then \(D^+ - D^- = D\).
@[simp]
theorem divZeros_sub_divPoles (D : CurveDivisor C) :
divZeros D - divPoles D = D
abbrev CurveDivisor (C : Type*) := C →₀ ℤ
MathlibExt/AlgebraicGeometry/Curve/Divisor.lean:24
noncomputable def divZeros (D : CurveDivisor C) : CurveDivisor C :=
D⁺
MathlibExt/AlgebraicGeometry/Curve/EffectiveParts.lean:28
noncomputable def divPoles (D : CurveDivisor C) : CurveDivisor C :=
D⁻
MathlibExt/AlgebraicGeometry/Curve/EffectiveParts.lean:32
Uses 3
Loading dependency explorer…
The dependency explorer needs JavaScript and its graph data.