Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Framing: three equivalent characterizations

Open
QAlgorithms.Papers.Independent.Intakethird100.P60.framing_three_characterizations

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

prove2quantum

Let D\mathbb DD be a pseudo double category, with strict vertical category D0\mathbb D_0D0​, weak horizontal composition ⊙\odot⊙, and specified coherent globular associators and unitors. Let L,RL,RL,R send a horizontal arrow or square to its left and right frame. Then

(L,R) is a fibration⟺(L,R) is an opfibration⟺every vertical arrow has both a companion and a conjoint.(L,R)\text{ is a fibration}\quad\Longleftrightarrow\quad (L,R)\text{ is an opfibration}\quad\Longleftrightarrow\quad \text{every vertical arrow has both a companion and a conjoint}.(L,R) is a fibration⟺(L,R) is an opfibration⟺every vertical arrow has both a companion and a conjoint.

For a vertical arrow f:A→Bf:A\to Bf:A→B, a companion is M:A⇝BM:A\rightsquigarrow BM:A⇝B with cells u:UA⇒Mu:U_A\Rightarrow Mu:UA​⇒M over (1A,f)(1_A,f)(1A​,f) and c:M⇒UBc:M\Rightarrow U_Bc:M⇒UB​ over (f,1B)(f,1_B)(f,1B​). A conjoint is N:B⇝AN:B\rightsquigarrow AN:B⇝A with cells v:UA⇒Nv:U_A\Rightarrow Nv:UA​⇒N over (f,1A)(f,1_A)(f,1A​) and d:N⇒UBd:N\Rightarrow U_Bd:N⇒UB​ over (1B,f)(1_B,f)(1B​,f). Their vertical composites equal UfU_fUf​. Their horizontal composites, conjugated by the indicated unitors, are the identity cells of MMM and NNN. The lifting properties quantify over every pair of further frame arrows and require unique factorization.

This characterizes nonalgebraic framing by typed companion and conjoint data, including all equations (4.3)–(4.4).

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

open CategoryTheory

universe u v w x

/-- Theorem 4.1 (PDF p. 15): all three conditions, with both vertical and
horizontal identities included in the companion and conjoint data. -/
theorem framing_three_characterizations {V : Type u} [Category.{v} V]
    (D : DoubleData.{u,v,w,x} V) (hD : DoubleCoherence D) :
    (IsFrameFibration D ↔ IsFrameOpfibration D) ∧
    (IsFrameFibration D ↔ HasCompanions D ∧ HasConjoints D) := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P60
Source
Framed bicategories and monoidal fibrations, arXiv:0706.1286v2, PDF p. 15, Theorem 4.1: Three equivalent characterizations of framing
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 and Cf,g(M,N)C_{f,g}(M,N)Cf,g​(M,N) for square types, where M∈H(A,B)M\in H(A,B)M∈H(A,B), N∈H(C,E)N\in H(C,E)N∈H(C,E), f:A→Cf:A\to Cf:A→C, and g:B→Eg:B\to Eg:B→E. Write 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. Write αM,N,P:(MN)P→M(NP)\alpha_{M,N,P}:(MN)P\to M(NP)αM,N,P​:(MN)P→M(NP), αˉM,N,P:M(NP)→(MN)P\bar\alpha_{M,N,P}:M(NP)\to(MN)PαˉM,N,P​:M(NP)→(MN)P, λ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, and ρˉM:M→MUB\bar\rho_M:M\to MU_Bρˉ​M​:M→MUB​ for the specified squares with identity vertical boundaries. Assume the supplied coherence proof: universally over all well-typed objects, morphisms, horizontal arrows, and squares,

(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≐ means heterogeneous equality; in associativity naturality, a:M→Qa:M\to Qa:M→Q, b:N→Rb:N\to Rb:N→R, and c:P→Sc:P\to Sc:P→S have matching adjoining vertical boundaries; in unit naturality, a:M→Na:M\to Na:M→N has boundaries f,gf,gf,g. Define the following four conditions locally. Condition FFF says that for every A,B,C,EA,B,C,EA,B,C,E, f:A→Cf:A\to Cf:A→C, g:B→Eg:B\to Eg:B→E, and N∈H(C,E)N\in H(C,E)N∈H(C,E), there exist M∈H(A,B)M\in H(A,B)M∈H(A,B) and a∈Cf,g(M,N)a\in C_{f,g}(M,N)a∈Cf,g​(M,N) such that, for every P,QP,QP,Q, h:P→Ah:P\to Ah:P→A, k:Q→Bk:Q\to Bk:Q→B, T∈H(P,Q)T\in H(P,Q)T∈H(P,Q), and b∈Cf∘h,g∘k(T,N)b\in C_{f\circ h,g\circ k}(T,N)b∈Cf∘h,g∘k​(T,N), there exists exactly one c∈Ch,k(T,M)c\in C_{h,k}(T,M)c∈Ch,k​(T,M) satisfying c;a=bc;a=bc;a=b. Condition OOO says that for every A,B,C,EA,B,C,EA,B,C,E, f:A→Cf:A\to Cf:A→C, g:B→Eg:B\to Eg:B→E, and M∈H(A,B)M\in H(A,B)M∈H(A,B), there exist N∈H(C,E)N\in H(C,E)N∈H(C,E) and a∈Cf,g(M,N)a\in C_{f,g}(M,N)a∈Cf,g​(M,N) such that, for every P,QP,QP,Q, h:C→Ph:C\to Ph:C→P, k:E→Qk:E\to Qk:E→Q, T∈H(P,Q)T\in H(P,Q)T∈H(P,Q), and b∈Ch∘f,k∘g(M,T)b\in C_{h\circ f,k\circ g}(M,T)b∈Ch∘f,k∘g​(M,T), there exists exactly one c∈Ch,k(N,T)c\in C_{h,k}(N,T)c∈Ch,k​(N,T) satisfying a;c=ba;c=ba;c=b. Condition CCC says that for every A,BA,BA,B and f:A→Bf:A\to Bf:A→B, there exist M∈H(A,B)M\in H(A,B)M∈H(A,B) and squares u∈C1A,f(UA,M)u\in C_{1_A,f}(U_A,M)u∈C1A​,f​(UA​,M), e∈Cf,1B(M,UB)e\in C_{f,1_B}(M,U_B)e∈Cf,1B​​(M,UB​), with proofs that u;e≐Ufu;e\doteq U_fu;e≐Uf​ and (λˉM;(u⊗e));ρM=1M(\bar\lambda_M;(u\otimes e));\rho_M=1_M(λˉM​;(u⊗e));ρM​=1M​. Condition JJJ says that for every A,BA,BA,B and f:A→Bf:A\to Bf:A→B, there exist N∈H(B,A)N\in H(B,A)N∈H(B,A) and squares u∈Cf,1A(UA,N)u\in C_{f,1_A}(U_A,N)u∈Cf,1A​​(UA​,N), e∈C1B,f(N,UB)e\in C_{1_B,f}(N,U_B)e∈C1B​,f​(N,UB​), with proofs that u;e≐Ufu;e\doteq U_fu;e≐Uf​ and (ρˉN;(e⊗u));λN=1N(\bar\rho_N;(e\otimes u));\lambda_N=1_N(ρˉ​N​;(e⊗u));λN​=1N​. The theorem asserts

(F  ⟺  O) ∧ (F  ⟺  (C∧J)).(F\iff O)\ \land\ \bigl(F\iff(C\land J)\bigr).(F⟺O) ∧ (F⟺(C∧J)).

All quantified morphisms include identities, and VVV may be empty. In either unique-factorization condition, a test square type containing no bbb contributes no requirement; whenever a test square bbb exists, its stated factor must exist uniquely.

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