lean-ja / lean-ja/lean-by-example
`bound` タクティクを紹介する
Open
Nobody has claimed this yet.
タクティク
- Dominant language
- Lean
- Stars
- 188
- Forks
- 15
- Avg merge
- 9h 8m
- Merged PRs (30d)
- 6
Description
不等式評価に特化した aesop のラッパーである。
-- ただしこれは positivity でも示すことができる
theorem extracted_1 {a b c : ℝ} (apos : a > 0) (bpos : b > 0) (cpos : c > 0) : 0 ≤ a⁻¹ * b⁻¹ * c⁻¹ := by
fail_if_success linarith
fail_if_success nlinarith
fail_if_success gcongr
bound
-- これは nlinarith でも示すことができる
example {a b c : ℝ} (cpos : 0 ≤ c) (hba : b ≤ a) : 0 ≤ a * c - b * c := by
fail_if_success linarith
fail_if_success positivity
fail_if_success gcongr
bound
Contributor guide
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
No file or test is named in the issue. Start by locating the repository's existing tactic examples and reviewing how similar entries are structured; done means adding a clear introduction to bound with the supplied examples and preserving the surrounding documentation style.
Written by the indexing model from the issue text.
Assessment
- Domain
- documentation
- Issue type
- Documentation
- Difficulty
- 3/5
- Estimated time
- 1-2 days
- Activity status
- Stale
- Clarity
- Mostly clear
- Newbie friendliness
- 45/100