OAI/GroupTheory/PolycyclicRecognition/Analysis/TemplateSupportOrder.lean
3 declarations, 0 contain sorry, 0 declared as axioms
Monotonicity and strictness of the weighted template support
- theorem
OAI.PolycyclicRecognition.SupportDatum.weightSupport_eq_of_bound_and_attainedline 19 - theorem
OAI.PolycyclicRecognition.SupportDatum.weightSupport_monoline 31 - theorem
OAI.PolycyclicRecognition.SupportDatum.templateSupport_lt_of_weightSupportline 41Source documentation
Every word basis contains every generator with positive multiplicity, so decreasing one support strictly decreases the entire finite maximum.
theorem templateSupport_lt_of_weightSupport {E F : Set W} (hle : ∀ i, D.weightSupport E i ≤ D.weightSupport F i) (hlt : ∃ i, D.weightSupport E i < D.weightSupport F i) : D.templateSupport E < D.templateSupport F := by …