Source-pinned research

Research proof index

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 51 research declarations. Search 10,000 more complete Mathlib declarations.

1 topic

51 results

Clear filters
Project-declaredLean 4.31.0

Theorem3d10

HarderNarasimhan.impl.theorem3d10

Plain-language statement

Uniqueness of the canonical Harder–Narasimhan filtration (theorem3d10). Given any function f : ℕ → ℒ that: * starts at and eventually becomes constantly , * is strictly increasing up to its finite length, * has semistable successive restrictions, and * has strictly decreasing μA-slopes, then f agrees pointwise with the canonical constructio...

algebraic geometryvector bundlescategory theory

Source project: Harder-Narasimhan

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Μ bot JH eq μ tot

HarderNarasimhan.impl.μ_bot_JH_eq_μ_tot

Plain-language statement

μ_bot_JH_eq_μ_tot is an invariance statement along a Jordan–Hölder filtration. For every index i before the terminal length, the payoff μ (⊥, JH.filtration i) equals the total payoff μ (⊥, ⊤). The proof is by induction on i using the first step condition.

algebraic geometryvector bundlescategory theory

Source project: Harder-Narasimhan

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Μmax eq μ

HarderNarasimhan.impl.μmax_eq_μ

Plain-language statement

For the associated-prime slope, μmax is definitionally redundant. The definition of μ R M already yields an element that is greatest among the subinterval values, so the μmax operation returns the same value.

algebraic geometryvector bundlescategory theory

Source project: Harder-Narasimhan

Person-level attribution pending.

View proof record