Zulip Chat Archive

Stream: Is there code for X?

Topic: Choose multiples outside of an ideal


Anne Baanen (Oct 18 2021 at 16:11):

I have a finite collection of nonzero elements f : ι → R and a prime, or at least non-1, ideal p. Do we have a way to find f' : ι → R such that not all f' i are in p, and a * f' i = b * f i for some a, b? Do we have this where f actually goes to the field of fractions of R?

I remember we had something along these lines. Perhaps I'm thinking docs#fractional_ideal.exists_not_mem_one_of_ne_bot does more than it actually did...

Johan Commelin (Oct 18 2021 at 16:38):

I don't recognize this

Kevin Buzzard (Oct 18 2021 at 18:01):

If ι={0,1}\iota=\{0,1\}, R=R[X,Y]R=\R[X,Y], f(0)=Xf(0)=X and f(1)=Yf(1)=Y, and p=(X,Y)p=(X,Y), then you want to find a,ba,b with abXa|bX and abYa|bY, and these imply aba|b meaning that both f(i)pf'(i)\in p.


Last updated: Dec 20 2023 at 11:08 UTC