no tricks when proving associativity of min #168
Closed
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
One of the exercises in chapter 2.4 is proving associativity of min. The text above the exercise suggests that there exists a shorter proof by using one of the newly introduced tricks from this chapter, like the "repeat" tactic for example. However, the offered solution does not feature any of these tricks. An additional text was added to not mislead readers into thinking that any of these tricks can be used here.