This question is a particular case of Tim Campion's question. Let $\mathrm{Adj}$ be the strict $2$-category corepresenting adjunctions, i.e., the free strict $2$-category generated by two objects $x, y$, two morphisms $l: x\to y$, $r: y\to x$, two $2$-cells $\eta: \operatorname{id}_x\to rl$, $\epsilon: lr\to \operatorname{id}_y$ and the triangle identity $(r\xrightarrow{\eta r} rlr\xrightarrow{r\epsilon} r)= \operatorname{id}_r$, $(l\xrightarrow{l\eta} lrl\xrightarrow{\epsilon l} l) = \operatorname{id}_l$.
Now we consider an $(\infty, 2)$-category $C$. For me, the adjunction here is by definition a functor $\mathrm{Adj}\to C$ (is it for most people?). I am wondering how much data I need to specify. It seems that people know from Riehl-Verity that I only need to specify the image of the above generator, subject to the triangle identity (which is now an equivalence of the $2$-cells), i.e., $\mathrm{Adj}$ is free as an $(\infty, 2)$-category with the above presentation. Examples include the following:
- In the $(\infty, 2)$-category of $(\infty, 1)$-categories, they say adjunctions are the same data as adjunctions in the homotopy $2$-category.
- In the proof of Theorem 4.6 of Rune Haugseng's paper, on pages 260 and 261, he seems to just provide the information on generators to define a functor from $\mathrm{Adj}$.
Scanning Riehl-Verity's paper I linked above, I could not find the exact same statement. Can someone clarify where I should look at?