ProximityPrize.SubmissionLower.HFree6812.tame_of_mem_closure
ProvedProximityPrize.SubmissionLower.HFree6812.tame_of_mem_closure_yukon_a9e735ad3810better-codes
Tameness passes to the subring generated by tame elements (e.g. K[t₁,…,t_r], or a
finite algebra k[π][b₁,…,b_m]).
Preamble
import Mathlib.RingTheory.Valuation.ValuationSubring
import Mathlib.RingTheory.Derivation.Basic
import Mathlib.Algebra.Polynomial.Derivative
import Mathlib.Algebra.Polynomial.Lifts
import Mathlib.Algebra.Field.Subfield.Basic
import Mathlib.RingTheory.LocalRing.ResidueField.Basic
import Mathlib.FieldTheory.Separable
import Init
import Definitions.Def_Yukon_a9a7f17ede75ca0ceb0597e1
set_option backward.isDefEq.respectTransparency.types false
namespace Polynomial
end Polynomial
namespace WithZero
end WithZero
namespace ProximityPrize.SubmissionLower.HFree6812
open WithZero Polynomial
section Bridges
variable {K L : Type*} [Field K] [Field L] [Algebra K L]
variable (v : Valuation L ℤᵐ⁰) (D : Derivation K L L)
Formal statement
/-- Tameness passes to the subring generated by tame elements (e.g. `K[t₁,…,t_r]`, or a
finite algebra `k[π][b₁,…,b_m]`). -/
theorem tame_of_mem_closure_yukon_a9e735ad3810 (Λ : ℤᵐ⁰) (S : Set L) (hS : ∀ z ∈ S, Tame v D Λ z) :
∀ z ∈ Subring.closure S, Tame v D Λ z := by sorry
end Bridges
end HFree6812
end SubmissionLower
end ProximityPrize
Source