Theorems · Inductive type · linear algebra
Holor.CPRankMax
{α : Type} → [Mul α] → [AddMonoid α] → ℕ → {ds : List ℕ} → Holor α ds → PropCPRankMax N x means x has CP rank at most N, that is,
it can be written as the sum of N holors of rank at most 1.
- Defined in
- Mathlib.Data.Holor
- Cited by
- 8 results in Mathlib
- Foundations
- Depth 6 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites2
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
Cited by12
Results whose statement or proof uses this declaration.
- Holor.CPRankMax.belowstatement · cited by 3
- Holor.CPRankMax.brecOnstatement and proof · cited by 2
- Holor.cprankMax_addstatement and proof · cited by 2
- Holor.cprankMax_1statement and proof · cited by 1
- Holor.cprankMax_upper_boundstatement · cited by 1
- Holor.CPRankMax.below.casesOnstatement and proof · cited by 0
- Holor.CPRankMax.casesOnstatement and proof · cited by 0
- Holor.CPRankMax.recOnstatement and proof · cited by 0
- Holor.cprankMax_mulstatement and proof · cited by 0
- Holor.cprankMax_nilstatement and proof · cited by 0
- Holor.cprankMax_sumstatement and proof · cited by 0
- Holor.cprank_upper_boundproof · cited by 0