New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
[Merged by Bors] - feat(data/equiv/fintype): computable bijections and perms from/to fintype #6959
Conversation
…type Using exhaustive search, we can upgrade embeddings from fintypes into equivs, and transport perms across embeddings. The computational performance is poor, so the docstring suggests alternatives when an explicit inverse is known.
Should |
Yes, |
Transporting a |
Co-authored-by: Eric Wieser <wieser.eric@gmail.com>
🎉 Great news! Looks like all the dependencies have been resolved: 💡 To add or remove a dependency please update this issue/PR description. Brought to you by Dependent Issues (:robot: ). Happy coding! |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Looks good to me with @eric-wieser's suggestions.
bors d+
✌️ pechersky can now approve this pull request. To approve and merge a pull request, simply reply with |
bors r+ |
…type (#6959) Using exhaustive search, we can upgrade embeddings from fintypes into equivs, and transport perms across embeddings. The computational performance is poor, so the docstring suggests alternatives when an explicit inverse is known. Co-authored-by: Yakov Pechersky <pechersky@users.noreply.github.com>
Pull request successfully merged into master. Build succeeded: |
Using exhaustive search, we can upgrade embeddings from fintypes into
equivs, and transport perms across embeddings. The computational
performance is poor, so the docstring suggests alternatives when an
explicit inverse is known.
perm_congr
group lemmas #6982