feat(Algorithms/Lean/MergeSort): relate mergeSort to List.mergeSort#605
Open
exekis wants to merge 1 commit into
Open
feat(Algorithms/Lean/MergeSort): relate mergeSort to List.mergeSort#605exekis wants to merge 1 commit into
exekis wants to merge 1 commit into
Conversation
4fd14a6 to
2e8a7b5
Compare
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
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.
This adds a theorem showing that CSLib's timed
mergeSortreturns the same list as Mathlib'sList.mergeSortfor the linear order comparator.The theorem gives downstream users a bridge from the timed algorithm to existing
List.mergeSortfacts, while keeping the PR deliberately narrower than the open stability issue.Validation:
lake build Cslib.Algorithms.Lean.MergeSort.MergeSortlake build --wfail --iofaillake exe mk_all --check --modulelake testlake lintlake exe lint-style