Double linear connections. (English) Zbl 0762.53014

The notion of a \(DL\) (i.e. double vector) space was introduced by the author in Acta Univ. Palacki. Olomuc., Fac. Rerum Nat. 88, Math. 26, 9-25 (1987; Zbl 0701.58004). In the present paper double linear connections on \(DL\) fibrations (i.e. on double vector bundles) are investigated as analogues of linear connections on vector bundles. \(DL\) fibrations are associated with principal bundles of double linear frames. A \(DL\) fibration turns out to be a Whitney sum of its underlying vector fibrations. It is shown that a \(DL\) connection induces linear connections on the underlying vector fibrations. Finally double linear connections are characterized by means of double linear vector fields and double linear one parameter groups.


53C05 Connections (general theory)


Zbl 0701.58004
Full Text: EuDML


[1] Kolář I.: On the jet prolongations of smooth categories. Bull. de l‘Academie Polonaise des Sciences, Sér.des sci.math., astr.et phys. Vol. XXIV, No 10 (1976), 883-997.
[2] Kolář I.: On the second tangent bundle and generalized Lie derivatives. Tensor, N.S. 38 (1982), 98-102. · Zbl 0512.58002
[3] Margiarotti L., Modugno M.: Fibred spaces, jet spaces and connections in field theories. Procced.of the Meeting ”Geometry and Physics”, Florence, 1982.
[4] Pradines J.: Représentation des jets non-holonomes par des morphisme vectoriels doubles soudés. C.R. Acad. Sci. Paris Sér. A, 278 (1974), 1523-1526. · Zbl 0285.58002
[5] Vanžurová A.: Connections on the second tangent bundle. Časop. pěst. mat., 108 (1983), 258-264.
[6] Vanžurová A.: Double vector spaces. Acta UPO, Fac.rer.nat. 88 (1987), 9-25. · Zbl 0701.58004
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.