ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Φ:A↬B\Phi:{\mathbb A}\looparrowright{\mathbb B} be a matrix. Its loose extension is the matrix

⇕Φ:⇓AΦ←↬⇑BΦ→,{\Updownarrow}{\Phi}:{\Downarrow}{{\mathbb A}}^{\overleftarrow{\Phi}}\looparrowright{\Uparrow}{{\mathbb B}}^{\overrightarrow{\Phi}},

with objects (a,b)(a,b) and structure maps a:Φ∗Φ∗α←→α←a:{\Phi}_\ast{\Phi}^\ast\overleftarrow{\alpha}\xrightarrow{}\overleftarrow{\alpha} and b:β→→Φ∗Φ∗β→b:\overrightarrow{\beta}\xrightarrow{}{\Phi}^\ast{\Phi}_\ast\overrightarrow{\beta}. Loose-extension conjecture. The matrix ⇕Φ{\Updownarrow}{\Phi} is isomorphic to

⇓(A×Bo)Φ←×Φ→(α←×β→,Φ),{\Downarrow}{\left({\mathbb A}\times{\mathbb B}^{o}\right)}^{\overleftarrow{\Phi}\times\overrightarrow{\Phi}}\left(\overleftarrow{\alpha}\times\overrightarrow{\beta},\Phi\right),

and is equivalent to the matrix of the adjunction Φ⊛⊣Φ⊛:BΦ→→⇓AΦ←{\Phi}^{\circledast}\dashv{\Phi}_{\circledast}:{\mathbb B}^{\overrightarrow{\Phi}}\xrightarrow{}{\Downarrow}{{\mathbb A}}^{\overleftarrow{\Phi}}, where

Φ⊛α←(u)=⇓AΦ←(α←,Φ#u),{\Phi}^{\circledast}\overleftarrow{\alpha}(u)={\Downarrow}{{\mathbb A}}^{\overleftarrow{\Phi}}(\overleftarrow{\alpha},{\Phi}^{\#}u), Φ⊛β→(ℓ)=⇑BΦ→(Φ#ℓ,β→).{\Phi}_{\circledast}\overrightarrow{\beta}(\ell)={\Uparrow}{{\mathbb B}}^{\overrightarrow{\Phi}}({\Phi}_{\#}\ell,\overrightarrow{\beta}).

The claim identifies the loose extension with a canonical bicompletion construction and an induced adjunction, providing the categorical structure needed for the subsequent tight-extension construction. The source gives no resolution status.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.