OAI/Algebra/Finitistic/Bar/RecursiveBlockIndex.lean
9 declarations, 0 contain sorry, 0 declared as axioms
- def
OAI.DerivedBar.RecursiveTotal.blocksline 11Source documentation
Recursive total diagonals record exactly r+1 block lengths; the final input degree is the last block length.
def blocks (r : ℕ) : {n : ℕ} → Index r n → Blocks r := by …Mentions: OAI.DerivedBar.RecursiveTotal.Index
- theorem
OAI.DerivedBar.RecursiveTotal.total_blocksline 16 - def
OAI.DerivedBar.RecursiveTotal.indexOfBlocksline 26Source documentation
Recover the successive diagonal choices from the literal block lengths.
def indexOfBlocks : (r : ℕ) → (b : Blocks r) → Index r (total r b) | 0, _ => () | r+1, (i,b) => ⟨⟨⟨i,total r b⟩,rfl⟩,indexOfBlocks r b⟩
Mentions: OAI.DerivedBar.RecursiveTotal.Index
- def
OAI.DerivedBar.RecursiveTotal.castIndexline 30 - theorem
OAI.DerivedBar.RecursiveTotal.blocks_castIndexline 32 - theorem
OAI.DerivedBar.RecursiveTotal.blocks_indexOfBlocksline 35 - theorem
OAI.DerivedBar.RecursiveTotal.blocks_injectiveline 44 - def
OAI.DerivedBar.RecursiveTotal.blockIndexEquivline 60Source documentation
Actual equivalence used to flatten the recursively nested finite diagonals.
def blockIndexEquiv (r n : ℕ) : Index r n ≃ {b : Blocks r // total r b=n} where …Mentions: OAI.DerivedBar.RecursiveTotal.Index
- def
OAI.DerivedBar.RecursiveTotal.shapeIndexEquivline 67Source documentation
The recursive total index is exactly the manuscript's full-degree D/X shape.
def shapeIndexEquiv (r n : ℕ) : Index r n ≃ Multibar.Indexed.Shape (r+n) r := …
Mentions: OAI.DerivedBar.RecursiveTotal.Index, OAI.DerivedBar.Multibar.Indexed.Shape