[Merged by Bors] - feat(Order): Fin.succAboveOrderIso#21303
Closed
[Merged by Bors] - feat(Order): Fin.succAboveOrderIso#21303
Conversation
PR summary 5c3194fbd4Import changes for modified filesNo significant changes to the import graph Import changes for all files
Declarations diff
You can run this locally as follows## summary with just the declaration names:
./scripts/declarations_diff.sh <optional_commit>
## more verbose report:
./scripts/declarations_diff.sh long <optional_commit>The doc-module for No changes to technical debt.You can run this locally as
|
7 tasks
Ruben-VandeVelde
approved these changes
Feb 2, 2025
Contributor
Ruben-VandeVelde
left a comment
There was a problem hiding this comment.
Seems okay
maintainer merge
|
🚀 Pull request has been placed on the maintainer queue by Ruben-VandeVelde. |
mathlib-bors bot
pushed a commit
that referenced
this pull request
Feb 3, 2025
This PR introduces the order isomorphism `Fin.succAboveOrderIso i : Fin (n + 1) ≃o ({i}ᶜ : Finset (Fin (n + 2)))` for `i : Fin (n + 2)`.
Contributor
|
Pull request successfully merged into master. Build succeeded: |
jt496
pushed a commit
that referenced
this pull request
Feb 3, 2025
This PR introduces the order isomorphism `Fin.succAboveOrderIso i : Fin (n + 1) ≃o ({i}ᶜ : Finset (Fin (n + 2)))` for `i : Fin (n + 2)`.
mathlib-bors bot
pushed a commit
that referenced
this pull request
Mar 14, 2025
…21090) Some new API is introduced for subcomplexes of the standard simplex: any `S : Finset (Fin (n + 1))` defines a subcomplex `face S` of `Δ[n]`, and this face is isomorphic to `Δ[m]` when `Fin (m + 1) ≃o S`. Then, boundaries and horns are redefined as subcomplexes of the standard simplex and it is shown that they are unions of certain codimension one faces of the standard simplex. - [x] depends on: #21543 - [x] depends on: #21540 - [x] depends on: #21542 - [x] depends on: #21303 - [x] depends on: #21047 - [x] depends on: #20840 - [x] depends on: #21096 Co-authored-by: Joël Riou <37772949+joelriou@users.noreply.github.com>
tukamilano
pushed a commit
that referenced
this pull request
Mar 20, 2025
…21090) Some new API is introduced for subcomplexes of the standard simplex: any `S : Finset (Fin (n + 1))` defines a subcomplex `face S` of `Δ[n]`, and this face is isomorphic to `Δ[m]` when `Fin (m + 1) ≃o S`. Then, boundaries and horns are redefined as subcomplexes of the standard simplex and it is shown that they are unions of certain codimension one faces of the standard simplex. - [x] depends on: #21543 - [x] depends on: #21540 - [x] depends on: #21542 - [x] depends on: #21303 - [x] depends on: #21047 - [x] depends on: #20840 - [x] depends on: #21096 Co-authored-by: Joël Riou <37772949+joelriou@users.noreply.github.com>
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
3 participants
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 PR introduces the order isomorphism
Fin.succAboveOrderIso i : Fin (n + 1) ≃o ({i}ᶜ : Finset (Fin (n + 2)))fori : Fin (n + 2).