Theorems · Definition · combinatorics
YoungDiagram.transpose
YoungDiagram → YoungDiagram
The transpose of a Young diagram is obtained by swapping i's with j's.
- Defined in
- Mathlib.Combinatorics.Young.YoungDiagram
- Cited by
- 13 results in Mathlib
- Foundations
- Depth 60 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites5
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coeproof · cited by 62,936
- YoungDiagramstatement and proof · cited by 72
- Equiv.prodCommproof · cited by 55
- YoungDiagram.cellsproof · cited by 16
- Equiv.finsetCongrproof · cited by 9
Cited by14
Results whose statement or proof uses this declaration.
- YoungDiagram.transpose_transposestatement · cited by 3
- YoungDiagram.exists_notMem_colproof · cited by 3
- YoungDiagram.transposeOrderIsoproof · cited by 2
- YoungDiagram.rowLen_transposestatement and proof · cited by 2
- YoungDiagram.transpose_eq_iff_eq_transposestatement and proof · cited by 1
- YoungDiagram.transpose_le_iffstatement and proof · cited by 1
- YoungDiagram.le_of_transpose_lestatement and proof · cited by 1
- YoungDiagram.transposeOrderIso_applystatement · cited by 0
- YoungDiagram.transposeOrderIso_symm_applystatement · cited by 0
- YoungDiagram.transpose_eq_iffstatement · cited by 0
- YoungDiagram.transpose_monostatement · cited by 0
- YoungDiagram.colLen_transposestatement and proof · cited by 0