Has effective (co)congruences properties#126
Conversation
|
Current status: For "has effective congruences" there are two unresolved cases left: (For the second, I think I might be able to adapt the proof of extensive + has effective congruences -> balanced, by considering For "has effective cocongruences" there are still 21 unresolved cases. Among them are Group and Ring which are blockers. |
|
I am not surprised that deciding effective cocongruences for concrete categories is so hard. This amounts to a classification of all cocongruences, and this is hard, as we already saw in Rel for example, but also Set is a good starting point, where it is not trivial. Often we do not even understand all epimorphisms. I suggest that in this PR we only try to fill the remaining cases where it is required by the unit tests (Grp and Ring). EDIT. I am pretty confident that for Grp the answer is yes, cocongruences are effective. |
|
Heh, ended up coming back to #114 and also using it to prove elementary topoi have effective cocongruences. |
|
Suggestion. The implication "lsfp → effective congruences" can be refined by "multi-algebraic → effective congruences". Note that the database already includes the implication "lsfp → multi-algebraic". The reference is Thm. 4.0 in Diers's paper (fr) or it's English translation. |
Do you have any ideas on how we might prove that? So far, I haven't made much progress even on the simplest case I can think of, proving that a cocongruence on |
|
On Ring I was wondering if the counterexample in CommRing could be adapted there. If I trace through the proofs, I guess the counterexample in CommRing is something like Any other ideas on Ring? |
I don't have a proof for Grp, I just voiced my strong suspicion that it is true. Let me explain this a bit. Here is a formulation that I find quite instructive: a cocongruence on a group
So we have an equivalence relation We also need that the equivalence relation on It is effective when there is a subgroup (All that holds similarly for general categories, but I find it instructive to write it down in this special case.) The special case And here is why I think it is true: I would literally fall off my chair if somebody writes down an equivalence relation (with the mentioned properties) that does not have this form (for general groups). Yes, this is no proof. What I find remarkable is that this does not seem to be trivial at all for Ab, but your (almost formal) implication From this we get some global Random remark: We are proving here that Grp does not satisfy the second half of the definition of being Barr-coexact. But we already know that it is not coregular anyway (the first half of the definition). Question: I just saw that you have proven that CRing does not have effective cocongruences (using |
|
Yes, that's precisely the line of thought I was going along. One thought which occurs is that the equivalence relation of conjugacy is preserved by homomorphisms. However, it's not representable (at least I think it isn't, else you'd essentially get a counterexample to Grp being epi-regular). Another thought: Any proof is going to have to take into account the cotransitivity map in some way. For example, the relation As for the example in CRing, I think the counterexample is a corelation on Anyway, as far as I can tell, all that breaks down completely in noncommutative rings since you no longer have |
|
Ok. I haven't thought about this long, but why cannot we take Also, images of two commuting idempotents are still commuting. So their product is still idempotent. For groups, the conjugation relation is not limit-preserving. I think we can say straight away that the equivalence relation must be some algebraic equation. |
|
Hmm... OK, I guess maybe an idempotent would split a ring into $\begin{bmatrix} eRe & (1-e)Re \ eR(1-e) & (1-e)R(1-e) \end{bmatrix}$ or something along those lines. For the comments on groups: yes, certainly in the general case if you take a presentation |
|
For another example I have in mind, in the full subcategory of integral (or cancellative) commutative monoids, the equivalence |
|
Another idea I had for Ring which ended up not panning out: defining the congruence relation as having so that's likely to have issues with not respecting equalizers, or with not giving an epimorphism to the representing object if adjoining a concrete divisibility structure such as an abelian group homomorphism |
|
I wonder if there might be group theorists at MO who might have ideas. Especially if we give the concrete versions in terms of systems of equations in |
|
Funny coincidence, since I also wanted to ask on MO right now, but I wanted to coordinate this with you first. Personally, I would like to ask the question about Z first, with the reformulation I gave above. But you can go ahead... Just to reiterate: I would like to avoid working with words in free groups at all costs, and rather try to use the functorial POV. PS: I also made several attempts to get an answer from Google Gemini, but they failed. |
|
Sure, I would be fine with starting with asking about the simple case first. (Feel free to add some of my non-counterexamples if you'd like to use them to illustrate some of the complexities of the question, e.g. |
|
It's funny enough you mentioned Google Gemini - I had my first session with it on a mathematical question yesterday, regarding my question about whether a divisibility structure on an element of the additive group of a ring is necessarily unique. It had several false starts, where I had to point out a flaw in the reasoning - including some first answers where it thought the result was true - until eventually it reminded me of the construction of adjoining a unit to the rng on Q/Z with zero multiplication. |
|
I made another attempt with Google Gemini (Pro). This time, the proof looks good. I will spend more time, but for now I cannot find a mistake. (Click for a larger version.) About that "subgroup theorem for amalgamated free products": probably the name is a hallucination, but the statement appears to be true based on the usual element structure. Relevant: https://www.researchgate.net/publication/266843789_Subgroups_of_amalgamated_free_products |
|
I wonder if that proof simplifies in any significant way for the special case |
|
Also, unless I'm missing it somewhere, it doesn't use cosymmetry. So, that would imply for example that any representable functor giving a preorder on each group in fact gives an equivalence relation on each group - which I guess isn't that surprising. |
|
Here is my "human" proof that cocongruences in Grp are effective, which is just a slight variation of Gemini's proof. The vague citation of the "subgroup theorem for amalagamted free products" is replaced by a direct argument using the well-known description of the elements of a pushout. cocongruences_grp.pdf (outdated, see next comment) If you have verified it, I can add a commit which adds it (pdf + tex + Ah and yes, cosymmetry is not needed. |
|
I have improved the proof in many ways and also generalized it. You can have a look at the commit I just added. I find this result quite beautiful! So only Ring is missing to make (current) unit test work (we can always change that test if the challenge is too big!). But tbh I also would like to know the answer for Mon. |
all of them! :) |
| ( | ||
| 'coslice-effective-congruences', | ||
| 'Effective congruences in a coslice of an extensive category imply effective congruences in the original category', | ||
| 'Let $\mathcal{C}$ be an extensive category, and $A$ an object of $\mathcal{C}$. If the coslice category $A \backslash \mathcal{C}$ has effective congruences, then so does $\mathcal{C}$.', | ||
| 'Let $f, g : E \rightrightarrows X$ be a congruence in $\mathcal{C}$. We then construct a congruence on $A+X$ in $A \backslash \mathcal{C}$. On an intuitive level, this will be the congruence generated by $a \sim a$ for $a\in A$ and $x \sim y$ for $(x, y) \in E$. More precisely, we will show the two maps $\mathrm{id}_A + f, \mathrm{id}_A + g : A+E \rightrightarrows A+X$ form a congruence. To show the pair of maps is jointly monomorphic, we use extensivity to split the domains of the generalized elements, so without loss of generality we may assume each comes from either $A$ or $E$. Reflexivity and symmetry are straightforward; and for transitivity, we again use extensivity to split the domains of the generalized elements, and provide an argument on each subdomain where the three generalized elements all come from either $A$ or $E$.<br> | ||
| Now if this congruence is the kernel pair of $h : A+X \to Z$ in $A \backslash \mathcal{C}$, then $E$ is the kernel pair of $h \circ i_2 : X \to Z$ in $\mathcal{C}$. Namely, if we have two generalized elements $x_1, x_2 : T \rightrightarrows X$ such that $h \circ i_2 \circ x_1 = h \circ i_2 \circ x_2$, then we can construct a map pair $\mathrm{id}_A + x_1, \mathrm{id}_A + x_2 : A+T \to A+X$ in $A \backslash \mathcal{C}$ with $h \circ (\mathrm{id}_A + x_1) = h \circ (\mathrm{id}_A + x_2)$. Therefore, the pair of maps $\mathrm{id}_A + x_1, \mathrm{id}_A + x_2$ factors through $A+E$, so $x_1, x_2$ factors through $A+E$; and using disjoint coproducts, we may conclude $x_1, x_2$ factors through $E$.' |
There was a problem hiding this comment.
It almost looks like this could be generalized to a statement about adjoint pairs (in this case the left adjoint being
|
Great to see all the progress here! Please keep me updated and tell me when you think it is done. Then I will do another review. I have just merged #142. Can you please rebase and make the adjustment in I haven't thought about if TorsFreeAb has effective cocongruences. Maybe it is already deduced automatically. But if not, maybe you can find a proof. |
|
Maybe #149 has some (minor) interesting consequences for this PR. ... and merge conflicts, sorry! |
| ( | ||
| 'Met', | ||
| 'effective cocongruences', | ||
| FALSE, | ||
| 'We will define a cocongruence on $(0,1)$ where $E := (-1, 0) \cup (0, 1)$ with the standard subspace metric from $\mathbb{R}$, and the two maps $(0, 1) \rightrightarrows E$ are the inclusion map and $x \mapsto -x$. Then for any metric space $X$, the induced relation on non-expansive maps $(0, 1) \to X$ is that $f \sim g$ if and only if $d(f(x), g(y)) \le x+y$ for each $x, y \in (0, 1)$. This is reflexive since $d(f(x), f(y)) \le |x-y| < x+y$, and it is clearly symmetric. For transitivity, suppose $f\sim g$ and $g\sim h$. Then for any $\varepsilon > 0$, we have $d(f(x), h(y)) \le d(f(x), g(\varepsilon)) + d(g(\varepsilon) + h(y)) \le (x + \varepsilon) + (y + \varepsilon)$. Since this holds for every $\varepsilon > 0$, we conclude $d(f(x), h(y)) \le x+y$.<br> | ||
| On the other hand, if this cocongruence were effective, then by the dual of <a href="/lemma/effective-congruence-quotients">this result</a>, it would be the cokernel pair of the equalizer of the two inclusion maps. However, that equalizer is empty, so $E$ would have to be a binary copower of $(0,1)$, which does not exist in $\mathbf{Met}$.' | ||
| ); |
There was a problem hiding this comment.
The nature of this counterexample, along with my failure to find counterexamples on small finite
I think it is done and ready for review. (Unless you want me to rebase instead of leaving the merges as is, in which case I would probably have to come back to that tomorrow.) |
|
Great! I will do a detailed review now. I will also make some commits with minor edits if required. Regarding rebase, I will write a separate comment. That will only be relevant before we merge, so not now. |
|
I added a commit with various minor adjustments. Most of them improve the readability of the formulas. Please check these files because I made a bit more there:
In the proof of Apart from that, everything looks very good now. Thanks a lot for this massive work! This PR has added a lot of new material, both general results and interesting proofs for specific categories. As for the merge, I would like to request two things:
How I would do it: Make sure that the main branch is uptodate. Then, in the feature branch, execute For a more brutal approach, and I think this is necessary here: Execute
This commit contains the changes in the files
This commit contains the changes in the files
This contains all other changes. (It can also be split into several commits, but not too many.) When no file is left, force push via I do not recommend merge commits. For future PRs, I suggest to use This will yield a clean commit history in the main branch. Of course we lose some of the history during the development of this PR, but I don't think that any of this is relevant in the future. The results matter, and these are kept, of course. These remarks apply to all PRs. I wanted to write already the same in #115 (which had 40 commits, which could be grouped to 3 commits as well), but didn't want to overwhelm you with "rules" (as if there weren't already enough). So this is what I recommend, but if you have strong objections, or need help, please let me know. |
| 'Pos', | ||
| 'effective cocongruences', | ||
| FALSE, | ||
| 'Let $X$ be $\mathbb{R}$ with the standard (total) order, and let $E$ be the poset with underlying set $\mathbb{R} \times \{ 0, 1 \}$ and partial order such that $(x, m) \le (y, n)$ if and only if $x < y$ or $(x, m) = (y, n)$. The two maps $\mathbb{R} \rightrightarrows E$ will be $x \mapsto (x, 0)$ and $x \mapsto (x, 1)$ respectively. For any partial order $(\mathbb{P}, \le)$, the induced equivalence relation on the set of order-preserving functions $\mathbb{R} \to \mathbb{P}$ is that $f \sim g$ if and only if $f(x) \le g(y)$ and $g(x) \le f(y)$ whenever $x < y$. This relation is clearly reflexive and symmetric; for transitivity, if $f \sim g$ and $g \sim h$, then whenever $x < y$, we have $f(x) \le g(\frac{x+y}{2}) \le h(y)$ and similarly $h(x) \le g(\frac{x+y}{2}) \le f(y)$, showing that $f \sim h$.<br> |
There was a problem hiding this comment.
Things like \mathbb{R} can be abbreviated to \IR after merging #152 . I wonder which PR we should merge first? How to minimize the work?
I think it makes sense to merge #152 first. I can also make the required adjustments here. There will be a merge conflict in TorsFreeAb.sql which is easy to handle.
There was a problem hiding this comment.
Things like
\mathbb{R}can be abbreviated to\IRafter merging #152 . I wonder which PR we should merge first? How to minimize the work?I think it makes sense to merge #152 first. I can also make the required adjustments here. There will be a merge conflict in
TorsFreeAb.sqlwhich is easy to handle.
I see you just merged #152 a few minutes ago. I'm done with the other content revision you requested - so you can make the required adjustments if you want without worrying about stepping on my toes. Or, if you prefer, I can merge it and do the adjustments, and then do the requested history squash.
There was a problem hiding this comment.
Ok I will do the adjustments now. This will hopefully make the rebase also easier. Remark: this means the formulas will not render properly for the time being ...
There was a problem hiding this comment.
No wait, this does not make any sense. The process will be much smoother if we first incorporate the main branch with 152 in particular. This is because the macros are optional to use. But for using the macros, their definition is not optional ...
Can you first do* git reset --soft main and "collapse" the commits as explained in the other comment? (I don't want to do it since then all the commits will belong to me, but it's your work.)
Then I can go ahead and change the formulas.
*I just noticed that this produces quite a lot of files that have not been changed in your PR. This is the problem of merge commits, the history diverges too much ... I hope we don't need to repeat #97
There was a problem hiding this comment.
It seems you managed to do it? :)
Ah regarding
Note that ScriptRaccoon scriptraccoon@gmail.com contributed many enhancements to
the proofs and presentation, and in particular contributed the proof that Grp has
effective cocongruences.
Maybe it is better to remove the additions for Grp then. I can commit this again. I have the TeX file here.
I totally forgot about that proof, isn't this months ago? :D
There was a problem hiding this comment.
Yes, the squash into 3 commits worked pretty smoothly as described. The only addition I needed to make was: after the git reset --soft main it still had all the branch changes staged, so I also needed to git reset and then do the selective adds and commits.
There was a problem hiding this comment.
Alright. In case you didn't see my edit:
Maybe it is better to remove the additions for Grp then. I can commit this again. I have the TeX file here.
I've just pushed a change to clarify things in terms of generalized elements. I wonder if it would also make sense to remove the topos_is_co-Malcev implication which should be redundant now. Maybe it could make sense to move the citation from there to the comment you added at the end of regular_epi-regular_extensive_consequences. |
|
Sorry for producing millions of merge conflicts ...
Yes, let's remove it.
Yes. Please phrase it as optional information, since the reader already has the proof above.
Thanks! I will have a look. EDIT. The proof is much better now. 👍🏼 |
ed4fabf to
e99be63
Compare
Note that Script Raccoon <scriptraccoon@gmail.com> contributed many enhancements to the proofs and presentation.
7d3e8d8 to
611052d
Compare
|
I've just done another rebase with the Grp contributions sorted into a separate commit (for which I used --author to credit you). I also found online the git workflow where you establish a few topics up front, and then for subsequent commits to add to a topic you set a commit message of the form: So that you prepare for using "git rebase -i --autosquash main" later. I think I'll be using that workflow on future PRs. (And if you want, you can establish a topic or two for commits that you contribute and do the same.) |
|
Yes I am familiar with that workflow. I have used it for a while, tbh I didn't really like it. With interactive rebase I can do the same much more easily, but that's just personal preference. Also, these things don't necessarily need to be done during the PR, only in the end! Please don't spend too much time rewriting the history during development, only here it was necessary, I guess (since there were no rebases to the main branch). Thank you for adjusting the commit for Grp. I have now also added the (final?) commit where the LaTeX macros are added in. I didn't check every formula, but like 20 examples, and they looked fine. So when you are ready, I will smash that merge button! |
Sounds good to me! |
|
The proof that FreeAb does not have effective cocongruences seems to be generalizable, it looks very formal. Maybe a connection with balanced, here applied to We will let |
Maybe on the dual side, this generalizes to a proof of: additive + effective congruences => normal, forming a revision of the current additive_effective_congruences_imply_normal. The revised proof: given I can do a quick PR for that this evening. |

I just started a trial run of the property of having effective congruences; and so far, it's not going well. I only found a couple basic properties to put in, along with a preliminary version of the theorem that a pretopos is balanced; but there are still 34 unresolved cases for congruences and 50 unresolved cases for cocongruences. I don't even know whether Group has effective cocongruences. And certainly, there are a lot of cases I could fill in by hand, but that would be a lot of individual entries to maintain.
Any ideas would be welcome on how to proceed.
(I know this is still draft and has several places that need details or citations filled in; at this point I'm just posting to give an idea of the current status.)