Conversation
PR summary 34451f3c7eImport changes for modified filesNo significant changes to the import graph Import changes for all files
Declarations diffNo declarations were harmed in the making of this PR! 🐙 You can run this locally as follows## summary with just the declaration names:
./scripts/declarations_diff.sh <optional_commit>
## more verbose report:
./scripts/declarations_diff.sh long <optional_commit>The doc-module for |
PhoenixIra
left a comment
There was a problem hiding this comment.
I left some small suggestions for further golfing.
| apply And.intro (le_lfpApprox f x) | ||
| use le_lfpApprox f x a | ||
| intro a' ha'b | ||
| by_cases haa : a' < a |
There was a problem hiding this comment.
We could also use cases lt_or_le a' a here instead.
| theorem lfpApprox_mono_mid (f : α →o α) : Monotone (lfpApprox f) := by | ||
| intro x₁ x₂ h a | ||
| induction a using Ordinal.induction with | ||
| | h i ih => |
There was a problem hiding this comment.
Maybe you could also get rid of the constructor here and use use le_sup_of_le_left h instead.
| rw [mem_fixedPoints_iff] at h | ||
| induction b using Ordinal.induction with | h b IH => | ||
| apply le_antisymm | ||
| · conv => left; rw [lfpApprox] |
There was a problem hiding this comment.
| · conv => left; rw [lfpApprox] | |
| · rw [lfpApprox] |
This should work as well
| refine sSup_le_sSup ?h | ||
| apply sup_le_sup_right |
There was a problem hiding this comment.
| refine sSup_le_sSup ?h | |
| apply sup_le_sup_right | |
| apply sSup_le_sSup <| sup_le_sup_right ?h _ |
Or at least we can remove the ?h here, I think.
YaelDillies
left a comment
There was a problem hiding this comment.
I have strain injuries to both wrists, hence must not type much. Please apologise the poor spelling, vague indications and general conciseness.
| theorem lfpApprox_monotone (f : α →o α) (x : α) : Monotone (lfpApprox f x) := by | ||
| intros a b h | ||
| rw [lfpApprox, lfpApprox] | ||
| refine sSup_le_sSup ?h |
| decreasing_by exact h | ||
|
|
||
| theorem lfpApprox_monotone : Monotone (lfpApprox f x) := by | ||
| theorem lfpApprox_monotone (f : α →o α) (x : α) : Monotone (lfpApprox f x) := by |
| exact ⟨a', h'.trans_le h, rfl⟩ | ||
|
|
||
| theorem le_lfpApprox {a : Ordinal} : x ≤ lfpApprox f x a := by | ||
| theorem le_lfpApprox (f : α →o α) (x : α) (a : Ordinal) : x ≤ lfpApprox f x a := by |
We avoid making
f : α →o αandx : αexplicit arguments when not needed. We then golf most theorems in the file.