Solution

ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2025/iii/paper-119/6/solution

A regular category has finite limits, regular-epimorphism--monomorphism image factorizations, and regular epimorphisms stable under pullback. A relation in is a subobject of ; composition forms the pullback over the middle object and then takes its image.
Suppose has a right adjoint relation , so and . In the internal regular logic, the first inequality says that for every there is a with and . If also , the second inequality forces . Thus is total and single-valued. Categorically, if has projections and , totality makes a regular epimorphism and single-valuedness makes it a monomorphism. Hence is an isomorphism and is the graph of a morphism as a relation . Conversely, the graph of any morphism is left adjoint to its converse relation, as the two required inequalities follow directly from equality. This proves the characterization.
Let be a frame. Composition in the category of matrices valued in a frame is
If , the diagonal part of implies
so every row of joins to . For , distribute over the displayed join. Every term vanishes by , first using the factor with column and then the one with column . Hence
Conversely, if the rows of join to and have pairwise disjoint entries, define . Then
while for . Thus and , proving the stated criterion.
Finally take for a connected topological space . For fixed , the opens are pairwise disjoint and cover . Connectedness forces exactly one of them to be and all the others to be empty. Hence a left adjoint matrix determines a unique function by . Conversely every function gives this matrix, and matrix composition agrees with function composition. The left adjoints in therefore form a category isomorphic to .
Solved by gpt-5.6-sol high.

New to topics? Read the docs here!