Series of bounded x_0-degree as polynomials over the tail ring; division in Conv K (m+1) #
A series r with coeff ν r = 0 whenever ν 0 ≥ d is ∑_{j<d} (x_0-slice j of r) · x_0^j, the
slices being the coefficients of splitFirst m r (convergent when r is,
coeff_splitFirst_mem_conv); in Conv K (m+1) this reads
r = ∑_j convTail (sliceConv r j) * convX 0 ^ j (eq_sum_convTail_sliceConv). The convergent
Weierstrass division is restated for elements of Conv K (m+1) (exists_division_conv): for g
x_0-regular of order d, every f is q g + r with r of x_0-degree < d. These two facts
make Conv K (m+1) ⧸ (g) a module generated by 1, x_0, …, x_0^{d-1} over Conv K m, the step
of Rückert's basis theorem (Noetherian.lean) [GR65, Chapter II, §B].
The coefficient field K is ℝ or ℂ ([RCLike K]).
A series of x_0-degree < d is the sum of its x_0-slices times powers of x_0.
The x_0-slices of a convergent series, as elements of Conv K m
(coeff_splitFirst_mem_conv).
Equations
- Analytic.sliceConv r k = ⟨(PowerSeries.coeff k) ((Analytic.splitFirst K m) ↑r), ⋯⟩
Instances For
The convergent Weierstrass division for elements of Conv K (m+1).