Synthetic Differential Geometry (SDG) of Stacks - Categorification of SDG

Abstract

Orthodox synthetic differential geometry is concerned with microlinear spaces. This paper explains how to develop synthetic differential geometry of microlinear stacks or microlinear categories. As illustrations, we will address the categorical Lie algebra of infinitesimal endofunctors and infinitesimal natural transformations, the theory of differential forms and the categorified Ambrose-Palais-Singer theorem. In this paper, we use the word “stack” as a synonym of “category”.

Share and Cite:

Nishimura, H. (2026) Synthetic Differential Geometry (SDG) of Stacks - Categorification of SDG. Applied Mathematics, 17, 504-525. doi: 10.4236/am.2026.178029.

1. Introduction

Orthodox synthetic differential geometry (SDG) [1] [2] is concerned with spaces of a special kind, called microlinear spaces. This paper is concerned with differential geometry of microlinear stacks or microlinear categories. It is exactly established in orthodox SDG that any infinitesimal transformation is invertible, that is to say, bijective. This paper shows that any infinitesimal endofunctor is invertible, as is expected. However, we are also expected to show that any infinitesimal natural transformation between infinitesimal endofunctors is invertible. Invertible natural transformations with respect to vertical composition of natural transformations are usually called natural isomorphisms in the literature. We will show that any infinitesimal natural transformation between infinitesimal endofunctors is invertible with respect to horizontal composition of natural transformations. We will show in § 3 that the category of infinitesimal endofunctors and infinitesimal natural transformations of a microlinear category is a categorical Lie algebra, just as the space of infinitesimal transformations of a microlinear space forms a Lie algebra in orthodox SDG.

The Ambrose-Palais-Singer theorem [3], claiming the equivalence of symmetric connections and sprays, is in essence of categorical nature. In orthodox SDG, it was first established by Bunge and Sawyer [4] under certain hypotheses, having been established in general by Kock and Lavendhomme [5]. We will establish the categorical Ambrose-Palais-Singer theorem in § 5, where the proof is none other than a paraphrase of Kock and Lavendhomme’s with strong emphasis on its categorical quintessence. § 4 addresses differential forms on the categorical level. We have confined our consideration to these three topics, but I expect that almost all the results of orthodox SDG can be elevated to the categorical level.

In universal algebra, an algebraic theory consists of a specification of operations and equational laws that these operations must satisfy. Models of the algebraic theory are called algebras. The notion of a monoid is a well-known example of an algebraic theory. A monoid is a set equipped with an associative binary operation and a unity element operating as both left and right unity. It is simple to categorify a given algebraic theory. By way of example, a categorical monoid is no other than an internal category within the category Mod of monoids, and their homomorphisms. Therefore, to make a category a categorical monoid, we must make both Ob and Mor monoids so that such categorical mappings as dom:MorOb , cod:MorOb , id:ObMor and comp:Mor × Ob MorMor are homomorphisms of monoids, i.e., mappings preserving binary operations and unity elements. Alternatively, a categorical monoid can be defined to be an internal monoid within the category Cat of small categories and functors. By way of example, a categorical monoid is a category equipped with functors F 2 :× and F 0 :1 making the following diagrams commutative:

×× F 2 × Id × Id × F 2 F 2 × F 2

1× F 0 × Id × Id F 2

×1 Id × F 0 × Id F 2

In general, any equational algebraic theory can be categorified by choosing functors corresponding to operations with commutative diagrams corresponding to equations.

The former approach is called the concept-first-then categorification approach, while the latter is called the category-first-then-conceptualization approach. It is well known that both approaches are essentially equivalent.

The setting in which we work is the same as that in [2]. In particular, R denotes the ring of line type which is supposed to abide by the general Kock-Lawvere axiom. We are slightly naive in referring to such a large category as Cat , but we are content only to say that there are several methods to make such discussions legitimate. We do not hope to blur our basic geometrical idea by such secondary legitimizations.

2. Preliminary Considerations

Every set can be regarded as a discrete category. We denote the category of categories and functors and that of sets and mappings by Cat and Set , respectively. Sets and spaces are regarded as synonyms. Categories and stacks are regarded as synonyms. Vertical and horizontal compositions of natural transformations α,β are denoted by βα and βα , respectively.

A natural transformation α:FG is called a vertical natural isomorphism provided that there exists a natural transformation β:GF such that αβ=id and βα=id . This notion is simply called a natural isomorphism in the literature. A natural transformation α:FG is called a horizontal natural isomorphism provided that there exists a natural transformation β: F G such that αβ=id and βα=id , which implies that all the compositions of functors F F , F F , G G and G G are the identity functors.

A functor F:N is called isomorphic if there exists a functor G:N such that GF= Id and FG= Id N .

It is well known that there is an adjunction

Hom Cat ( ×,N ) Hom Cat ( , N )

for ,,NCat , By taking to be a discrete category, i.e., a set S , we have

Hom Cat ( ×S,N ) Hom Cat ( , N S )

with ×S= S and N S = S N . This means that Cat is tensored and cotensored over Set .

An internal category within a complete category C is a pair ( Ob,Mor ) of objects in C along with morphisms in C

dom:MorOb

cod:MorOb

id:ObMor

comp:Mor × Ob MorMor

abiding by the usual axioms such as associativity of composition.

A ring of line type R is fixed. We recall some infinitesimal spaces.

D 0 ={ 0 }

D= D 1 ={ dR| d 2 =0 }

D k ={ eR| e k+1 =0 }

D( n )={ ( d 1 ,, d n ) D n | d i d j =0foranyij }

D k ( n )={ ( e 1 ,, e n ) ( D k ) n | e i e j =0foranyij }

D 2 ( 3 )={ ( d 1 , d 2 , d 1 , d 2 , d 1 , d 2 ) ( D 2 ) 3 | d i d j = d i d j = d i d j =0foranyi,j=1,2 }

The category of infinitesimal spaces, which is the dual of the category of Weil algebras, is of coproduct and an initial object D 0 By way of example, we have

D 2 ( 3 )= D 2 D 2 D 2

D( 4 )=DDDD

The following quasi-colimit diagrams will be used implicitly in frequence.

D 2 ( d 1 , d 2 ) D 2 d 1 + d 2 D D d 1 , d 2 D 2 d 1 + d 2 D Id D D Id D D

D m ×D ( e,d ) D m ×DedD D e,d D m ×DedD Id D D Id D D

A category is called microlinear if D is a limit diagram in Cat for any finite quasi colimit diagram D of infinitesimal spaces. It is easy to see that

Proposition 2.1. Any limit of microlinear categories in Cat is microlinear. If is a microlinear category and N is a category, then N is a microlinear category. In particular, if is a microlinear category and S is a set, then S is a microlinear category.

Proof. The first statement follows from the interchangeability of two limits. The second statemnt follows from the exponential law ( N ) S = ( S ) N for any set S and the fact that the functor ( _ ) N :CatCat preserves limits. □

Since the forgetful functor CatSet×Set preserves and creates limits, we have

Theorem 2.2. A microlinear category is no other than an internal category within the category of microlinear spaces and mappings.

In this paper, will always be a microlinear category.

3. The Categorical Lie Algebra of Infinitesimal Endofunctors and Infinitesimal Natural Transformations

We will show that the functor π 0 : D assigning the object at 0 to each object in D and the morphism at 0 to each morphism in D a categorical R -module fibered over in the sense that it is an internal R -module within the slice category Cat/ .

Now we will define functors for a categorical R -module fibered over corresponding to scalar multiplication, addition, zero with respect to addition and inverse with respect to addition.

  • For each rR , the functor

dDrdD : D D

is denoted by D r .

  • The functor

dD( d,d )D( 2 ) : D × D D( 2 ) D

is denoted by D + , where the isomorphism D × D D( 2 ) comes from the quasi-colimit diagram

D 0 i D i dD( d,0 )D( 2 ) D dD( 0,d )D( 2 ) D( 2 )

  • The functor

dD0 : D 0 D

is denoted by D 0 .

  • The functor

dDdD : D D

is denoted by D .

Now we will show that the above four functors make D a categorical R -module fibered over .

Theorem 3.1. The functor π 0 : D is a categorical R -module fibered over .

Proof. We have to make sure that the four functors corresponding to scalar multiplication, addition, zero with respect to addition and inverse with respect to addition abide by the usual equational axioms of R -module. Here we only deal with the associativity of addition, which follows from the commutativity of the following diagram:

D( 2 ) × D D( 3 ) D × D( 2 ) D + × Id D Id D × D + D( 2 ) D+ D D+ D( 2 )

Corollary 3.2. For any subcategory , the restriction of the functor π 0 to ( π 0 ) 1 ( ) is a categorical R -module fibered over . In particular, for any object a , the category ( D ) a = ( π 0 ) 1 ( { a, id a } ) is a categorical R -module.

Now we will show that the categorical R -module π 0 : D fibered over is Euclidean in the sense that there is a unique functor D 2 D making the diagram

( D × D 0 ) D D 2 D ( Id D × D D 0 ) D ( d 1 , d 2 ) D 2 d 1 d 2 D ( D × D ) D ( D + ) D ( D ) D D 2

commutative. Generally, a categorical R -module V is called Euclidean if there exists a unique functor φ: V D V with

π d = π 0 +dφ

where π d is the standard projection V D V assigning the value at d to each entity in V D . It is easy to see that a categorical R -module V is Euclidean if both the induced R -module ObV and the induced R -module MorV are Euclidean in the classical sense. It is also easy to see that if V is a Euclidean categorical R -module and N is a category, then V N is a Euclidean categorical R -module.

Theorem 3.3. The categorical R -module π 0 : D fibered over is Euclidean.

Proof. This follows from the quasi-colimit diagram

D dD( d,0 ) D 2 dD( 0,d ) D 2 dD( 0,0 ) D 2 D 2 ( d 1 , d 2 ) D 2 d 1 d 2 D D

and the commutativity of the diagram

( D × D 0 ) D ( Id D × D D 0 ) D ( D × D ) D ( D + ) D ( D ) D dD( d,0 ) D 2   dD( 0,d ) D 2 dD( 0,0 ) D 2 D

Now we would like to make the categorical R -module ( ( ) D ) Id a categorical Lie R -algebra. It is easy to see that

Proposition 3.4. We have

D + ( F,G ) d = G d F d = F d G d

for any ( F,G )Ob ( ( ) D ) Id × ( ( ) D ) Id and any dD as well as

D + ( α,β ) d = β d α d = α d β d

for any ( α,β )Mor ( ( ) D ) Id × ( ( ) D ) Id and any dD , where stands for the composition of functors in the former formula, while stands for the horizontal composition of natural transformations in the latter formula.

Corollary 3.5. For any FOb ( ( ) D ) Id and any dD , F d is an isomorphic endofunctor, while, for any αMor ( ( ) D ) Id and any dD , α d is a horizontal natural isomorphism.

We define a functor D lie : ( ( ) D ) Id × ( ( ) D ) Id ( ) D 2 by the formulas

( F,G )Ob ( ( ) D ) Id × ( ( ) D ) Id ( ( d 1 , d 2 ) D 2 G d 2 F d 1 G d 2 F d 1 )Ob ( ) D 2

( α,β )Mor ( ( ) D ) Id × ( ( ) D ) Id ( ( d 1 , d 2 ) D 2 β d 2 α d 1 β d 2 α d 1 )Mor ( ) D 2

where stands for the composition of functors in the former formula, while stands for the horizontal composition of natural transformations in the latter formula.

Proposition 3.6. There is a unique functor D Lie : ( ( ) D ) Id × ( ( ) D ) Id ( ) D making the diagram

( ( ) D ) Id × ( ( ) D ) Id D lie D lie ( ) D 2 ( ) ( d 1 , d 2 ) D 2 d 1 d 2 D ( ) D

commutative.

Proof. This follows from the quasi-colimit diagram

D dD( d,0 ) D 2 dD( 0,d ) D 2 dD( 0,0 ) D 2 D 2 ( d 1 , d 2 ) D 2 d 1 d 2 D D

and the fact that the diagram

( ( ) D ) Id × ( ( ) D ) Id D lie ( ) D 2 ( ) dD( d,0 ) D 2 ( ) dD( 0,d ) D 2 ( ) dD( 0,0 ) D 2 ( ) D

is commutative. □

Now we have

Theorem 3.7. ( ( ) D ) Id is a categorical Lie R -algebra.

The proof is deferred to the Appendix.

4. Categorical Differential Forms

In this section will always be a Euclidean categorical R -module which is microlinear as a category.

We define three functors:

(1) For any integer i between 1 and n and any rR , we define a functor D r i : D n D n to be

( ( d 1 ,, d n ) D n x d 1 ,, d n Ob )Ob( D n )

( ( d 1 ,, d n ) D n x d 1 ,,r d i ,, d n Ob )Ob( D n )

( ( d 1 ,, d n ) D n f d 1 ,, d n Mor )Mor( D n )

( ( d 1 ,, d n ) D n f d 1 ,,r d i ,, d n Mor )Mor( D n )

(2) For any permutation σ of the numbers 1,2,,n , we define a functor D σ : D n D n to be

( ( d 1 ,, d n ) D n x d 1 ,, d n Ob )Ob( D n )

( ( d 1 ,, d n ) D n x d σ( 1 ) ,, d σ( n ) Ob )Ob( D n )

( ( d 1 ,, d n ) D n f d 1 ,, d n Mor )Mor( D n )

( ( d 1 ,, d n ) D n f d σ( 1 ) ,, d σ( n ) Mor )Mor( D n )

(3) For any eD and any integer i between 1 and n+1 , we define a functor F e i : D n+1 D n by

( ( d 1 ,, d n+1 ) D n+1 x d 1 ,, d n+1 Ob )Ob( D n+1 )

( ( d 1 ,, d ^ i ,, d n+1 ) D n x d 1 ,, e i ,, d n+1 Ob )Ob( D n )

( ( d 1 ,, d n+1 ) D n+1 f d 1 ,, d n+1 Mor )Mor( D n+1 )

( ( d 1 ,, d ^ i ,, d n+1 ) D n f d 1 ,, e i ,, d n+1 Mor )Mor( D n )

A categorical differential n -form on with values in is a functor ω: D n abiding by the following two conditions:

(1) For any integer i between 1 and n and any rR , we have

ω D r i =rω

(2) For any permutation σ of the numbers 1,2,,n , we have

ω D σ = ε σ ω

where ε σ denotes the sign of the permutation σ .

Theorem 4.1. Let φ: D n × D n be a functor abiding by the following conditions:

(1) For each ( e 1 ,, e n ) D n , the functor φ( , e 1 ,, e n ): D n is a categorical differential n -form on M with values in E ;

(2) For each fMor D n , the mapping φ( f, ): D n Mor is homogeneous component wise in the sense that

φ( f,e,,r e i ,, e n )=rφ( f, e 1 ,, e i ,, e n )

for each rR and each integer i between 1 and n .

Then there is a unique categorical differential n -form ω: D n with values in such that

φ( , e 1 ,, e n )= e 1 e n ω( )

Proof. The proof is based on the quasi-colimit diagram

D n1 ( d,, d n1 )( 0,d,, d n1 ) ( d,, d n1 )( d 1 ,, d i1 ,0,d,, d n1 ) ( d,, d n1 )( d,, d n1 ,0 ) ( d,, d n1 )( 0,,0 ) D n ( d,, d n ) D n d d n D D

Since Ob D n is a microlinear space and the diagram

D n1 ( d,, d n1 )( 0,d,, d n1 ) ( d,, d n1 )( d 1 ,, d i1 ,0,d,, d n1 ) ( d,, d n1 )( d,, d n1 ,0 ) ( d,, d n1 )( 0,,0 ) D n φ ¯ Ob D n

equalizes for the mapping φ ¯ : D n Ob D n associated to φ , there exists a unique ω ¯ :DOb D n with

ω ¯ ( ( d,, d n ) D n d d n D )= φ ¯

Since Ob D n is an Euclidean R -module, there is a unique ωOb D n with ω ¯ ( d )=dω for any dD . It is easy to see that is the desired categorical differential n -form on . □

Corollary 4.2. Given a categorical differential n -form ω with values in a categorical Euclidean R -module , the functor ω ˜ D n+1 × D n+1 defined by the formula

i=1 n+1 ( 1 ) i e 1 e ^ i e n+1 ( ω F 0 i ) i=1 n+1 ( 1 ) i e 1 e ^ i e n+1 ( ω F e i i )

abides by the three conditions in the above theorem, so that there exists a unique categorical differential ( n+1 ) -form ω with values in with

ω ˜ ( , e 1 ,, e n+1 )= e 1 e n+1 ω ( )

The corollary allows of exterior differentiation.

5. The Categorical Ambrose-Palais-Singer Theorem

A categorical connection on is a functor

: D × D D 2

abiding by the following conditions:

(1) The diagram

D × D D 2 π 1 F 0 2 D

is commutative, where π 1 : D × D D is the forgetful functor to the first D .

(2) The diagram

D × D D 2 π 2 F 0 1 D

is commutative, where π 2 : D × D D is the forgetful functor to the second D .

(3) For any rR , the diagram

D × D D r 1 × Id D D × D D D r 1 D

is commutative.

(4) For any rR , the diagram

D × D Id D × D r 1 D × D D D r 2 D

is commutative.

A categorical connection : D × D D 2 on is called symmetric if the diagram

D × D D( 2 ) D 2 D σ D σ D × D D( 2 ) D 2

is commutative, where σ is the permutation of 1 and 2.

A categorical spray on is a functor Δ: D D 2 abiding by the following conditions:

(1) The diagram

D Δ Id D D 2 i D

is commutative, where i:D D 2 is the natural injection inducing the functor i : D 2 D .

(2) For any rR , the diagram

D Δ D 2 D r 1 D r 1 D Δ D 2

is commutative.

Proposition 5.1. For a categorical connection on , there is a unique functor : D D 2 making the diagram commutativity of the diagram

D Δ D 2 ( Id D , Id D ) ( d 1 , d 2 ) D 2 d 1 + d 2 D 2 D × D D 2

commutative. The functor Δ is a categorical spray on .

Proof. The crucial part of the proof is based on the following quasi-colimit diagram:

D dD( 0,d ) D 2 dD( d,0 ) D 2 D 2 ( d 1 , d 2 ) D 2 d 1 + d 2 D 2 D 2

owing to which, the unique functor Δ : D D 2 characterized by the commutativity of the above diagram exists, because the diagram

D   ( Id D , Id D ) D × D D 2 dD( 0,d ) D 2 dD( d,0 ) D 2 M D

is commutative, as can be seen easily. The funcor Δ : D D 2 thus obtained is indeed a categorical spray on . □

Conversely, a categorical spray on determines a symmetric categorical connection on .

Proposition 5.2. For a categorical spray Δ on , there is a unique functor Δ : D × D D 2 making the diagram give characterized by the commutativity of the diagram

D × D Δ D 2 ( d 1 , d 2 ) D 2 D + ( D d 1 × D d 2 ) e D 2 ( d 1 , d 2 ) D 2 ( e d 1 ,e d 2 ) D 2 D× D 2 ( D ) D 2 Δ D 2 D 2 × D 2 ( D 2 ) D 2

commutative. The functor Δ is a symmetric categorical connection Δ on .

Proof. The crucial part of the proof is based on the quasi-colimit diagram

( D 2 ) 2 × D 2 ( e 1 , e 2 , d 1 , d 2 ) ( D 2 ) 2 × D 2 ( e 2 , e 1 d 1 , e 1 d 2 ) D 2 × D 2 ( e 1 , e 2 , d 1 , d 2 ) ( D 2 ) 2 × D 2 ( e 1 e 2 , d 1 , d 2 ) D 2 × D 2 D 2 × D 2 ( e,, d 1 , d 2 )( e d 1 ,e d 2 ) D 2

owing to which, there is a unique functor Δ : D × D D 2 making the above diagram commutative, because the diagram

D × D ( d 1 , d 2 ) D 2 D + ( D d 1 × D d 2 ) D× D 2 Δ D 2 D 2 × D 2

( e 1 , e 2 , d 1 , d 2 ) ( D 2 ) 2 × D 2 ( e 2 , e 1 d 1 , e 1 d 2 ) D 2 × D 2 ( e 1 , e 2 , d 1 , d 2 ) ( D 2 ) 2 × D 2 ( e 1 e 2 , d 1 , d 2 ) D 2 × D 2 ( D 2 ) 2 × D 2

is commutative. It is easy to see that the functor Δ : D × D D 2 thus obtained is indeed a symmetric canonical connection on .

Theorem 5.3. For any categorical spray Δ on , we have

Δ= Δ Δ

Proof. We will show that, for any symmetric categorical connection on , there is a unique functor Δ Δ ¯ : D D 2 making the diagram

D Δ Δ ¯ D 2 ( Id D , Id D ) ( d 1 , d 2 ) D 2 d 1 + d 2 D 2 D × D D 2 ( d 1 , d 2 ) D 2 D + ( D d 1 × D d 2 ) e D 2 ( d 1 , d 2 ) D 2 ( e d 1 ,e d 2 ) D 2 D× D 2 ( D ) D 2 Δ D 2 D 2 × D 2 ( D 2 ) D 2

commutative. We simply juxtapose the commutative diagram characterizing Δ and the commutative diagram characterizing to get the commutative diagram

D Δ Δ D 2 ( Id D , Id D ) ( d 1 , d 2 ) D 2 d 1 + d 2 D 2 D × D Δ D 2 ( d 1 , d 2 ) D 2 D + ( D d 1 × D d 2 ) e D 2 ( d 1 , d 2 ) D 2 ( e d 1 ,e d 2 ) D 2 D× D 2 ( D ) D 2 Δ D 2 D 2 × D 2 ( D 2 ) D 2

which means that Δ Δ plays the role of Δ Δ ¯ . Since the functor e D 2 ( d 1 , d 2 ) D 2 ( e d 1 ,e d 2 ) D 2 from D 2 to D 2 × D 2 is a monomorphism in Cat , we can see easily that the commutativity of the outer square in the diagram

D Δ Δ ¯ D 2 ( Id D , Id D ) ( d 1 , d 2 ) D 2 d 1 + d 2 D 2 D × D Δ D 2 ( d 1 , d 2 ) D 2 D + ( D d 1 × D d 2 ) e D 2 ( d 1 , d 2 ) D 2 ( e d 1 ,e d 2 ) D 2 D× D 2 ( D ) D 2 Δ D 2 D 2 × D 2 ( D 2 ) D 2

is equivalent to the commutativity of the upper square, which characterizes the functor Δ Δ . Owing to Proposition 5.1, this means the unique existence of Δ Δ ¯ so that we have

Δ Δ ¯ = Δ Δ

However, it is easy to that the diagram

D Δ D 2 ( Id D , Id D ) ( d 1 , d 2 ) D 2 d 1 + d 2 D 2 D × D D 2 ( d 1 , d 2 ) D 2 D + ( D d 1 × D d 2 ) e D 2 ( d 1 , d 2 ) D 2 ( e d 1 ,e d 2 ) D 2 D× D 2 ( D ) D 2 Δ D 2 D 2 × D 2 ( D 2 ) D 2

is commutative, so that we have

Δ= Δ Δ

Theorem 5.4. For any symmetric categorical connection on , we have

= Δ

Proof. We will show that, for any symmetric categorical connection on , there is a unique functor Δ ¯ : D × D D 2 making the diagram

D × D Δ ¯ D 2 ( d 1 , d 2 ) D 2 D + ( D d 1 × D d 2 ) e D 2 ( d 1 , d 2 ) D 2 ( e d 1 ,e d 2 ) D 2 D× D 2 D 2 × D 2 ( Id D , Id D ) D 2 ( ( d 1 , d 2 ) D 2 d 1 + d 2 D 2 ) D 2 ( D × D ) D 2 D 2 D 2 × D 2

commutative. We simply juxtapose the commutative diagram characterizing Δ : D D 2 after exponentiation with D 2 and the commutative diagram characterizing to get the commutative diagram

D × D Δ D 2 ( d 1 , d 2 ) D 2 D + ( D d 1 × D d 2 ) e D 2 ( d 1 , d 2 ) D 2 ( e d 1 ,e d 2 ) D 2 D× D 2 ( Δ ) D 2 D 2 × D 2 ( Id D , Id D ) D 2 ( ( d 1 , d 2 ) D 2 d 1 + d 2 D 2 ) D 2 ( D × D ) D 2 D 2 D 2 × D 2

which means that the functor Δ plays the role of Δ ¯ . Considering the diagram

D × D Δ ¯ D 2 ( d 1 , d 2 ) D 2 D + ( D d 1 × D d 2 ) e D 2 ( d 1 , d 2 ) D 2 ( e d 1 ,e d 2 ) D 2 D× D 2 ( Δ ) D 2 D 2 × D 2 ( Id D , Id D ) D 2 ( ( d 1 , d 2 ) D 2 d 1 + d 2 D 2 ) D 2 ( D × D ) D 2 D 2 D 2 × D 2

and taking into account the fact that the functor ( ( d 1 , d 2 ) D 2 d 1 + d 2 D 2 ) D 2 is monomorphism in the category Cat , we can see that the outer square is commutative if the upper square is commutative. Therefore, we are sure of the unique existence of the desired functor Δ ¯ by Proposition 5.2. It is also easy to see that the diagram

D × D D 2 ( d 1 , d 2 ) D 2 D + ( D d 1 × D d 2 ) e D 2 ( d 1 , d 2 ) D 2 ( e d 1 ,e d 2 ) D 2 D× D 2 D 2 × D 2 ( Id D , Id D ) D 2 ( ( d 1 , d 2 ) D 2 d 1 + d 2 D 2 ) D 2 ( D × D ) D 2 D 2 D 2 × D 2

is commutative, so that we have

= Δ

Appendix. The Proof of Theorem 3.7

Appendix A. Bilinearity

The following simple proposition can be proved as in classical SDG (Lemma and Proposition 10, [2]).

Proposition A.1. Let F be a functor from a categorical R -module V to a Euclidean categorical R -module . If F is homogeneous, then F is linear.

By this proposition, it suffices to establish the bi-homogeneity, which follows directly from the definition of the Lie bracket.

Appendix B. Strong Differences

In the following, we are concerned with antisymmetry and the Jacobi identity. The discussion is an elaboration of our previous discussion [6]-[8].

The notion of strong difference is discussed in orthodox differential geometry. Given two microsquares γ 1 and γ 2 on a microlinear space with γ 1 | D( 2 ) = γ 2 | D( 2 ) , their strong difference γ 2 γ 1 is defined on account of the following quasi-colimit diagram

D( 2 ) ( d 1 , d 2 )D( 2 )( d 1 , d 2 ) D 2 D 2 ( d 1 , d 2 )D( 2 )( d 1 , d 2 D 2 ) ( d 1 , d 2 ) D 2 ( d 1 , d 2 , d 1 d 2 ) D 2 D D 2 ( d 1 , d 2 ) D 2 ( d 1 , d 2 ,0 ) D 2 D D 2 D

We have the following theorem, whose proof based on a quasi-colimit diagram is given in the next subsection.

Theorem B.1. For any microsquares γ 12 and γ 21 on a microlinear space with γ 12 | D( 2 ) = γ 21 | D( 2 ) , we have

γ 12 γ 21

γ 21 γ 12

which sum up only to vanish.

The notion of strong differences can be relativised, resulting in relative strong differences 1 , 2 and 3 between microcubes on a microlinear space . By identifying a microcube γ on with a microsquare on D

( d 2 , d 3 ) D 2 ( d 1 Dγ( d 1 , d 2 , d 3 ) )

the notion of strong difference between microsquares on D becomes the notion of relative strong difference 1 between microcubes on . Given microcubes γ and ζ on with

γ| ( D×D× D 0 )( D× D 0 ×D ) = ζ| ( D×D× D 0 )( D× D 0 ×D )

the relative strong difference ζ 1 γ is defined to be a microsquare on . By identifying a microcube γ on with a microsquare on D

( d 1 , d 3 ) D 2 ( d 2 Dγ( d 1 , d 2 , d 3 ) )

the notion of strong difference between microsquares on D becomes the notion of relative strong difference 2 between microcubes on . Given microcubes γ and ζ on with

γ| ( D×D× D 0 )( D 0 ×D×D ) = ζ| ( D×D× D 0 )( D 0 ×D×D )

the relative strong difference ζ 2 γ is defined to be a microsquare on . By identifying a microcube γ on with a microsquare on D

( d 1 , d 2 ) D 2 ( d 3 Dγ( d 1 , d 2 , d 3 ) )

the notion of strong difference between microsquares on D becomes the notion of relative strong difference 3 between microcubes on . Given microcubes γ and ζ on with

γ| ( D× D 0 ×D )( D 0 ×D×D ) = ζ| ( D× D 0 ×D )( D 0 ×D×D )

the relative strong difference ζ 3 γ is defined to be a microsquare on .

Lemma B.2. We have the following:

(1) Given microcubes γ , ζ , γ and ζ with γ| ( D×D× D 0 )( D× D 0 ×D ) = ζ| ( D×D× D 0 )( D× D 0 ×D ) and γ | ( D×D× D 0 )( D× D 0 ×D ) = ζ | ( D×D× D 0 )( D× D 0 ×D ) , we have ζ 1 γ and ζ 1 γ . If they satisfy γ| D D 2 = γ | D D 2 and ζ| D D 2 = ζ | D D 2 , then we have ( ζ 1 γ )| D( 2 ) = ( ζ 1 γ )| D( 2 ) so that ( ζ 1 γ ) ( ζ 1 γ ) is defined.

(2) Given microcubes γ , ζ , γ and ζ with γ| ( D×D× D 0 )( D 0 ×D×D ) = ζ| ( D×D× D 0 )( D 0 ×D×D ) and γ | ( D×D× D 0 )( D 0 ×D×D ) = ζ | ( D×D× D 0 )( D 0 ×D×D ) , we have ζ 2 γ and ζ 2 γ . If they satisfy γ( ( d 1 , d 2 , d 3 )D D 2 ( d 1 , d 2 , d 3 ) D 3 )= γ ( ( d 1 , d 2 , d 3 )D D 2 ( d 1 , d 2 , d 3 ) D 3 ) and ζ( ( d 1 , d 2 , d 3 )D D 2 ( d 1 , d 2 , d 3 ) D 3 )= ζ ( ( d 1 , d 2 , d 3 )D D 2 ( d 1 , d 2 , d 3 ) D 3 ) , then we have ( ζ 2 γ )| D( 2 ) = ( ζ 2 γ )| D( 2 ) so that ( ζ 2 γ ) ( ζ 2 γ ) is defined.

(3) Given microcubes γ , ζ , γ and ζ with γ| ( D× D 0 ×D )( D 0 ×D×D ) = ζ| ( D× D 0 ×D )( D 0 ×D×D ) and γ | ( D× D 0 ×D )( D 0 ×D×D ) = ζ | ( D× D 0 ×D )( D 0 ×D×D ) , we have ζ 3 γ and ζ 3 γ . If they satisfy γ| D 2 D = γ | D 2 D and ζ| D 2 D = ζ | D 2 D , then we have ( ζ 3 γ )| D( 2 ) = ( ζ 3 γ )| D( 2 ) so that ( ζ 3 γ ) ( ζ 3 γ ) is defined.

Now we have the following theorem, which is the 3-dimensional generalization of the 2-dimensional general antisymmetry.

Theorem B.3. Let γ 123 , γ 132 , γ 213 , γ 231 , γ 312 and γ 321 be microcubes on a microlinear space making the following diagram commutative, where the diagram consists of the following vertices

D 3 [ 13 ] ( γ 123 ) D 3 [ 14 ] ( γ 132 ) D 3 [ 15 ] ( γ 213 ) D 3 [ 16 ] ( γ 231 ) D 3 [ 17 ] ( γ 312 ) D 3 [ 18 ] ( γ 321 ) D 2 D 2 [ 7 ] D 2 D 2 [ 8 ] D 2 D 2 [ 9 ] D 2 D 2 [ 10 ] D 2 D 2 [ 11 ] D 2 D 2 [ 12 ] D 2 D [ 1 ] D 2 D [ 2 ] D 2 D [ 3 ] D 2 D [ 4 ] D 2 D [ 5 ] D 2 D [ 6 ]

together with as well as the following mappings:

(1) The mappings i [ 1 ][ 13 ] :[ 1 ][ 13 ] , i [ 2 ][ 14 ] , i [ 3 ][ 16 ] , i [ 4 ][ 15 ] , i [ 5 ][ 17 ] and i [ 6 ][ 18 ] are

( d 1 , d 2 ,e ) D 2 D( e, d 1 , d 2 ) D 3

(2) The mappings i [ 1 ][ 16 ] i [ 2 ][ 18 ] , i [ 3 ][ 17 ] , i [ 4 ][ 14 ] , i [ 5 ][ 13 ] and i [ 6 ][ 15 ] are

( d 1 , d 2 ,e ) D 2 D( d 1 , d 2 ,e ) D 3

(3) The mappings i [ 7 ][ 13 ] , i [ 7 ][ 14 ] , i [ 8 ][ 16 ] , i [ 8 ][ 15 ] , i [ 9 ][ 17 ] and i [ 9 ][ 18 ] are

( d 1 , d 2 , e 1 , e 2 ) D 2 D 2 ( d 1 + e 1 , d 2 , e 2 ) D 3

(4) The mappings γ 123 : D 3 , γ 132 : D 3 , γ 213 : D 3 , γ 231 : D 3 , γ 312 : D 3 and γ 321 : D 3 .

Then the following three expressions are meaningful, summing up only to vanish.

( γ 123 1 γ 132 ) ( γ 231 1 γ 321 )

( γ 231 2 γ 213 ) ( γ 312 2 γ 132 )

( γ 312 3 γ 321 ) ( γ 123 3 γ 213 )

The Lie bracket [ , ] in ( ) Id D can be expressed in terms of strong differences. Given X,Y,Z ( ) Id D , microsquares γ 12 and γ 21 on as well as microcubes γ 123 , γ 132 , γ 213 , γ 231 , γ 312 and γ 321 on as follows:

γ 12 ( d 1 , d 2 )= Y d 2 X d 1

γ 21 ( d 1 , d 2 )= X d 1 Y d 2

γ 123 ( d 1 , d 2 , d 3 )= Z d 3 Y d 2 X d 1

γ 132 ( d 1 , d 2 , d 3 )= Y d 2 Z d 3 X d 1

γ 213 ( d 1 , d 2 , d 3 )= Z d 3 X d 1 Y d 2

γ 231 ( d 1 , d 2 , d 3 )= X d 1 Z d 3 Y d 2

γ 312 ( d 1 , d 2 , d 3 )= Y d 2 X d 1 Z d 3

γ 321 ( d 1 , d 2 , d 3 )= X d 1 Y d 2 Z d 3

Lemma B.4. We have

[ X,Y ]= γ 12 γ 21

[ Y,X ]= γ 21 γ 12

[ X,[ Y,Z ] ]=( γ 123 1 γ 132 ) ( γ 231 1 γ 321 )

[ Y,[ Z,X ] ]=( γ 231 2 γ 213 ) ( γ 312 2 γ 132 )

[ Z,[ X,Y ] ]=( γ 312 3 γ 321 ) ( γ 123 3 γ 213 )

Therefore, antisymmetry and the Jacobi identity of the Lie bracket follows directly from the general antisymmetry and the general Jacobi identity.

The discussion for microlinear spaces so far can easily be elevated to microlinear categories. Given a microlinear category , we define a functor D : D 2 × D( 2 ) D 2 D in place of the mapping , .

Appendix C. General Antisymmetry

The general antisymmetry follows from the quasi-colimit diagram whose vertices go as follows:

D 2 D 0 [ 7 ] D 2 D( 2 ) [ 6 ] D 2 D [ 4 ] ( γ 12 γ 21 ) D 2 D [ 8 ] D 2 D [ 5 ] ( γ 21 γ 12 ) D 2 [ 2 ] ( γ 12 ) D 2 [ 3 ] ( γ 21 ) D( 2 ) [ 1 ]

Its arrows go as follows:

(1) The mappings i [ 1 ][ 2 ] from [ 1 ] to [ 2 ] and i [ 1 ][ 3 ] from [ 1 ] to [ 3 ] are

( d 1 , d 2 )D( 2 )( d 1 , d 2 ) D 2

(2) The mappings i [ 2 ][ 4 ] and i [ 3 ][ 5 ] are

( d 1 , d 2 ) D 2 ( d 1 , d 2 ,0 ) D 2 D

(3) The mappings i [ 3 ][ 4 ] and i [ 2 ][ 5 ] are

( d 1 , d 2 ) D 2 ( d 1 , d 2 , d 1 d 2 ) D 2 D

(4) The mapping i [ 4 ][ 6 ] is

( d 1 , d 2 ,e ) D 2 D( d 1 , d 2 ,e,0 ) D 2 D( 2 )

(5) The mapping i [ 5 ][ 6 ] is

( d 1 , d 2 ,e ) D 2 D( d 1 , d 2 , d 1 d 2 ,e ) D 2 D( 2 )

(6) The mapping i [ 6 ][ 7 ] is

( d 1 , d 2 , e 1 , e 2 ) D 2 D( 2 )( d 1 , d 2 ,0 ) D 2 D 0

(7) The mapping i [ 8 ][ 6 ] is

( d 1 , d 2 ,e ) D 2 D( d 1 , d 2 ,e,e ) D 2 D( 2 )

Appendix D. General Jacobi Identity

The general Jacobi identity follows from the quasi-colimit diagram whose vertices go as follows:

Its arrows go as follows:

(1) The mappings i [ 1 ][ 13 ] , i [ 2 ][ 14 ] , i [ 3 ][ 16 ] , i [ 4 ][ 15 ] , i [ 5 ][ 17 ] and i [ 6 ][ 18 ] are

( d 1 , d 2 ,e ) D 2 D( e, d 1 , d 2 ) D 3

(2) The mappings i [ 1 ][ 16 ] , i [ 2 ][ 18 ] , i [ 3 ][ 17 ] , i [ 4 ][ 14 ] , i [ 5 ][ 13 ] and i [ 6 ][ 15 ] are

( d 1 , d 2 ,e ) D 2 D( d 1 , d 2 ,e ) D 3

(3) The mappings i [ 7 ][ 13 ] , i [ 7 ][ 14 ] , i [ 8 ][ 16 ] , i [ 8 ][ 15 ] , i [ 9 ][ 17 ] and i [ 9 ][ 18 ] are

( d 1 , d 2 , e 1 , e 2 ) D 2 D 2 ( d 1 + e 1 , d 2 , e 2 ) D 3

(4) The mappings i [ 10 ][ 16 ] , i [ 10 ][ 18 ] , i [ 11 ][ 17 ] , i [ 11 ][ 14 ] , i [ 12 ][ 13 ] and i [ 12 ][ 15 ] are

( d 1 , d 2 , e 1 , e 2 ) D 2 D 2 ( d 2 , e 2 , d 1 + e 1 ) D 3

(5) The mappings i [ 14 ][ 19 ] , i [ 15 ][ 20 ] , i [ 18 ][ 21 ] , i [ 18 ][ 22 ] , i [ 14 ][ 23 ] and i [ 15 ][ 24 ] are

( d 1 , d 2 , d 3 ) D 3 ( d 1 , d 2 , d 3 ,0,0 ) D 3 D 2

(6) The mappings i [ 13 ][ 19 ] , i [ 16 ][ 20 ] and i [ 17 ][ 21 ] are

( d 1 , d 2 , d 3 ) D 3 ( d 1 , d 2 , d 3 , d 1 , d 2 d 3 ) D 3 D 2

(7) The mappings i [ 16 ][ 22 ] , i [ 17 ][ 23 ] and i [ 13 ][ 24 ] are

( d 1 , d 2 , d 3 ) D 3 ( d 1 , d 2 , d 3 , d 3 , d 1 d 2 ) D 3 D 2

(8) The mappings i [ 22 ][ 25 ] , i [ 23 ][ 26 ] and i [ 24 ][ 27 ] are

( d 1 , d 2 , d 3 , e 1 , e 2 ) D 3 D 2 ( d 1 , d 2 , d 3 ,0,0,0, e 1 , e 2 ,0 ) D 3 ( 2 ) D 2 D

(9) The mappings i [ 19 ][ 25 ] , i [ 20 ][ 26 ] and i [ 21 ][ 27 ] are

( d 1 , d 2 , d 3 , e 1 , e 2 ) D 3 D 2 ( 0,0,0, d 1 , d 2 , d 3 , e 1 , e 2 , e 1 e 2 ) D 3 ( 2 ) D 2 D

(10) The mapping i [ 25 ][ 28 ] is

( d 1 , d 2 , d 3 , d 1 , d 2 , d 3 , e 1 , e 2 ,f ) D 3 ( 2 ) D 2 D

( d 1 , d 2 , d 3 , d 1 , d 2 , d 3 ,0,0,0, e 1 , e 2 ,0,0,0,0,f,0,0 ) D 3 ( 3 ) D 2 ( 3 )D( 3 )

(11) The mapping i [ 26 ][ 28 ] is

( d 1 , d 2 , d 3 , d 1 , d 2 , d 3 , e 1 , e 2 ,f ) D 3 ( 2 ) D 2 D

( 0,0,0, d 1 , d 2 , d 3 , d 1 , d 2 , d 3 ,0,0, e 1 , e 2 ,0,0,0,f,0 ) D 3 ( 3 ) D 2 ( 3 )D( 3 )

(12) The mapping i [ 27 ][ 28 ] is

( d 1 , d 2 , d 3 , d 1 , d 2 , d 3 , e 1 , e 2 ,f ) D 3 ( 2 ) D 2 D

( d 1 , d 2 , d 3 ,0,0,0, d 1 , d 2 , d 3 ,0,0,0,0, e 1 , e 2 ,0,0,f ) D 3 ( 3 ) D 2 ( 3 )D( 3 )

(13) The mapping i [ 28 ][ 29 ] is

( d 1 , d 2 , d 3 , d 1 , d 2 , d 3 , d 1 , d 2 , d 3 , e 1 , e 2 , e 1 , e 2 , e 1 , e 2 ,f, f , f ) D 3 ( 3 ) D 2 ( 3 )D( 3 )

( d 1 , d 2 , d 3 , d 1 , d 2 , d 3 , d 1 , d 2 , d 3 , e 1 , e 2 , e 1 , e 2 , e 1 , e 2 ,0 ) D 3 ( 3 ) D 2 ( 3 ) D 0

(14) The mapping i [ 30 ][ 28 ] is

( d 1 , d 2 , d 3 , d 1 , d 2 , d 3 , d 1 , d 2 , d 3 , e 1 , e 2 , e 1 , e 2 , e 1 , e 2 ,f ) D 3 ( 3 ) D 2 ( 3 )D ( d 1 , d 2 , d 3 , d 1 , d 2 , d 3 , d 1 , d 2 , d 3 , e 1 , e 2 , e 1 , e 2 , e 1 , e 2 ,f,f,f ) D 3 ( 3 ) D 2 ( 3 )D( 3 )

Conflicts of Interest

The author declares no conflicts of interest regarding the publication of this paper.

References

[1] Kock, A. (2006) Synthetic Differential Geometry. 2nd Edition, Cambridge University Press.[CrossRef]
[2] Lavendhomme, R. (1996) Basic Concepts of Synthetic Differential Geometry. Kluwer Academic Publishers.
[3] Ambrose, W.A., Palais, R.S. and Singer, I.M. (1960) Sprays. Anais da Academia Brasileira de Ciências, 32, 163-178.
[4] Bungé, M. and Sawyer, P. (1984) On Connections, Geodesics and Sprays in Synthetic Differential Geometry. Cahiers de Topologie et Géométrie Différentielle Catégoriques, 25, 221-258.
[5] Kock, A. and Lavendhomme, R. (1984) Strong Infinitesimal Linearity, with Applications to Strong Difference and Affine Connections. Cahiers de Topologie et Géométrie Différentielle Catégoriques, 25, 311-324.
[6] Nishimura, H. (1997) Theory of Microcubes. International Journal of Theoretical Physics, 36, 1099-1131.[CrossRef]
[7] Nishimura, H. (1997) General Jacobi Identity Revisited. International Journal of Theoretical Physics, 38, 2163-2174.[CrossRef]
[8] Nishimura, H. and Osoekawa, T. (2007) General Jacobi Identity Revisited Again. International Journal of Theoretical Physics, 46, 2843-2862.[CrossRef]

Copyright © 2026 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.