scientific article; zbMATH DE number 3861408

From MaRDI portal
Publication:3329629





[For the entire collection see Zbl 0534.00008.] One of the fundamental concepts in differential geometry is that of a connection. This paper provides an elementary and general approach to connections such that curvature, torsion, and integrability can be defined and calculations can be carried out in a simple combinatorial setting. The link to the classical notion of an affine connection on the tangent bundle of a smooth manifold is provided by synthetic differential geometry and the first neighborhood of the diagonal construction. (An approach to connections in terms of 1-neighbors appears in the work of \textit{P. Deligne} [Equations différentielles à points singuliers réguliers, Lect. Notes Math. 163 (1970; Zbl 0244.14004)].) Let M be a set and \(\sim\) a reflexive, symmetric relation. Let \({\mathcal M}(x)=\{y\in M| x\sim y\}.\) A connection is a law \(\lambda\) which assigns to any triple (x,y,z) with \(x\sim y,\quad x\sim z\) an element \(\lambda\) (x,y,z) of M such that \(y\sim \lambda(x,y,z).\quad \lambda(x,y,\quad): {\mathcal M}(x)\to {\mathcal M}(y)\) is bijective and is to be thought of as parallel transport from x to y. \(\lambda\) is subject to the axioms of a pregroup [see the author, Cah. Topologie Géom. Différ. 23, 347-362 (1982; Zbl 0518.18011)]. Curvature measures the extent to which \(\lambda(y,z,\quad){\mathbb{O}}\lambda(x,y,\quad)=\lambda(x,z,\quad).\) Notions such as torsion, framings and forms can be defined in a very simple fashion and under certain technical assumptions the result that \(\lambda\) is integrable iff \(\lambda\) is curvature free and torsion free is obtained. By considering M to be a formal n-dimensional manifold and \(\sim\) the 1-neighbor relation, these results can be applied to synthetic differential geometry. Synthetic arguments can be used to obtain the corresponding classical result provided one is working in a sufficiently nice model of SDG. The connection notion presented here can be applied to graphs with M being the set of vertices and \(\sim\) the existence of an edge relation. The paper ends with an interesting graph-theoretic example.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3329629)