Section 9.8: fix undecidable Exercise 9.8.4 statements from issue #517#526
Conversation
|
To be closer to the spirit of the exercise, one can move the quantification over the parameters a, b, f, hcont, hmono inside the Decidable statement instead. |
7f2dfca to
54e4bc8
Compare
|
Good call — pushed an update that keeps the |
|
Thanks — done. Both exercises now keep the |
|
hi @Chessing234, i started work on this section also and came to flag this problem, as i was stuck unable to prove. is there a way that you could fix the build failure so i can pull the code? in particular i think your code is not compiling because it's |
Replace Decidable defs with theorems under continuity and strict monotonicity so the exercise matches Tao's intended inverse statement. Co-authored-by: Cursor <cursoragent@cursor.com>
Per review feedback — keep the Decidable exercise form but decide the universal claim (∀ a b f …, inverse exists) rather than a single instance. Co-authored-by: Cursor <cursoragent@cursor.com>
d0bac0a to
3e8785d
Compare
|
Rebased onto current main. |
Bare `Icc` was unknown to Lean; match the rest of Section_9_8. Co-authored-by: Cursor <cursoragent@cursor.com>
|
Fixed CI: bare |
Summary
Fixes the two
Exercise 9.8.4Decidableexercises flagged in #517.Previously the parameters (
a,b,f, and the continuity/monotonicity hypotheses) were bound outside theDecidable, so the decided proposition depended on the specific function — making it true for some admissible inputs and false for others, i.e. not uniformly decidable.Per @teorth's suggestion, the quantification is now moved inside the
Decidable, so each exercise decides a single closed universal statement (in the spirit of the textbook's "is this true or false?" exercise):exist_inverse_without_continuity: decide whether strict monotonicity alone yields a (continuous, strict-mono) inverse.exist_inverse_without_strictmono: decide whether continuity + monotonicity (without strictness) yields such an inverse.Test plan
lake build(signature-only change)