Skip to main content
Mathematics

Return to Question

Notice removed Reward existing answer by Noah Schweber
Bounty Ended with Andreas Blass's answer chosen by Noah Schweber
Notice added Reward existing answer by Noah Schweber
Bounty Started worth 200 reputation by Noah Schweber
add quantificaiton over x, improve spacing in formula
Source Link
edit approved Oct 22, 2016 at 11:07
Alexey
edit approved Oct 22, 2016 at 11:07
Alexey
  • 2.7k
  • 17
  • 32

A lattice $(L,\leq)$ is said to be modular when $$(\forall a,b\in L) x \leq b \implies x \vee (a \wedge b) = (x \vee a) \wedge b,$$ where $$ (\forall x,a,b\in L)\quad x \leq b \implies x \vee (a \wedge b) = (x \vee a) \wedge b, $$ where $\vee$ is the join operation, and $\wedge$ is the meet operation. (Join and meet.)

The ideals of a ring form a modular lattice. So do submodules of a module. These facts are easy to prove, but I have never seen any striking examples of their utility. Actually, in a seminar I took part in, the speaker said the modularity condition wasn't very natural and that there was an ongoing search for better ones (this was in the context of the Gabriel dimension and its generalization to lattices -- unfortunately, I didn't understand much of that).

I would like to see some motivation for this notion. That is, I would like to know when it is useful, and if it is natural. At the moment, it doesn't look any more natural to me than any random condition in the language of lattices. If you could shed some light on the opinion I quote in the previous paragraph, it would be very helpful as well. I would be especially interested in algebraic motivation, as I know very little about other areas if mathematics.

A lattice $(L,\leq)$ is said to be modular when $$(\forall a,b\in L) x \leq b \implies x \vee (a \wedge b) = (x \vee a) \wedge b,$$ where $\vee$ is the join operation, and $\wedge$ is the meet operation. (Join and meet.)

The ideals of a ring form a modular lattice. So do submodules of a module. These facts are easy to prove, but I have never seen any striking examples of their utility. Actually, in a seminar I took part in, the speaker said the modularity condition wasn't very natural and that there was an ongoing search for better ones (this was in the context of the Gabriel dimension and its generalization to lattices -- unfortunately, I didn't understand much of that).

I would like to see some motivation for this notion. That is, I would like to know when it is useful, and if it is natural. At the moment, it doesn't look any more natural to me than any random condition in the language of lattices. If you could shed some light on the opinion I quote in the previous paragraph, it would be very helpful as well. I would be especially interested in algebraic motivation, as I know very little about other areas if mathematics.

A lattice $(L,\leq)$ is said to be modular when $$ (\forall x,a,b\in L)\quad x \leq b \implies x \vee (a \wedge b) = (x \vee a) \wedge b, $$ where $\vee$ is the join operation, and $\wedge$ is the meet operation. (Join and meet.)

The ideals of a ring form a modular lattice. So do submodules of a module. These facts are easy to prove, but I have never seen any striking examples of their utility. Actually, in a seminar I took part in, the speaker said the modularity condition wasn't very natural and that there was an ongoing search for better ones (this was in the context of the Gabriel dimension and its generalization to lattices -- unfortunately, I didn't understand much of that).

I would like to see some motivation for this notion. That is, I would like to know when it is useful, and if it is natural. At the moment, it doesn't look any more natural to me than any random condition in the language of lattices. If you could shed some light on the opinion I quote in the previous paragraph, it would be very helpful as well. I would be especially interested in algebraic motivation, as I know very little about other areas if mathematics.

Notice removed Improve details by user23211
Bounty Ended with rschwieb's answer chosen by CommunityBot
Tweeted twitter.com/#!/StackMath/status/200544435753332737
Notice added Improve details by user23211
Bounty Started worth 150 reputation by CommunityBot
definition added
Source Link
user23211
user23211

A lattice $(L,\leq)$ is said to be modular when $$(\forall a,b\in L) x \leq b \implies x \vee (a \wedge b) = (x \vee a) \wedge b,$$ where $\vee$ is the join operation, and $\wedge$ is the meet operation. (Join and meet.)

The ideals of a ring form a modular lattice. So do submodules of a module. These facts are easy to prove, but I have never seen any striking examples of their utility. Actually, in a seminar I took part in, the speaker said the modularity condition wasn't very natural and that there was an ongoing search for better ones (this was in the context of the Gabriel dimension and its generalization to lattices -- unfortunately, I didn't understand much of that).

I would like to see some motivation for this notion. That is, I would like to know when it is useful, and if it is natural. At the moment, it doesn't look any more natural to me than any random condition in the language of lattices. If you could shed some light on the opinion I quote in the previous paragraph, it would be very helpful as well. I would be especially interested in algebraic motivation, as I know very little about other areas if mathematics.

The ideals of a ring form a modular lattice. So do submodules of a module. These facts are easy to prove, but I have never seen any striking examples of their utility. Actually, in a seminar I took part in, the speaker said the modularity condition wasn't very natural and that there was an ongoing search for better ones (this was in the context of the Gabriel dimension and its generalization to lattices -- unfortunately, I didn't understand much of that).

I would like to see some motivation for this notion. That is, I would like to know when it is useful, and if it is natural. At the moment, it doesn't look any more natural to me than any random condition in the language of lattices. If you could shed some light on the opinion I quote in the previous paragraph, it would be very helpful as well. I would be especially interested in algebraic motivation, as I know very little about other areas if mathematics.

A lattice $(L,\leq)$ is said to be modular when $$(\forall a,b\in L) x \leq b \implies x \vee (a \wedge b) = (x \vee a) \wedge b,$$ where $\vee$ is the join operation, and $\wedge$ is the meet operation. (Join and meet.)

The ideals of a ring form a modular lattice. So do submodules of a module. These facts are easy to prove, but I have never seen any striking examples of their utility. Actually, in a seminar I took part in, the speaker said the modularity condition wasn't very natural and that there was an ongoing search for better ones (this was in the context of the Gabriel dimension and its generalization to lattices -- unfortunately, I didn't understand much of that).

I would like to see some motivation for this notion. That is, I would like to know when it is useful, and if it is natural. At the moment, it doesn't look any more natural to me than any random condition in the language of lattices. If you could shed some light on the opinion I quote in the previous paragraph, it would be very helpful as well. I would be especially interested in algebraic motivation, as I know very little about other areas if mathematics.

edited tags
Source Link
user23211
user23211

The ideals of a ring form a modular lattice. So do submodules of a module. These facts are easy to prove, but I have never seen any striking examples of their utility. Actually, in a seminar I took part in, the speaker said the modularity condition wasn't very natural and that there iswas an ongoing search for better ones (this was in the context of the Gabriel dimension and its generalization to lattices -- unfortunately, I didn't understand much of that).

I would like to see some motivation for this notion. That is, I would like to know when it is useful, and if it is natural. At the moment, it doesn't look any more natural to me than any random condition in the language of lattices. If you could shed some light on the opinion I quote in the previous paragraph, it would be very helpful as well. I would be especially interested in algebraic motivation, as I know very little about other areas if mathematics.

The ideals of a ring form a modular lattice. So do submodules of a module. These facts are easy to prove, but I have never seen any striking examples of their utility. Actually, in a seminar I took part in, the speaker said the modularity condition wasn't very natural and there is an ongoing search for better ones (this was in the context of the Gabriel dimension and its generalization to lattices -- unfortunately, I didn't understand much of that).

I would like to see some motivation for this notion. That is, I would like to know when it is useful, and if it is natural. At the moment, it doesn't look any more natural to me than any random condition in the language of lattices. If you could shed some light on the opinion I quote in the previous paragraph, it would be very helpful as well. I would be especially interested in algebraic motivation, as I know very little about other areas if mathematics.

The ideals of a ring form a modular lattice. So do submodules of a module. These facts are easy to prove, but I have never seen any striking examples of their utility. Actually, in a seminar I took part in, the speaker said the modularity condition wasn't very natural and that there was an ongoing search for better ones (this was in the context of the Gabriel dimension and its generalization to lattices -- unfortunately, I didn't understand much of that).

I would like to see some motivation for this notion. That is, I would like to know when it is useful, and if it is natural. At the moment, it doesn't look any more natural to me than any random condition in the language of lattices. If you could shed some light on the opinion I quote in the previous paragraph, it would be very helpful as well. I would be especially interested in algebraic motivation, as I know very little about other areas if mathematics.

Source Link
user23211
user23211