Testwiki:Reference desk/Archives/Mathematics/2022 April 29

{| width = "100%"

|- ! colspan="3" align="center" | Mathematics desk |- ! width="20%" align="left" | < April 28 ! width="25%" align="center"|<< Mar | April | May >> ! width="20%" align="right" |Current desk > |}

Welcome to the Wikipedia Mathematics Reference Desk Archives
The page you are currently viewing is a transcluded archive page. While you can leave answers for any questions shown below, please ask new questions on one of the current reference desk pages.

April 29

Join vs Coarsest common refinement

In https://www.jstor.org/stable/2958591 (Here's a pdf http://www.ma.huji.ac.il/~raumann/pdf/Agreeing%20to%20Disagree.pdf), footnote 4 seems to say that the join of two partitions = the coarsest common refinement of those partitions. But it almost seems like the opposite? What's wrong with my reasoning?

Template:Collapse  AltoStev (talk) 14:46, 29 April 2022 (UTC)

Edit: Oh wait, R ≤ P and R ≤ Q is also almost the opposite of A ≤ J and B ≤ J. Same question though, what's wrong with my reasoning (which concludes that the join and coarsest common refinement are not the same)  AltoStev (talk) 14:52, 29 April 2022 (UTC)

For any partial order (in this case even a lattice) there is another partial order on the same set of elements which is the converse relation. So one is free to decide in any given application which direction to call "up" and which "down". Apparently, for whatever reason, the author preferred to think of "more refined" as higher, making the partition {{1},{2},{3},{4}} the top and {{1,2,3,4}} the bottom of the lattice of partitions of {1,2,3,4}. This seems to be the common convention in the field,^[1] which may all derive from Aumann's 1976 paper.  --Lambiam 18:48, 29 April 2022 (UTC)