Source-pinned research
Search theorem names, mathematical ideas, modules, topics, projects, and role-labelled researchers. Open a result for its complete indexed Lean declaration and source record.
This index contains 4 research declarations. Search 10,000 more complete Mathlib declarations.
4 results
Clear filtersHarderNarasimhan.μA_res_intvl
Project documentation
Restriction commutes with μA, the infimum over right-endpoints of μmax values. This lemma is a key “locality” principle: computations of μA can be performed on subintervals.
Source project: Harder-Narasimhan
Person-level attribution pending.
HarderNarasimhan.μB_res_intvl
Plain-language statement
Restriction commutes with μB, the supremum over left-endpoints of μmin values. This is the μB-analogue of μA_res_intvl.
Source project: Harder-Narasimhan
Person-level attribution pending.
HarderNarasimhan.μmax_res_intvl
Plain-language statement
Restriction commutes with the “left-anchored supremum” construction μmax from Basic.lean. Mathematically, taking μmax inside an interval is the same as taking μmax in ℒ after forgetting the interval subtype.
Source project: Harder-Narasimhan
Person-level attribution pending.
HarderNarasimhan.μmin_res_intvl
Plain-language statement
Restriction commutes with the “right-anchored infimum” construction μmin from Basic.lean. This is the dual statement to μmax_res_intvl.
Source project: Harder-Narasimhan
Person-level attribution pending.