Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Definitions of TypeDensity.Surfaces.PowerSeries

Definition
TypeDensity_Surfaces_PowerSeries

by asving · Oct 16, 2026 · Mathlib 0df444a (Lean v4.33.1)

type-density

Power series, residue bases and the local structure of concrete surfaces

Commutative algebra of the power series rings A[[T,X]] and k[[X]] used to analyse the concrete surfaces O[[T,X]]/(π - u T^a X^b) over a discrete valuation ring O with residue field k: the ideal (T, X) and regular elements of A[[T,X]], kernels of the reduction maps, lengths of quotients of k[[X]], residue basis families (bases modulo π lifting to bases), and the local structure of the concrete surface (maximal ideal (t, x), residue field, special fiber).

Main results

  • mvPowerSeries_fin_two_mem_variableIdeal_iff, mvPowerSeries_fin_two_quotient_var_regular_mod_var: the ideal (T, X) and regular sequences in A[[T,X]].
  • powerSeries_quotient_length_eq_order: ℓ(k[[X]]/(g)) = ord g.
  • residue_basis_family_of_length, residue_basis_family_basis: residue basis families.
  • concrete_surface_special_fiber_equiv, concrete_surface_maximalIdeal_eq, concrete_surface_isLocalRing, concrete_surface_base_injective: structure of the concrete surface.

Provenance: the Thm_SurfaceBlowupV2_* nodes named after the theorems of this file.

Definition code
-- Generated by the TypeDensity exporter from TypeDensity/Surfaces/PowerSeries.lean (namespace TypeDensity); do not edit.
import Definitions.Def_TypeDensity_Basic
import Definitions.Def_TypeDensity_Formula_LawAlgebra
import Definitions.Def_TypeDensity_Measure_AdicCylinders
import Definitions.Def_TypeDensity_Measure_HenselProducts
import Definitions.Def_TypeDensity_Surfaces_Lengths
import Mathlib.FieldTheory.RatFunc.Basic
import Mathlib.MeasureTheory.Measure.Haar.Unique
import Mathlib.NumberTheory.ArithmeticFunction.Moebius
import Mathlib.NumberTheory.Padics.PadicIntegers
import Mathlib.RingTheory.IntegralClosure.IntegralRestrict
import Mathlib.RingTheory.MvPowerSeries.Basic
import Mathlib.RingTheory.RamificationInertia.Basic
import Mathlib.Topology.Algebra.Nonarchimedean.AdicTopology
import Mathlib.FieldTheory.Finite.GaloisField
import Mathlib.RingTheory.AdicCompletion.Algebra
import Mathlib.RingTheory.RegularLocalRing.Defs
import Mathlib.Topology.Algebra.MvPolynomial
import Mathlib.Algebra.Group.Pi.Units
import Mathlib.Order.CompletePartialOrder
import Mathlib.RingTheory.Henselian
import Mathlib.RingTheory.Polynomial.Resultant.Basic
import Mathlib.RingTheory.SimpleRing.Principal
import Mathlib.FieldTheory.Finite.Extension
import Mathlib.RingTheory.AdicCompletion.Noetherian
import Mathlib.RingTheory.MvPowerSeries.Equiv
import Mathlib.RingTheory.PicardGroup
set_option autoImplicit false

noncomputable section

namespace TypeDensity

/-- A series lies in `(T^a X^b)` iff its coefficients vanish outside the quadrant
`a ≤ m 0, b ≤ m 1`. -/
theorem monomialIdeal_mem_iff (k : Type) [CommRing k] (a b : ℕ) (φ : TwoSeries k) :
    φ ∈ monomialIdeal k a b ↔ ∀ m : Fin 2 →₀ ℕ, ¬(a ≤ m 0 ∧ b ≤ m 1) →
    MvPowerSeries.coeff m φ = 0 := by
  set n₀ : Fin 2 →₀ ℕ := Finsupp.single 0 a + Finsupp.single 1 b with hn₀
  have hgen : axisT k ^ a * axisX k ^ b = MvPowerSeries.monomial n₀ (1 : k) := by
    simp only [axisT, axisX, MvPowerSeries.X_pow_eq, MvPowerSeries.monomial_mul_monomial, one_mul,
      hn₀]
  have hle : ∀ m : Fin 2 →₀ ℕ, n₀ ≤ m ↔ (a ≤ m 0 ∧ b ≤ m 1) := by
    intro m
    rw [Finsupp.le_def, Fin.forall_fin_two]
    simp [hn₀]
  unfold monomialIdeal
  rw [hgen, Ideal.mem_span_singleton]
  constructor
  · rintro ⟨ψ, rfl⟩ m hm
    rw [MvPowerSeries.coeff_monomial_mul, if_neg (by rwa [hle])]
  · intro h
    obtain ⟨ψ, hψ⟩ : ∃ ψ : MvPowerSeries (Fin 2) k,
        ∀ m, MvPowerSeries.coeff m ψ = MvPowerSeries.coeff (m + n₀) φ :=
      ⟨fun m ↦ MvPowerSeries.coeff (m + n₀) φ, fun m ↦ rfl⟩
    refine ⟨ψ, ?_⟩
    ext m
    rw [MvPowerSeries.coeff_monomial_mul, one_mul]
    split_ifs with hm
    · rw [hψ, tsub_add_cancel_of_le hm]
    · exact h m (by rwa [hle] at hm)

/-- A two-variable series lies in `(X 0, X 1)` iff its constant coefficient vanishes. -/
theorem mvPowerSeries_fin_two_mem_variableIdeal_iff (A : Type) [CommRing A]
    (g : MvPowerSeries (Fin 2) A) :
    g ∈ Ideal.span {(MvPowerSeries.X 0 : MvPowerSeries (Fin 2) A), MvPowerSeries.X 1} ↔
    MvPowerSeries.constantCoeff g = 0 := by
  refine (pow_one (Ideal.span {axisT A, axisX A}) ▸ axis_ideal_pow_mem_iff A 1 g).trans
    ⟨fun h ↦ h 0 (by simp), fun h m hm ↦ ?_⟩
  obtain rfl : m = 0 := by ext i; fin_cases i <;> simp <;> omega
  exact h

/-- The point-count expression evaluates to `(1/δ) ∑_{j ∣ δ} μ(j) q^(δ/j)`. -/
theorem pointCount_eval (δ : ℕ) (q : ℚ) :
    (pointCount δ).eval q = (1/(δ:ℚ)) * ∑ j ∈ δ.divisors, ((ArithmeticFunction.moebius j : ℤ) : ℚ) *
    q ^ (δ / j) := by
  unfold pointCount
  rw [Expr.eval, Expr.eval, expression_sum_eval, List.map_map]
  congr 1
  rw [← Finset.sum_map_toList]
  congr 1
  apply List.map_congr_left
  intro j _
  simp [Expr.eval, expression_pow_eval]

end TypeDensity

end

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me