The Divisor of a meromorphic function #
This file defines the divisor of a meromorphic function and proves the most basic lemmas about those divisors.
TODO #
- Compatibility with restriction of divisors/functions
- Congruence lemmas for
codiscreteWithin
Definition of the Divisor #
The divisor of a meromorphic function f, mapping a point z to the order of f at z, and to
zero if the order is infinite.
Equations
- MeromorphicOn.divisor f U = { toFun := fun (z : π) => if h : MeromorphicOn f U β§ z β U then β―.order.untopβ else 0, supportWithinDomain' := β―, supportLocallyFiniteWithinDomain' := β― }
Instances For
Definition of the divisor
Simplifier lemma: on U, the divisor of a function f that is meromorphic on U evaluates to
order.untopβ.
Divisors of Analytic Functions #
Analytic functions have non-negative divisors.
Behavior under Standard Operations #
If orders are finite, the divisor of the scalar product of two meromorphic functions is the sum of the divisors.
See MeromorphicOn.exists_order_ne_top_iff_forall and
MeromorphicOn.order_ne_top_of_isPreconnected for two convenient criteria to guarantee conditions
hβfβ and hβfβ.
If orders are finite, the divisor of the product of two meromorphic functions is the sum of the divisors.
See MeromorphicOn.exists_order_ne_top_iff_forall and
MeromorphicOn.order_ne_top_of_isPreconnected for two convenient criteria to guarantee conditions
hβfβ and hβfβ.
The divisor of the inverse is the negative of the divisor.
Adding an analytic function to a meromorphic one does not change the pole divisor.
Adding an analytic function to a meromorphic one does not change the pole divisor.