new planet Hamel and Terrace - #150
Conversation
|
Depends on #159. Done. |
|
I am adding Hint and documentation in this PR. I will let you know when it is ready to review. |
| Hint (hidden := true) "[Hint bmpsimp] Evaluate `hg` at the point `a` using | ||
| `congrFun`, then let `simp [bump, Finset.sum_apply]` collapse the sum." | ||
| have hx := congrFun hg a | ||
| simp [bump, Finset.sum_apply, ha] at hx |
There was a problem hiding this comment.
Looks like Finset.sum_apply is a new theorem. I think you need another preliminary level to introduce this.
There was a problem hiding this comment.
Finset.sum_apply is a simp lemma. I added to simp_list. Then I think we don't need an additional level to introduce it.
|
|
||
| open Finsupp | ||
|
|
||
| /- *Linear independent for three vectors*: I not sure we should add this to the main story. -/ |
There was a problem hiding this comment.
It's a nice level, but perhaps you're right that it distracts from the main aim here. Pairs + the general case should suffice for an introduction. So you can remove this.
There was a problem hiding this comment.
I will find out whether we need we need LinearIndependent.pair_iff. I think Fintype.linearIndependent_iff is enough for all these finite indexed linear independent exercise.
|
Overall, I think it's good that you added all those elementary levels at the beginning. |
|
I am also not happy with the |
|
With the additional level that I requested for sum_apply, we're again hitting the limit of 15 levels. I natural point to cut off would be after the "mini-boss" with the bump function. That would give a nice and not-too-long planet for linear independence. And I suppose the remaining levels with the step functions could then be moved into another short and "optional" planet on which nothing else depends? |
•.equivFunOnFinite.Fin.sum_univ_two. sum ofFin 2.Finset.induction_on_min.Finset.min'andFinset.min'_le.