Subseq Idx find ne of plateau
HarderNarasimhan.impl.subseqIdx_find_ne_of_plateau
Project documentation
subseqIdx_find_ne_of_plateau is a technical combinatorial lemma about the index where f (subseqIdx ...) hits ⊥. It shows that this index cannot coincide with a specified k under a mild “plateau” hypothesis (∃ N, N+1 ≤ k ∧ f N = f (N+1)). The proof uses a finite-cardinality argument on the image set {f t | t ≤ k}.
Exact Lean statement
lemma subseqIdx_find_ne_of_plateau {ℒ : Type*} [Nontrivial ℒ] [Lattice ℒ] [BoundedOrder ℒ]
(f : ℕ → ℒ) (hf0 : f 0 = ⊤) (atf : ∃ k, f k = ⊥) (hfat : Antitone f) (k : ℕ) (hk : f k = ⊥)
(htech : ∃ N : ℕ, N + 1 ≤ k ∧ f N = f (N + 1)) :
(Nat.find <| subseqIdx_hits_bot f atf hfat hf0) ≠ kFormal artifact
Lean source
lemma subseqIdx_find_ne_of_plateau {ℒ : Type*} [Nontrivial ℒ] [Lattice ℒ] [BoundedOrder ℒ](f : ℕ → ℒ) (hf0 : f 0 = ⊤) (atf : ∃ k, f k = ⊥) (hfat : Antitone f) (k : ℕ) (hk : f k = ⊥)(htech : ∃ N : ℕ, N + 1 ≤ k ∧ f N = f (N + 1)) : (Nat.find <| subseqIdx_hits_bot f atf hfat hf0) ≠ k := by let A := Nat.find <| subseqIdx_hits_bot f atf hfat hf0 let 𝒮 := {f t | (t ≤ k)} have helper : ∀ t : ℕ, ∃ l : ℕ, l ≤ k ∧ f (subseqIdx f atf hfat t) = f l := by intro t if hcond : f (subseqIdx f atf hfat t) = ⊥ then exact ⟨k,⟨le_rfl,hcond ▸ hk.symm⟩⟩ else refine ⟨subseqIdx f atf hfat t, ?_, rfl⟩ by_contra hlt exact hcond <| le_bot_iff.mp <| hk ▸ hfat (le_of_lt (lt_of_not_ge hlt)) let Φ : Fin (A+1) → 𝒮 := fun d ↦ let l := (helper d).choose let hl := (helper d).choose_spec ⟨f (subseqIdx f atf hfat d), Set.mem_setOf.mpr ⟨l, ⟨hl.1, hl.2.symm⟩⟩⟩ have hΦ : Function.Injective Φ := by intro d1 d2 h have this : f (subseqIdx f atf hfat d1) = f (subseqIdx f atf hfat d2) := by exact congrArg Subtype.val h if hd : d1 < d2 then have hlt' := subseqIdx_strictAnti f hf0 atf hfat d1 d2 hd (Fin.is_le d2) simp [this] at hlt' else if hd' : d2 < d1 then have hlt' := subseqIdx_strictAnti f hf0 atf hfat d2 d1 hd' (Fin.is_le d1) simp [this] at hlt' else exact Fin.le_antisymm (le_of_not_gt hd') (le_of_not_gt hd) let fS : Fin (k+1) → 𝒮 := fun n ↦ ⟨f n,Set.mem_setOf.mpr ⟨n,⟨Fin.is_le n,rfl⟩⟩⟩ have fSsuj : Function.Surjective fS := by intro y rcases y.prop.out with ⟨n1,n2,n3⟩ use ⟨n1,Nat.lt_succ_of_le n2⟩, SetCoe.ext n3 have : Fintype 𝒮 := Set.Finite.fintype <| Finite.of_surjective fS fSsuj have ineq1: A + 1 ≤ Fintype.card ↑𝒮 := Fintype.card_fin (A+1) ▸ Fintype.card_le_of_injective Φ hΦ have ineq2 : Fintype.card ↑𝒮 < k + 1 := Fintype.card_fin (k+1) ▸ Fintype.card_lt_of_surjective_not_injective fS fSsuj <| Function.not_injective_iff.mpr ⟨⟨htech.choose,Nat.lt_add_right 1 htech.choose_spec.1⟩, ⟨htech.choose+1,Nat.add_lt_add_right htech.choose_spec.1 1⟩,⟨SetCoe.ext htech.choose_spec.2,by simp⟩⟩ exact ne_of_lt <| Nat.succ_lt_succ_iff.mp <| lt_of_le_of_lt ineq1 ineq2- Project
- Harder-Narasimhan
- License
- Apache-2.0
- Commit
- 20220e90b72c
- Source
- HarderNarasimhan/JordanHolderFiltration/Impl.lean:489-529
Reuse this declaration
Bring the exact result into your workflow
The import identifies the source module. Your project still needs the pinned package dependency shown on this page.
What this badge means
This completion status comes from the project or community source. It has not yet been represented here as an independent rebuild and axiom audit.
Continue in this project
Related declarations
Associated Primes ker mk Linear Map eq
HarderNarasimhan.CommutativeAlgebra.associatedPrimes_ker_mkLinearMap_eq
Project documentation
Associated primes of the kernel of the localization map. This identifies the associated primes of ker (LocalizedModule.mkLinearMap S M) : Submodule R M with the associated primes of M that do meet the multiplicative set S. Equivalently, these are the associated primes of M after removing those disjoint from S. This lemma is used as the “kernel...
Source project: Harder-Narasimhan
Person-level attribution pending.
Associated Primes ker mk Linear Map subset
HarderNarasimhan.CommutativeAlgebra.associatedPrimes_ker_mkLinearMap_subset
Plain-language statement
One-sided inclusion for associated primes of the kernel of the localization map. If p ∈ associatedPrimes R (ker (mkLinearMap S M)), then p is an associated prime of M and p is not disjoint from the multiplicative set S. This is one direction of associatedPrimes_ker_mkLinearMap_eq.
Source project: Harder-Narasimhan
Person-level attribution pending.
Associated Primes localized Module subset disjoint
HarderNarasimhan.CommutativeAlgebra.associatedPrimes_localizedModule_subset_disjoint
Plain-language statement
Associated primes of a localized module are disjoint from the multiplicative set. More precisely, if p ∈ associatedPrimes R (LocalizedModule S M), then p.carrier ∩ S = ∅. This is a standard fact in commutative algebra: an element of S becomes a unit after localization, so no associated prime of the localized module can contain an element of S.
Source project: Harder-Narasimhan
Person-level attribution pending.