OAI/Algebra/Finitistic/Bar/LeadingSupportedComparison.lean
12 declarations, 0 contain sorry, 0 declared as axioms
- theorem
OAI.DerivedBar.ParityBridge.mapIso_trans_congrline 11 - def
OAI.DerivedBar.ParityBridge.supportedLeadingIsoline 38 - theorem
OAI.DerivedBar.ParityBridge.iso_mpr_sourceline 47 - theorem
OAI.DerivedBar.ParityBridge.leadingSummandIso_explicitline 52 - theorem
OAI.DerivedBar.ParityBridge.supportedLeadingIso_eqline 67 - theorem
OAI.DerivedBar.ParityBridge.supportedLeading_lengthline 89 - theorem
OAI.DerivedBar.ParityBridge.innerTotalEmbedding_supported_compline 94 - theorem
OAI.DerivedBar.ParityBridge.leadingTotalEmbedding_on_summandline 114 - theorem
OAI.DerivedBar.ParityBridge.supportedLeadingIso_applyline 134 - theorem
OAI.DerivedBar.ParityBridge.outerBarSuffix_of_patternline 150 - theorem
OAI.DerivedBar.ParityBridge.outerBarSuffix_supportedline 170 - theorem
OAI.DerivedBar.ParityBridge.leadingTotalEmbedding_supportedline 197Source documentation
The leading total embedding on every surviving recursive summand is the original literal tensor inclusion under the previously constructed coordinates.
theorem leadingTotalEmbedding_supported (r n i q : ℕ) (hq : i+q=n) (t : Index r q) (h : inputDegree r t=0) (v : summand (leadingBarSequence k D X r) Z (r+1) n ⟨⟨⟨i,q⟩,hq⟩,t⟩) : ((inclusion (leadingBarSequence k D X r) Z (r+1) n ⟨⟨⟨i,q⟩,hq⟩,t⟩ ≫ eqToHom (congrArg (fun W => W.X n) (leadingIter_total k D X N r)) ≫ leadingTotalEmbedding k D X N r n).hom v) = outerCast k D X N (supportedLeading_length r n ⟨⟨⟨i,q⟩,hq⟩,t⟩ h) (AlgebraTensorModule.lTensor D D (embed k D X N (List.replicate i false ++ innerPattern r t)) ((supportedLeadingIso k D X N r n ⟨⟨⟨i,q⟩,hq⟩,t⟩ h).hom.hom v)) := by …Mentions: OAI.DerivedBar.leadingBarSequence, OAI.DerivedBar.ParityBridge.leadingIter_total, OAI.DerivedBar.ParityBridge.leadingTotalEmbedding, OAI.DerivedBar.ParityBridge.outerCast, OAI.DerivedBar.ParityBridge.supportedLeading_length, OAI.DerivedBar.ParityBridge.supportedLeadingIso