kebekus
/
nevanlinna
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Minor update

This commit is contained in:
Stefan Kebekus 2024-11-15 09:01:55 +01:00
parent d7b78e8e33
commit 8bff0c782b
2 changed files with 2 additions and 11 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

3
Nevanlinna/meromorphicOn.lean
View File

@ -14,13 +14,14 @@ theorem MeromorphicOn.order_ne_top
{U : Set ℂ} {U : Set ℂ}
(h₁U : IsConnected U) (h₁U : IsConnected U)
(h₁f : MeromorphicOn f U) : (h₁f : MeromorphicOn f U) :
(∃ z₀ : U, (h₁f z₀.1 z₀.2).order ≠ ⊤) ↔ (∀ z : U, (h₁f z.1 z.2).order ≠ ⊤) := by (∃ z₀ : U, (h₁f z₀.1 z₀.2).order = ⊤) ↔ (∀ z : U, (h₁f z.1 z.2).order = ⊤) := by
constructor constructor
· intro h · intro h
obtain ⟨h₁z₀, h₂z₀⟩ := h obtain ⟨h₁z₀, h₂z₀⟩ := h
intro hz intro hz
sorry sorry
· intro h · intro h

10
Nevanlinna/stronglyMeromorphicOn_eliminate.lean
View File

@ -10,16 +10,6 @@ import Nevanlinna.mathlibAddOn
open scoped Interval Topology open scoped Interval Topology
open Real Filter MeasureTheory intervalIntegral open Real Filter MeasureTheory intervalIntegral
theorem MeromorphicOn.order_ne_top
{f : ℂ → ℂ}
{U : Set ℂ}
(h₁U : IsConnected U)
(h₂U : IsCompact U)
(h₁f : MeromorphicOn f U)
(h₂f : ∃ z₀ ∈ U, f z₀ ≠ 0) :
∀ hz : z ∈ U, (h₁f z hz).order ≠ ⊤ := by
sorry
theorem MeromorphicOn.decompose theorem MeromorphicOn.decompose