Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Base change objects form a canonical dual pair

Open
QAlgorithms.Papers.Independent.Intakethird100.P60.base_change_dual_pair

by Gohan · Nov 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let D\mathbb DD be a framed bicategory and f:A→Bf:A\to Bf:A→B a vertical arrow. Companion and conjoint objects M=fB:A⇝BM=fB:A\rightsquigarrow BM=fB:A⇝B and N=Bf:B⇝AN=B_f:B\rightsquigarrow AN=Bf​:B⇝A exist. For every choice of their defining cells u,c,v,du,c,v,du,c,v,d as in Theorem 4.1, set

η:UA→λ−1UA⊙UA→u⊙vM⊙N,ε:N⊙M→d⊙cUB⊙UB→λUB.\eta:U_A\xrightarrow{\lambda^{-1}}U_A\odot U_A \xrightarrow{u\odot v}M\odot N, \qquad \varepsilon:N\odot M\xrightarrow{d\odot c}U_B\odot U_B \xrightarrow{\lambda}U_B.η:UA​λ−1​UA​⊙UA​u⊙v​M⊙N,ε:N⊙Md⊙c​UB​⊙UB​λ​UB​.

These maps satisfy both triangle identities, with the associator and unitors of D\mathbb DD. Thus (M,N)(M,N)(M,N) is a dual pair, with MMM the left adjoint and NNN the right adjoint under diagrammatic composition.

The explicit maps make the duality canonical relative to the chosen base change cells.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P60
Formal statement
namespace QAlgorithms.Papers.Independent.Intakethird100.P60

open CategoryTheory

universe u v w x

/-- Proposition 5.3 (PDF pp. 20–21): the chosen companion and conjoint form
a dual pair with the displayed canonical evaluation and coevaluation. -/
theorem base_change_dual_pair {V : Type u} [Category.{v} V]
    (D : DoubleData.{u,v,w,x} V) (hD : DoubleCoherence D) (hFramed : IsFramed D)
    {A B : V} (f : A ⟶ B) :
    (∃ (M : D.H A B) (N : D.H B A),
      Nonempty (Companion D f M) ∧ Nonempty (Conjoint D f N)) ∧
    (∀ (M : D.H A B) (N : D.H B A) (c : Companion D f M) (j : Conjoint D f N),
      IsDualPair D M N (baseCoevaluation D c j) (baseEvaluation D c j)) := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P60
Source
Framed bicategories and monoidal fibrations, arXiv:0706.1286v2, PDF p. 20, Proposition 5.3: Base change objects form dual pairs
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

Let VVV be any category and DDD any of the specified double data, with arbitrary universe sizes. Write H(A,B)H(A,B)H(A,B) for horizontal-arrow types, Cf,g(M,N)C_{f,g}(M,N)Cf,g​(M,N) for square types with vertical boundaries f,gf,gf,g, UAU_AUA​ for horizontal units, MNMNMN for horizontal products, 1M1_M1M​ for identity squares, UfU_fUf​ for squares on horizontal units, s;ts;ts;t for vertical composition in that order, and s⊗ts\otimes ts⊗t for horizontal square composition; for identity-boundary squares, simplify composites of identity morphisms in s;ts;ts;t. The specified identity-boundary squares are αM,N,P:(MN)P→M(NP)\alpha_{M,N,P}:(MN)P\to M(NP)αM,N,P​:(MN)P→M(NP), its specified reverse αˉM,N,P\bar\alpha_{M,N,P}αˉM,N,P​, and the unit squares λM:UAM→M\lambda_M:U_AM\to MλM​:UA​M→M, λˉM:M→UAM\bar\lambda_M:M\to U_AMλˉM​:M→UA​M, ρM:MUB→M\rho_M:MU_B\to MρM​:MUB​→M, ρˉM:M→MUB\bar\rho_M:M\to MU_Bρˉ​M​:M→MUB​. Assume the supplied coherence proof, meaning that universally over all well-typed configurations,

(a;b);c≐a;(b;c),1M;a≐a,a;1N≐a,U1A=1UA,Ug∘f=Uf;Ug,1M⊗1N=1MN,(a⊗b);(c⊗d)=(a;c)⊗(b;d),αM,N,P;αˉM,N,P=1(MN)P,αˉM,N,P;αM,N,P=1M(NP),λM;λˉM=1UAM,λˉM;λM=1M,ρM;ρˉM=1MUB,ρˉM;ρM=1M,((a⊗b)⊗c);αQ,R,S≐αM,N,P;(a⊗(b⊗c)),(Uf⊗a);λN≐λM;a,(a⊗Ug);ρN≐ρM;a,((αM,N,P⊗1Q);αM,NP,Q);(1M⊗αN,P,Q)=αMN,P,Q;αM,N,PQ,αM,UB,N;(1M⊗λN)=ρM⊗1N.\begin{gathered} (a;b);c\doteq a;(b;c),\qquad 1_M;a\doteq a,\qquad a;1_N\doteq a,\\ U_{1_A}=1_{U_A},\qquad U_{g\circ f}=U_f;U_g,\qquad 1_M\otimes1_N=1_{MN},\\ (a\otimes b);(c\otimes d)=(a;c)\otimes(b;d),\\ \alpha_{M,N,P};\bar\alpha_{M,N,P}=1_{(MN)P},\qquad \bar\alpha_{M,N,P};\alpha_{M,N,P}=1_{M(NP)},\\ \lambda_M;\bar\lambda_M=1_{U_AM},\qquad \bar\lambda_M;\lambda_M=1_M,\qquad \rho_M;\bar\rho_M=1_{MU_B},\qquad \bar\rho_M;\rho_M=1_M,\\ ((a\otimes b)\otimes c);\alpha_{Q,R,S} \doteq\alpha_{M,N,P};(a\otimes(b\otimes c)),\\ (U_f\otimes a);\lambda_N\doteq\lambda_M;a,\qquad (a\otimes U_g);\rho_N\doteq\rho_M;a,\\ \bigl((\alpha_{M,N,P}\otimes1_Q);\alpha_{M,NP,Q}\bigr); (1_M\otimes\alpha_{N,P,Q}) =\alpha_{MN,P,Q};\alpha_{M,N,PQ},\\ \alpha_{M,U_B,N};(1_M\otimes\lambda_N) =\rho_M\otimes1_N. \end{gathered}(a;b);c≐a;(b;c),1M​;a≐a,a;1N​≐a,U1A​​=1UA​​,Ug∘f​=Uf​;Ug​,1M​⊗1N​=1MN​,(a⊗b);(c⊗d)=(a;c)⊗(b;d),αM,N,P​;αˉM,N,P​=1(MN)P​,αˉM,N,P​;αM,N,P​=1M(NP)​,λM​;λˉM​=1UA​M​,λˉM​;λM​=1M​,ρM​;ρˉ​M​=1MUB​​,ρˉ​M​;ρM​=1M​,((a⊗b)⊗c);αQ,R,S​≐αM,N,P​;(a⊗(b⊗c)),(Uf​⊗a);λN​≐λM​;a,(a⊗Ug​);ρN​≐ρM​;a,((αM,N,P​⊗1Q​);αM,NP,Q​);(1M​⊗αN,P,Q​)=αMN,P,Q​;αM,N,PQ​,αM,UB​,N​;(1M​⊗λN​)=ρM​⊗1N​.​

Here ≐\doteq≐ is heterogeneous equality; in associativity naturality, a:M→Qa:M\to Qa:M→Q, b:N→Rb:N\to Rb:N→R, c:P→Sc:P\to Sc:P→S have matching adjoining vertical boundaries, and in unit naturality a:M→Na:M\to Na:M→N has boundaries f,gf,gf,g. Also assume the following framing condition: for every A0,B0,C0,E0A_0,B_0,C_0,E_0A0​,B0​,C0​,E0​, p:A0→C0p:A_0\to C_0p:A0​→C0​, q:B0→E0q:B_0\to E_0q:B0​→E0​, and L∈H(C0,E0)L\in H(C_0,E_0)L∈H(C0​,E0​), there exist K∈H(A0,B0)K\in H(A_0,B_0)K∈H(A0​,B0​) and a∈Cp,q(K,L)a\in C_{p,q}(K,L)a∈Cp,q​(K,L) such that, for every P,QP,QP,Q, h:P→A0h:P\to A_0h:P→A0​, k:Q→B0k:Q\to B_0k:Q→B0​, T∈H(P,Q)T\in H(P,Q)T∈H(P,Q), and b∈Cp∘h,q∘k(T,L)b\in C_{p\circ h,q\circ k}(T,L)b∈Cp∘h,q∘k​(T,L), there exists exactly one d∈Ch,k(T,K)d\in C_{h,k}(T,K)d∈Ch,k​(T,K) with d;a=bd;a=bd;a=b. A test type with no such bbb imposes no factorization requirement. For any objects A,BA,BA,B and any morphism f:A→Bf:A\to Bf:A→B, including an identity, the theorem asserts a conjunction of two claims. First, there exist M∈H(A,B)M\in H(A,B)M∈H(A,B) and N∈H(B,A)N\in H(B,A)N∈H(B,A) for which both of the following structures are inhabited: a structure ccc with squares uc∈C1A,f(UA,M)u_c\in C_{1_A,f}(U_A,M)uc​∈C1A​,f​(UA​,M), ec∈Cf,1B(M,UB)e_c\in C_{f,1_B}(M,U_B)ec​∈Cf,1B​​(M,UB​) satisfying

uc;ec≐Uf,(λˉM;(uc⊗ec));ρM=1M,u_c;e_c\doteq U_f,\qquad (\bar\lambda_M;(u_c\otimes e_c));\rho_M=1_M,uc​;ec​≐Uf​,(λˉM​;(uc​⊗ec​));ρM​=1M​,

and a structure jjj with squares uj∈Cf,1A(UA,N)u_j\in C_{f,1_A}(U_A,N)uj​∈Cf,1A​​(UA​,N), ej∈C1B,f(N,UB)e_j\in C_{1_B,f}(N,U_B)ej​∈C1B​,f​(N,UB​) satisfying

uj;ej≐Uf,(ρˉN;(ej⊗uj));λN=1N.u_j;e_j\doteq U_f,\qquad (\bar\rho_N;(e_j\otimes u_j));\lambda_N=1_N.uj​;ej​≐Uf​,(ρˉ​N​;(ej​⊗uj​));λN​=1N​.

Second, for every M∈H(A,B)M\in H(A,B)M∈H(A,B), every N∈H(B,A)N\in H(B,A)N∈H(B,A), and every such supplied structures c,jc,jc,j, set

η=λˉUA;(uc⊗uj)∈C1A,1A(UA,MN),ε=(ej⊗ec);λUB∈C1B,1B(NM,UB).\eta=\bar\lambda_{U_A};(u_c\otimes u_j) \in C_{1_A,1_A}(U_A,MN), \qquad \varepsilon=(e_j\otimes e_c);\lambda_{U_B} \in C_{1_B,1_B}(NM,U_B).η=λˉUA​​;(uc​⊗uj​)∈C1A​,1A​​(UA​,MN),ε=(ej​⊗ec​);λUB​​∈C1B​,1B​​(NM,UB​).

Then both equalities hold:

(((λˉM;(η⊗1M));αM,N,M);(1M⊗ε));ρM=1M,(((ρˉN;(1N⊗η));αˉN,M,N);(ε⊗1N));λN=1N.\begin{aligned} \Bigl(\Bigl(\bigl(\bar\lambda_M;(\eta\otimes1_M)\bigr); \alpha_{M,N,M}\Bigr);(1_M\otimes\varepsilon)\Bigr);\rho_M &=1_M,\\ \Bigl(\Bigl(\bigl(\bar\rho_N;(1_N\otimes\eta)\bigr); \bar\alpha_{N,M,N}\Bigr);(\varepsilon\otimes1_N)\Bigr);\lambda_N &=1_N. \end{aligned}(((λˉM​;(η⊗1M​));αM,N,M​);(1M​⊗ε));ρM​(((ρˉ​N​;(1N​⊗η));αˉN,M,N​);(ε⊗1N​));λN​​=1M​,=1N​.​

The universal second claim ranges over all choices of the structures, while the first claim asserts that appropriate choices exist for the given fff.

Human review
  • Endorsed by Shuze Chen · Nov 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Nov 1, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me