Skip to main content

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 2,569 curated research declarations and 119,070 complete package declarations. Search 10,000 more complete Mathlib declarations.

All topics

Showing 1,285 to 1,290 of 2,569 results.

Project-declaredLean 4.31.0

Prop4d12

HarderNarasimhan.impl.prop4d12

Mathematical 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

Mathematical 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₂

Mathematical 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₁

Mathematical 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
Project-declaredLean 4.31.0

Prop4d3₁

HarderNarasimhan.impl.prop4d3₁

Mathematical statement

prop4d3₁ is the dual form of Proposition 4.1: under hypotheses h₁ and h₂ phrased for strict anti-chains and bottom-anchored alternatives, the best-response value μBstar μ coincides with the global supremum μmax μ TotIntvl. The proof reduces to prop4d1₁ on the order dual, and then translates the result back via the duality lemmas.

algebraic geometryvector bundlescategory theory

Source project: Harder-Narasimhan

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Prop4d8

HarderNarasimhan.impl.prop4d8

Mathematical statement

Proposition 4.8 (implementation form): μQuotient r d is slope-like. Assumptions: - Additivity of d and r along composable intervals: for x<y<z, we have d(x,z) = d(x,y) + d(y,z) and r(x,z) = r(x,y) + r(y,z). - Positivity condition: if r(x,y) = 0 then d(x,y) > 0. Conclusion: - The quotient construction μQuotient r d satisfies the slope-lik...

algebraic geometryvector bundlescategory theory

Source project: Harder-Narasimhan

Person-level attribution pending.

View proof record