Documentation

Hironaka.Resolution.Algebraic.Stage.Congr

Congruence of Lemma 102 and Theorem 103 in the dimension bound #

The constructions of Lemma 102 and Theorem 103 (Hironaka.BoundaryClearing, Hironaka.OrderReduction) read the dimension bound n ONLY through the class proofs and through the choice of the inductive input applied — never as data. So two instances of the same construction, at stages n and n' ≤ n, fed inductive inputs that AGREE on the marked triples of dimension ≤ n' − 1 (where both are evaluated), take the same value at every triple of the smaller class. This module proves the congruences on VALUES, heterogeneous in the stage (both class proofs are arguments):

theorem Hironaka.BD.bdData_congr {n n' m j : ℕ} (Dom Dom' : (k : Type u) → [inst : Field k] → [CharZero k] → MarkedTriple k → Prop) (B : (k : Type u) → [inst : Field k] → [inst_1 : CharZero k] → OrderGeSeqAssignment k (Dom k)) (B' : (k : Type u) → [inst : Field k] → [inst_1 : CharZero k] → OrderGeSeqAssignment k (Dom' k)) (hDom : ∀ (k : Type u) [inst : Field k] [inst_1 : CharZero k] (T' : MarkedTriple k), T'.HasDimLE (n - 1) → T'.m = IsLocalRing.tuningParam m → Dom k T') (hDom' : ∀ (k : Type u) [inst : Field k] [inst_1 : CharZero k] (T' : MarkedTriple k), T'.HasDimLE (n' - 1) → T'.m = IsLocalRing.tuningParam m → Dom' k T') (hB : ∀ (k : Type u) [inst : Field k] [inst_1 : CharZero k] (T' : MarkedTriple k) (hT' : Dom k T'), ((B k).endTriple T' hT').I.maxOrd < ↑T'.m) (hB' : ∀ (k : Type u) [inst : Field k] [inst_1 : CharZero k] (T' : MarkedTriple k) (hT' : Dom' k T'), ((B' k).endTriple T' hT').I.maxOrd < ↑T'.m) (hsm : ∀ (k : Type u) [inst : Field k] [inst_1 : CharZero k], (B k).CommutesWithSmooth) (hsm' : ∀ (k : Type u) [inst : Field k] [inst_1 : CharZero k], (B' k).CommutesWithSmooth) (hbc : ∀ (k L : Type u) [inst : Field k] [inst_1 : CharZero k] [inst_2 : Field L] [inst_3 : CharZero L] (σ : k →+* L), (B k).CommutesWithBaseChange (B L) σ) (hbc' : ∀ (k L : Type u) [inst : Field k] [inst_1 : CharZero k] [inst_2 : Field L] [inst_3 : CharZero L] (σ : k →+* L), (B' k).CommutesWithBaseChange (B' L) σ) (hagree : ∀ (k : Type u) [inst : Field k] [inst_1 : CharZero k] (T' : MarkedTriple k) (h₁ : Dom k T') (h₂ : Dom' k T'), T'.HasDimLE (n' - 1) → (B k).seq T' h₁ = (B' k).seq T' h₂) (k : Type u) [Field k] [CharZero k] (T : AlgebraicGeometry.Triple k) (hT : AlgebraicGeometry.Triple.BDClass n m j T) (hT' : AlgebraicGeometry.Triple.BDClass n' m j T) :
((bdData n m j Dom B hDom hB hsm hbc).functor k).seq T hT = ((bdData n' m j Dom' B' hDom' hB' hsm' hbc').functor k).seq T hT'

Congruence of the data of [Kol07, Lemma 102] in the dimension bound: bdData at stages n and n' ≤ n, from inductive inputs that agree on the marked triples of dimension ≤ n' − 1, take the same value at a triple of both classes. At mark 0 both functors are zeroFunctor (no input); at mark m + 1 both are dataFunctor, nil below the mark and at the mark rawSeq with the input evaluated ONCE, at the restricted marked triple — of dimension ≤ n' − 1 by hasDimLE_restrictedTriple at stage n'.

theorem Hironaka.BO.step21Seq_congr {k : Type u} [Field k] [CharZero k] {n n' m : ℕ} (T : AlgebraicGeometry.Triple k) (hn : T.HasDimLE n) (hn' : T.HasDimLE n') (hmax : T.I.maxOrd ≤ ↑m) (bd : (j : ℕ) → BDData n m j) (bd' : (j : ℕ) → BDData n' m j) (hbd : ∀ (j : ℕ) (T₀ : AlgebraicGeometry.Triple k) (h₁ : AlgebraicGeometry.Triple.BDClass n m j T₀) (h₂ : AlgebraicGeometry.Triple.BDClass n' m j T₀), ((bd j).functor k).seq T₀ h₁ = ((bd' j).functor k).seq T₀ h₂) (j : ℕ) :
step21Seq T hn hmax bd j = step21Seq T hn' hmax bd' j

Congruence of Step 2.1 of [Kol07, 104] in the dimension bound: the Step 2.1 states at stages n and n' ≤ n, from Lemma 102 data that agree pointwise on the triples of both classes, coincide (as carried sequences) — by induction on the number of rounds: the round at a position of E is the datum's value at the induced triple, equal by hbd; beyond the last position both states are unchanged.

theorem Hironaka.BO.step22Functor_congr {k : Type u} [Field k] [CharZero k] {n n' : ℕ} (bd : (m j : ℕ) → BDData n m j) (bd' : (m j : ℕ) → BDData n' m j) (hbd : ∀ (m j : ℕ) (T₀ : AlgebraicGeometry.Triple k) (h₁ : AlgebraicGeometry.Triple.BDClass n m j T₀) (h₂ : AlgebraicGeometry.Triple.BDClass n' m j T₀), ((bd m j).functor k).seq T₀ h₁ = ((bd' m j).functor k).seq T₀ h₂) (m j : ℕ) (hm : 1 ≤ m) (T₀ : AlgebraicGeometry.Triple k) (hT₀ : AlgebraicGeometry.Triple.BDClass n m j T₀) (hT₀' : AlgebraicGeometry.Triple.BDClass n' m j T₀) :
(step22Functor bd m j hm).seq T₀ hT₀ = (step22Functor bd' m j hm).seq T₀ hT₀'

Congruence of Step 2.2 of [Kol07, 104] in the dimension bound: the re-tuned Lemma 102 (step22Functor) at stages n and n' ≤ n takes the same value at a triple of both classes — at the mark both are the datum at s(m) on the tuned triple (hbd), below it both are nil.

theorem Hironaka.BO.step2Seq_congr_aux {k : Type u} [Field k] [CharZero k] {n n' : ℕ} (bd : (m j : ℕ) → BDData n m j) (bd' : (m j : ℕ) → BDData n' m j) (hbd : ∀ (m j : ℕ) (T₀ : AlgebraicGeometry.Triple k) (h₁ : AlgebraicGeometry.Triple.BDClass n m j T₀) (h₂ : AlgebraicGeometry.Triple.BDClass n' m j T₀), ((bd m j).functor k).seq T₀ h₁ = ((bd' m j).functor k).seq T₀ h₂) {m : ℕ} (T : AlgebraicGeometry.Triple k) (hn : T.HasDimLE n) (hmax : T.I.maxOrd ≤ ↑m) (hm : 1 ≤ m) {H : T.X.left.IdealSheafData} (hH : AlgebraicGeometry.IsSmoothDivisor H) (hle : AlgebraicGeometry.Scheme.IdealSheafData.IsMaximalContact (T.X.left ↘ AlgebraicGeometry.Spec ↧k) T.I m H) (S₂ : T.X.left.BlowUpSequence) (hS₂ : S₂.IsOrderSeq (T.X.left ↘ AlgebraicGeometry.Spec ↧k) T.I T.E m) (e₁ : S₂ = ↑(step21Seq T hn hmax (bd m) (Fintype.card T.E.ι))) (hsnc₂ : ((S₂.exceptionalFamily T.E).append (S₂.strictTransformSeq H (Fin.last S₂.length))).IsSnc) (j' : ℕ) (hj' : j' = Fintype.card (S₂.exceptionalFamily T.E).ι) (hT₂' : AlgebraicGeometry.Triple.BDClass n' m j' (step22TripleOfSeq T S₂ hS₂ hsnc₂)) :
S₂.concat ((step22Functor bd' m j' hm).seq (step22TripleOfSeq T S₂ hS₂ hsnc₂) hT₂') = step2Seq T hn hmax bd hm hH hle

Step 2 at stage n', generalised over its Step 2.1 sequence S₂ with S₂ equal to the Step 2.1 sequence at stage n (the dependent Step 2.2 input triple is handled by this generalisation): it is Step 2 at stage n.

theorem Hironaka.BO.step2Seq_congr {k : Type u} [Field k] [CharZero k] {n n' : ℕ} (bd : (m j : ℕ) → BDData n m j) (bd' : (m j : ℕ) → BDData n' m j) (hbd : ∀ (m j : ℕ) (T₀ : AlgebraicGeometry.Triple k) (h₁ : AlgebraicGeometry.Triple.BDClass n m j T₀) (h₂ : AlgebraicGeometry.Triple.BDClass n' m j T₀), ((bd m j).functor k).seq T₀ h₁ = ((bd' m j).functor k).seq T₀ h₂) {m : ℕ} (T : AlgebraicGeometry.Triple k) (hn : T.HasDimLE n) (hmax : T.I.maxOrd ≤ ↑m) (hm : 1 ≤ m) {H : T.X.left.IdealSheafData} (hH : AlgebraicGeometry.IsSmoothDivisor H) (hle : AlgebraicGeometry.Scheme.IdealSheafData.IsMaximalContact (T.X.left ↘ AlgebraicGeometry.Spec ↧k) T.I m H) (hn' : T.HasDimLE n') :
step2Seq T hn hmax bd hm hH hle = step2Seq T hn' hmax bd' hm hH hle

Congruence of Step 2 of the proof of [Kol07, Theorem 103] in the dimension bound: Step 2 for a smooth hypersurface of maximal contact, at stages n and n' ≤ n with pointwise agreeing Lemma 102 data, coincide — Step 2.1 by step21Seq_congr, Step 2.2 on the (then equal) input triple by step22Functor_congr.

theorem Hironaka.BO.maxContactCase_congr {k : Type u} [Field k] [CharZero k] {n n' : ℕ} (bd : (m j : ℕ) → BDData n m j) (bd' : (m j : ℕ) → BDData n' m j) (hbd : ∀ (m j : ℕ) (T₀ : AlgebraicGeometry.Triple k) (h₁ : AlgebraicGeometry.Triple.BDClass n m j T₀) (h₂ : AlgebraicGeometry.Triple.BDClass n' m j T₀), ((bd m j).functor k).seq T₀ h₁ = ((bd' m j).functor k).seq T₀ h₂) {m : ℕ} (T : AlgebraicGeometry.Triple k) {H : T.X.left.IdealSheafData} (hH : AlgebraicGeometry.IsSmoothDivisor H) (hle : AlgebraicGeometry.Scheme.IdealSheafData.IsMaximalContact (T.X.left ↘ AlgebraicGeometry.Spec ↧k) T.I m H) (hT : AlgebraicGeometry.Triple.BOClass n m T) (hT' : AlgebraicGeometry.Triple.BOClass n' m T) :
maxContactCase T hT hH hle bd = maxContactCase T hT' hH hle bd'

Congruence of Steps 1–2 of the proof of [Kol07, Theorem 103] in the dimension bound: the maximal-contact case BO^H_{n,m} at stages n and n' ≤ n, with pointwise agreeing Lemma 102 data, coincide — at the mark by step2Seq_congr on the tuned triple, below it both are nil.

theorem Hironaka.BO.functor_congr {k : Type u} [Field k] [CharZero k] {n n' : ℕ} (m : ℕ) (bd : (m j : ℕ) → BDData n m j) (bd' : (m j : ℕ) → BDData n' m j) (hbd : ∀ (m j : ℕ) (T₀ : AlgebraicGeometry.Triple k) (h₁ : AlgebraicGeometry.Triple.BDClass n m j T₀) (h₂ : AlgebraicGeometry.Triple.BDClass n' m j T₀), ((bd m j).functor k).seq T₀ h₁ = ((bd' m j).functor k).seq T₀ h₂) (hle : n' ≤ n) (T : AlgebraicGeometry.Triple k) (hT : AlgebraicGeometry.Triple.BOClass n m T) (hT' : AlgebraicGeometry.Triple.BOClass n' m T) :
(functor n m bd).seq T hT = (functor n' m bd').seq T hT'

Congruence of the functor of [Kol07, Theorem 103] in the dimension bound (Step 3 of its proof and the uniqueness of [Kol07, Theorem 105]): BO_{n,m} and BO_{n',m} (n' ≤ n), from pointwise agreeing Lemma 102 data, take the same value at a triple of the smaller class. The stage-n functor restricted to BOClass n' m agrees with the stage-n' LOCAL functor on the local triples (functor_seq_localClass at stage n through boClass_mono, localFunctor_seq, maxContactCase_congr) and commutes with surjective open-immersion coproducts (functor_commutesWithSmoothSurjections, restricted), as does the stage-n' functor; globalization_unique at the stage-n' classes identifies the two functors. globalize is never unfolded.

theorem Hironaka.BO.data_congr {n n' m : ℕ} (hle : n' ≤ n) (Dom Dom' : (k : Type u) → [inst : Field k] → [CharZero k] → MarkedTriple k → Prop) (B : (k : Type u) → [inst : Field k] → [inst_1 : CharZero k] → OrderGeSeqAssignment k (Dom k)) (B' : (k : Type u) → [inst : Field k] → [inst_1 : CharZero k] → OrderGeSeqAssignment k (Dom' k)) (hDom : ∀ (m : ℕ) (k : Type u) [inst : Field k] [inst_1 : CharZero k] (T' : MarkedTriple k), T'.HasDimLE (n - 1) → T'.m = IsLocalRing.tuningParam m → Dom k T') (hDom' : ∀ (m : ℕ) (k : Type u) [inst : Field k] [inst_1 : CharZero k] (T' : MarkedTriple k), T'.HasDimLE (n' - 1) → T'.m = IsLocalRing.tuningParam m → Dom' k T') (hB : ∀ (k : Type u) [inst : Field k] [inst_1 : CharZero k] (T' : MarkedTriple k) (hT' : Dom k T'), ((B k).endTriple T' hT').I.maxOrd < ↑T'.m) (hB' : ∀ (k : Type u) [inst : Field k] [inst_1 : CharZero k] (T' : MarkedTriple k) (hT' : Dom' k T'), ((B' k).endTriple T' hT').I.maxOrd < ↑T'.m) (hsm : ∀ (k : Type u) [inst : Field k] [inst_1 : CharZero k], (B k).CommutesWithSmooth) (hsm' : ∀ (k : Type u) [inst : Field k] [inst_1 : CharZero k], (B' k).CommutesWithSmooth) (hbc : ∀ (k L : Type u) [inst : Field k] [inst_1 : CharZero k] [inst_2 : Field L] [inst_3 : CharZero L] (σ : k →+* L), (B k).CommutesWithBaseChange (B L) σ) (hbc' : ∀ (k L : Type u) [inst : Field k] [inst_1 : CharZero k] [inst_2 : Field L] [inst_3 : CharZero L] (σ : k →+* L), (B' k).CommutesWithBaseChange (B' L) σ) (hBind : ∀ (k : Type u) [inst : Field k] [inst_1 : CharZero k], (B k).IndifferentToEmptyMembers) (hBind' : ∀ (k : Type u) [inst : Field k] [inst_1 : CharZero k], (B' k).IndifferentToEmptyMembers) (hagree : ∀ (k : Type u) [inst : Field k] [inst_1 : CharZero k] (T' : MarkedTriple k) (h₁ : Dom k T') (h₂ : Dom' k T'), T'.HasDimLE (n' - 1) → (B k).seq T' h₁ = (B' k).seq T' h₂) (k : Type u) [Field k] [CharZero k] (T : AlgebraicGeometry.Triple k) (hT : AlgebraicGeometry.Triple.BOClass n m T) (hT' : AlgebraicGeometry.Triple.BOClass n' m T) :
((data n m Dom B hDom hB hsm hbc hBind).functor k).seq T hT = ((data n' m Dom' B' hDom' hB' hsm' hbc' hBind').functor k).seq T hT'

Congruence of [Kol07, Theorem 103] as data (BO.data) in the dimension bound: at stages n and n' ≤ n, from inductive inputs that agree on the marked triples of dimension ≤ n' − 1, it takes the same value at a triple of both classes — functor_congr at bdData, whose congruence is bdData_congr.