Theorems · Theorem · complex analysis
ValueDistribution.logCounting_mul_zero_eventuallyLE
∀ {𝕜 : Type u_1} [inst : NontriviallyNormedField 𝕜] [inst_1 : ProperSpace 𝕜] {f₁ f₂ : 𝕜 → 𝕜},
Meromorphic f₁ →
(∀ (z : 𝕜), meromorphicOrderAt f₁ z ≠ ⊤) →
Meromorphic f₂ →
(∀ (z : 𝕜), meromorphicOrderAt f₂ z ≠ ⊤) →
ValueDistribution.logCounting (f₁ * f₂) 0 ≤ᶠ[Filter.atTop]
ValueDistribution.logCounting f₁ 0 + ValueDistribution.logCounting f₂ 0Asymptotically, the logarithmic counting function for the zeros of f * g is less than or equal to
the sum of the logarithmic counting functions for the zeros of f and g, respectively.
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 211 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites14
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Realstatement and proof · cited by 25,697
- Top.topstatement and proof · cited by 9,680
- NontriviallyNormedFieldstatement and proof · cited by 8,742
- WithTopstatement · cited by 3,754
- Filter.atTopstatement · cited by 2,405
- Filter.univ_mem'proof · cited by 1,672
- Filter.mp_memproof · cited by 1,537
- Filter.EventuallyLEstatement · cited by 383
- ProperSpacestatement and proof · cited by 190
- meromorphicOrderAtstatement and proof · cited by 180
- Filter.eventually_ge_atTopproof · cited by 111
- Meromorphicstatement and proof · cited by 108
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.