Zulip Chat Archive

Stream: mathlib4

Topic: Generalize/abstract geometric series


Weiyi Wang (Oct 12 2025 at 21:10):

In mathlib there is docs#geom_series_mul_neg, which is stated for NormedRing. I have a similar lemma for PowerSeries for my own use (I didn't find this in mathlib. Is it there?)

theorem PowerSeries.geom_series_mul_neg {M : Type*} [CommRing M] [TopologicalSpace M] [T2Space M]
    [IsTopologicalRing M] {x : MX} (hx : x.order  0) :
    (∑' (j : ), x ^ j) * (1 - x) = 1 := sorry

I could PR this as-is, but I wonder if there is a way to have a more abstract way to include both, and possibly more forms of geometric series?

Weiyi Wang (Oct 12 2025 at 21:12):

(btw I think the thoerem is misnamed because there isn't a "neg" in the statement)

Kenny Lau (Oct 12 2025 at 22:37):

Weiyi Wang said:

more abstract way to include both

maybe state it in terms of Int[[x]]?

Weiyi Wang (Oct 12 2025 at 22:40):

What do you mean?
I probably should clarify that "include both" means a general theorem that implies the NormedRing version and the PowerSeries version (with possibly some modification to hypothesis). Int[[X]] doesn't imply the NormedRing version, right?

Kenny Lau (Oct 13 2025 at 05:32):

well I would hope that if f and g are power series and they both converge in a normed ring (for b) then f(b) g(b) = (fg)(b)

Kenny Lau (Oct 13 2025 at 05:32):

and 1-x and 1 always converge

Weiyi Wang (Oct 13 2025 at 11:32):

I don't think there are theory of evaluating power series in normed ring in mathlib yet

Yakov Pechersky (Oct 13 2025 at 12:08):

There is, it just uses FormalMultilinearSeries

Kenny Lau (Oct 13 2025 at 12:09):

of course

Weiyi Wang (Oct 13 2025 at 12:16):

But I am doing combinatorics and I don't need to evaluate. The original question was just asking if there is a way to unify, and I am fine if the answer is "no" or "too difficult"

Weiyi Wang (Oct 13 2025 at 12:22):

Oh, I might have misread your message. Let me think a bit...

Scott Carnahan (Oct 13 2025 at 18:30):

For PowerSeries, there is docs#PowerSeries.mk_add_choose_mul_one_sub_pow_eq_one

Weiyi Wang (Oct 13 2025 at 18:32):

Yeah I am aware of that, but the one I need is substituting X with an arbitrary (x : PowerSeries R) (I haven't tried actually using the substitution lemmas for PowerSeries yet, which I will do soon)

Scott Carnahan (Oct 13 2025 at 18:46):

Sorry for missing that! You may be able to use docs#HahnSeries.SummableFamily.one_sub_self_mul_hsum_powers after some translation.

Riccardo Brasca (Oct 13 2025 at 18:49):

I am almost sure we have the substituon of one power series into another in maximal generality (even for infinitely many variables).


Last updated: Dec 20 2025 at 21:32 UTC