Zulip Chat Archive
Stream: maths
Topic: linearly independent sets are smaller than bases?
Scott Morrison (May 31 2021 at 06:29):
I have a reverse mathematics question for the algebraists:
What are the weakest conditions on a ring
R
so that any linearly independent set in anR
-moduleM
has cardinality bounded by any basis forM
?
Currently in mathlib we just have this for division_ring
(maybe that is even still in the #queue, and we only have it for fields?)
If you have a _finite_ basis, then any ring satisfying the strong rank condition has this property (proof: build a linear map R^i to R^b by taking coordinates of each element of the linearly independent set, show this is injective because the set is independent, and then by definition of the strong rank condition i <= b) (EDIT: you need a tiny bit of extra work to show the linearly independent set must be finite, by showing any finite subset of it has bounded cardinality, before you can actually apply the strong rank condition).
As a consequence, this is true (for finite bases) for any left-noetherian ring and any commutative ring.
But what is true in the infinite case? I have no idea.
(Relatedly, I've already got the proof that any basis has cardinality bounded by any spanning set, as soon as the ring satisfies the rank condition; so including all left-noetherian and all commutative rings, without any finiteness assumptions.)
Anne Baanen (May 31 2021 at 08:49):
An upper bound is that R
is an integral domain, for finite bases: docs#basis.card_le_card_of_linear_independent
Anne Baanen (May 31 2021 at 08:51):
Through ordinal induction, you can extend that to infinite bases too.
Scott Morrison (May 31 2021 at 08:55):
So for finite bases I've already extended it way beyond integral domains: all commutative rings and all left-noetherian rings.
Scott Morrison (May 31 2021 at 08:55):
Can you explain what the ordinal induction argument is? I don't see what to do.
Anne Baanen (May 31 2021 at 09:00):
Looking for a source right now...
Anne Baanen (May 31 2021 at 09:10):
Can't find it in Lang or Dummit & Foote, but did find another way to do it: show that the rank of the R
-module M
agrees with the dimension (over Frac(R)
) of M \otimes_R Frac(R)
, then use what we already have for division ring. My reference to "ordinal induction" is basically this but with the fractions inlined in the division ring proof.
Anne Baanen (May 31 2021 at 09:15):
See also this mathoverflow link with a good reference: https://mathoverflow.net/a/30369
Scott Morrison (May 31 2021 at 09:47):
@Anne Baanen, this argument is for arbitrary commutative rings, right?
Anne Baanen (May 31 2021 at 09:50):
I'm not so familiar with linear independence when there are zero divisors, so I can't say.
Scott Morrison (May 31 2021 at 09:51):
The paper that MO answer references is online at http://www.numdam.org/article/PSMIR_1973___4_A4_0.pdf.
Scott Morrison (May 31 2021 at 09:53):
My french is terrible, but I think it says A
is any unital commutative ring (bottom of p.1), and has the claim that in an infinite free module, every maximal independent set has the same cardinality on p.4, as Section 2.1.
Anne Baanen (May 31 2021 at 10:12):
Yes, my rusty French agrees.
Scott Morrison (May 31 2021 at 10:12):
Nice! Although he assumes he has a commutative ring, the argument actually only uses the strong rank condition.
Scott Morrison (May 31 2021 at 10:13):
Thanks very much for finding this, it's precisely what I wanted.
Yaël Dillies (May 31 2021 at 11:16):
Bottom of page 1 says: We'll assume A commutative and unital. Recall that every basis of a free module M have the same cardinal.
Section 2.1 says: If M is an infinite dimensional free A-module, then all maximal independent sets have the same cardinal.
Tell me if you need more translation :smile:
Scott Morrison (May 31 2021 at 11:41):
No, it's okay, I can read the proof myself, and I've written the four Lean statements corresponding to the steps. Maybe I'll prove them another day, though. :-)
Scott Morrison (May 31 2021 at 11:43):
I couldn't speak a word of intelligible French to save my life, but reading mathematical French is a fun puzzle. You get vague hints about the next step of the proof, work out what it has to be, then finish the translation based on the maths, then repeat on the next sentence.
Sebastien Gouezel (May 31 2021 at 11:46):
If you're stuck at some point, don't hesitate to ask here. Plenty of people could write a blueprint for you :-)
Last updated: Dec 20 2023 at 11:08 UTC