Documentation

Hironaka.Resolution.Algebraic.OrderReduction.Step22Assembly

Step 2 of order reduction: the assembled sequence and the maximal-contact case #

Steps 1 and 2 of the proof of [Kol07, Theorem 103]: on a triple with a smooth hypersurface of maximal contact, BO_{n,m}(X, I, E) is Step 2.1 followed by Step 2.2 on the tuned ideal W_{s(m)}(I), and the empty sequence when max-ord I < m.

These are the fields of the local functor of Step 3 (Hironaka/Resolution/Algebraic/OrderReduction/Step3Globalization.lean).

theorem Hironaka.BO.step2Seq_eq {k : Type u} [Field k] [CharZero k] {n m : ℕ} (T : AlgebraicGeometry.Triple k) (hn : T.HasDimLE n) (hmax : T.I.maxOrd ≤ ↑m) (bd : (m j : ℕ) → BDData n m j) (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) :
step2Seq T hn hmax bd hm hH hle = (↑(step21Seq T hn hmax (bd m) (Fintype.card T.E.ι))).concat (step22 T hn hmax bd hm hH hle)

Step 2 is Step 2.1 followed by Step 2.2 (definitional).

theorem Hironaka.BO.isOrderSeq_step2Seq {k : Type u} [Field k] [CharZero k] {n m : ℕ} (T : AlgebraicGeometry.Triple k) (hn : T.HasDimLE n) (hmax : T.I.maxOrd ≤ ↑m) (bd : (m j : ℕ) → BDData n m j) (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) :
(step2Seq T hn hmax bd hm hH hle).IsOrderSeq (T.X.left ↘ AlgebraicGeometry.Spec ↧k) T.I T.E m

Step 2 is a smooth blow-up sequence of order m starting with (X, I, E) (Step 2 of the proof of [Kol07, Theorem 103]): isOrderSeq_concat, Step 2.2 being an order-m sequence for the original boundary E_r.

theorem Hironaka.BO.noEmptyCenters_step2Seq {k : Type u} [Field k] [CharZero k] {n m : ℕ} (T : AlgebraicGeometry.Triple k) (hn : T.HasDimLE n) (hmax : T.I.maxOrd ≤ ↑m) (bd : (m j : ℕ) → BDData n m j) (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) :
(step2Seq T hn hmax bd hm hH hle).NoEmptyCenters

Step 2 has no empty blow-up ([Kol07, 32]).

theorem Hironaka.BO.maxOrd_step2Seq_lt {k : Type u} [Field k] [CharZero k] {n m : ℕ} (T : AlgebraicGeometry.Triple k) (hn : T.HasDimLE n) (hmax : T.I.maxOrd ≤ ↑m) (bd : (m j : ℕ) → BDData n m j) (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) :
((step2Seq T hn hmax bd hm hH hle).weakTransformSeq T.I (Fin.last (step2Seq T hn hmax bd hm hH hle).length)).maxOrd < ↑m

The final ideal of Step 2 has max-ord < m (clause (1) of [Kol07, Theorem 103] for Step 2): it is the final ideal of Step 2.2 up to the identification of the last stages.

theorem Hironaka.BO.eraseEmpty_step2Seq {k : Type u} [Field k] [CharZero k] {n m : ℕ} (T : AlgebraicGeometry.Triple k) (hn : T.HasDimLE n) (hmax : T.I.maxOrd ≤ ↑m) (bd : (m j : ℕ) → BDData n m j) (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) :
(step2Seq T hn hmax bd hm hH hle).eraseEmpty = step2Seq T hn hmax bd hm hH hle

Deleting the empty blow-ups of Step 2 changes nothing: there are none ([Kol07, 32]).

theorem Hironaka.BO.maxContactCase_of_maxOrd_eq {k : Type u} [Field k] [CharZero k] {n m : ℕ} (T : AlgebraicGeometry.Triple k) (hT : AlgebraicGeometry.Triple.BOClass n m T) {H : T.X.left.IdealSheafData} (hH : AlgebraicGeometry.IsSmoothDivisor H) (hle : AlgebraicGeometry.Scheme.IdealSheafData.IsMaximalContact (T.X.left ↘ AlgebraicGeometry.Spec ↧k) T.I m H) (bd : (m j : ℕ) → BDData n m j) (h : T.I.maxOrd = ↑m) :
maxContactCase T hT hH hle bd = step2Seq (T.tuned m ⋯) ⋯ ⋯ bd ⋯ hH ⋯

At the mark, BO^H_{n,m}(X, I, E) is Step 2 on the tuned triple (X, W_{s(m)}(I), E) at the mark s(m), with H kept (retune_keeps_maxContact): Step 1 of the proof of [Kol07, Theorem 103].

Below the mark, BO^H_{n,m}(X, I, E) is the empty sequence (the remark after [Kol07, Theorem 68]).

BO^H_{n,m}(X, I, E) is a smooth blow-up sequence of order m starting with (X, I, E): Step 2 on the tuned triple, read back through Hironaka.BD.isOrderSeq_iff_tuned ([Kol07, Corollary 101]), or the empty sequence.

max-ord I_r < m at the end of BO^H_{n,m}(X, I, E) (clause (1) of [Kol07, Theorem 103]): Step 2's max-ord < s(m) for the tuned ideal read back through maxOrd_weakTransformSeq_lt_iff_tuned; below the mark, max-ord I < m itself.

Deleting the empty blow-ups of BO^H_{n,m}(X, I, E) changes nothing: there are none ([Kol07, 32]).