One step of the flag increases `dim (W ⊓ Fᵢ)` by at most one.
ProvedSchubertCalculus.CompleteFlag.finrank_inf_step_leaether-cataloggeometry
One step of the flag increases dim (W ⊓ Fᵢ) by at most one.
theorem SchubertCalculus.CompleteFlag.finrank_inf_step_le{i : ℕ} (hi : i < n) :
finrank K ((W ⊓ Fl.part (i + 1) : Submodule K V)) ≤
finrank K ((W ⊓ Fl.part i : Submodule K V)) + 1 := by sorry
Formalization Note Transplanted verbatim from the Aether Catalog source Geometry/SchubertCalculus/Flags.lean; the statement is byte-identical to the source declaration, elaborated with autoImplicit disabled in the platform environment.
Preamble
-- Thm stub generated from Geometry/SchubertCalculus/Flags.lean
import Mathlib
import Definitions.Def_Geometry_SchubertCalculus_Flags
/-
Copyright (c) 2026. Released under Apache 2.0 license.
-/
/-!
# Schubert calculus I: complete flags, jump sequences and the cell decomposition
This file provides rigorous foundations for the combinatorial skeleton of the Grassmannian
that underlies Schubert's enumerative calculus.
Given a complete flag `0 = F₀ ⊂ F₁ ⊂ ⋯ ⊂ Fₙ = V` in an `n`-dimensional vector space and a
`k`-dimensional subspace `W ≤ V`, the *jump set*
`J(W) = {i < n | dim (W ⊓ Fᵢ₊₁) = dim (W ⊓ Fᵢ) + 1}` is the fundamental discrete invariant.
Main results:
* `SchubertCalculus.CompleteFlag.finrank_inf_step_le` : the dimension of `W ⊓ Fᵢ` grows by at
most one at each step (a rank–nullity argument through the one dimensional quotient
`Fᵢ₊₁ / Fᵢ`);
* `SchubertCalculus.CompleteFlag.finrank_inf_eq_card_jumpSet` : `dim (W ⊓ F_j)` equals the
number of jumps below `j` — the exact "Schubert dimension datum" of `W`;
* `SchubertCalculus.CompleteFlag.card_jumpSet` : the jump set has exactly `k = dim W` elements,
so that jump sets are indexed by `k`-element subsets of `{0, …, n-1}`;
* `SchubertCalculus.CompleteFlag.cell_pairwise_disjoint` /
`SchubertCalculus.CompleteFlag.mem_cell_jumpSet` : the Schubert cells partition the
Grassmannian.
Everything is stated for an arbitrary field and an arbitrary complete flag.
-/
open SchubertCalculus
open Module Submodule
variable {K V : Type*} [Field K] [AddCommGroup V] [Module K V]
open CompleteFlag
variable {n : ℕ} (Fl : CompleteFlag K V n)
variable [FiniteDimensional K V] (W : Submodule K V)Formal statement
theorem SchubertCalculus.CompleteFlag.finrank_inf_step_le{i : ℕ} (hi : i < n) :
finrank K ((W ⊓ Fl.part (i + 1) : Submodule K V)) ≤
finrank K ((W ⊓ Fl.part i : Submodule K V)) + 1 := by sorrySource