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

All topics

75 results

Clear filters
Project-declaredLean 4.31.0

Prop4d1₁

HarderNarasimhan.impl.prop4d1₁

Plain-language statement

prop4d1₁ is the core statement behind Proposition 4.1: under the two hypotheses h₁ (a weak “eventual improvement” along strict chains) and h₂ (a weak slope-like alternative towards the top), the best-response value μAstar μ coincides with the global infimum μmin μ TotIntvl.

algebraic geometryvector bundlescategory theory

Source project: Harder-Narasimhan

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Prop4d11₁

HarderNarasimhan.impl.prop4d11₁

Plain-language statement

prop4d11₁ shows that if the global extremal values on TotIntvl coincide, then the best-response inequality μBstar μ ≤ μAstar μ holds.

algebraic geometryvector bundlescategory theory

Source project: Harder-Narasimhan

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Prop4d12

HarderNarasimhan.impl.prop4d12

Plain-language statement

prop4d12 derives the equality μmin μ TotIntvl = μmax μ TotIntvl from the stronger equality μmax μ TotIntvl = μ TotIntvl, provided a pointwise dichotomy that rules out “intermediate” points simultaneously satisfying both comparisons.

algebraic geometryvector bundlescategory theory

Source project: Harder-Narasimhan

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Prop4d14

HarderNarasimhan.impl.prop4d14

Plain-language statement

prop4d14 is the dual analogue of prop4d12: starting from μmin μ TotIntvl = μ TotIntvl and a suitable dichotomy, it deduces μmax μ TotIntvl = μmin μ TotIntvl.

algebraic geometryvector bundlescategory theory

Source project: Harder-Narasimhan

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Prop4d16₂

HarderNarasimhan.impl.prop4d16₂

Plain-language statement

prop4d16₂ is the main bridge: under SlopeLike μ and both chain conditions, Nash equilibrium is equivalent to the equality μmin μ TotIntvl = μmax μ TotIntvl. The proof packages the slope-like axiom into weak slope-like data on restrictions, and then combines prop4d11₁ and prop4d11₂ with the earlier characterisations.

algebraic geometryvector bundlescategory theory

Source project: Harder-Narasimhan

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Prop4d18₁

HarderNarasimhan.impl.prop4d18₁

Plain-language statement

prop4d18₁ shows that semistability implies the best-response inequality μBstar μ ≤ μAstar μ in a linearly ordered setting.

algebraic geometryvector bundlescategory theory

Source project: Harder-Narasimhan

Person-level attribution pending.

View proof record