N | ||q(T)−qN|| |
10 | 1.6781 |
50 | 0.25971 |
100 | 0.06626 |
200 | 0.01664 |
Digital technologies play a key role in the digital transformation of education. In order to improve teaching effectiveness and efficiency, teachers should use digital technologies appropriately. However, some secondary school mathematics teachers have little confidence in their digital teaching behavior. This study aimed to explore the predictors of secondary school mathematics teachers' digital teaching behavior. An extended unified theory of acceptance and use of technology (UTAUT) model was adopted to predict secondary school mathematics teachers' digital teaching behavior. A questionnaire survey was conducted with all junior high school mathematics teachers in a state-level new area, which is located in a central province of China. Three hundred and eighty-five valid data were collected. The partial least squares structural equation modeling (PLS-SEM) method was used to analyze the data. It was found that technological pedagogical content knowledge (TPACK) was the biggest predictor of secondary school mathematics teachers' digital teaching behavior. Attitude, behavioral intention, performance expectancy, effort expectancy and social influence can also affect teachers' digital teaching behavior in direct and/or indirect ways. The findings have noteworthy realistic implications for enhancing digital teaching behavior of secondary school mathematics teachers and promoting digital transformation of secondary school mathematics education.
Citation: Xin Tang, Zhiqiang Yuan, Xi Deng, Liping Xiang. Predicting secondary school mathematics teachers' digital teaching behavior using partial least squares structural equation modeling[J]. Electronic Research Archive, 2023, 31(10): 6274-6302. doi: 10.3934/era.2023318
[1] | Marcin Zając . The dressing field method in gauge theories - geometric approach. Journal of Geometric Mechanics, 2023, 15(1): 128-146. doi: 10.3934/jgm.2023007 |
[2] | Valentin Duruisseaux, Melvin Leok . Time-adaptive Lagrangian variational integrators for accelerated optimization. Journal of Geometric Mechanics, 2023, 15(1): 224-255. doi: 10.3934/jgm.2023010 |
[3] | Elias Maciel, Inocencio Ortiz, Christian E. Schaerer . A Herglotz-based integrator for nonholonomic mechanical systems. Journal of Geometric Mechanics, 2023, 15(1): 287-318. doi: 10.3934/jgm.2023012 |
[4] | Maulik Bhatt, Amit K. Sanyal, Srikant Sukumar . Asymptotically stable optimal multi-rate rigid body attitude estimation based on lagrange-d'alembert principle. Journal of Geometric Mechanics, 2023, 15(1): 73-97. doi: 10.3934/jgm.2023004 |
[5] | Xavier Rivas, Daniel Torres . Lagrangian–Hamiltonian formalism for cocontact systems. Journal of Geometric Mechanics, 2023, 15(1): 1-26. doi: 10.3934/jgm.2023001 |
[6] | Jordi Gaset, Arnau Mas . A variational derivation of the field equations of an action-dependent Einstein-Hilbert Lagrangian. Journal of Geometric Mechanics, 2023, 15(1): 357-374. doi: 10.3934/jgm.2023014 |
[7] | Robert I McLachlan, Christian Offen . Backward error analysis for conjugate symplectic methods. Journal of Geometric Mechanics, 2023, 15(1): 98-115. doi: 10.3934/jgm.2023005 |
[8] | William Clark, Anthony Bloch . Existence of invariant volumes in nonholonomic systems subject to nonlinear constraints. Journal of Geometric Mechanics, 2023, 15(1): 256-286. doi: 10.3934/jgm.2023011 |
[9] | Markus Schlarb . A multi-parameter family of metrics on stiefel manifolds and applications. Journal of Geometric Mechanics, 2023, 15(1): 147-187. doi: 10.3934/jgm.2023008 |
[10] | Francesco Bonechi, Jian Qiu, Marco Tarlini . Generalised Kähler structure on CP2 and elliptic functions. Journal of Geometric Mechanics, 2023, 15(1): 188-223. doi: 10.3934/jgm.2023009 |
Digital technologies play a key role in the digital transformation of education. In order to improve teaching effectiveness and efficiency, teachers should use digital technologies appropriately. However, some secondary school mathematics teachers have little confidence in their digital teaching behavior. This study aimed to explore the predictors of secondary school mathematics teachers' digital teaching behavior. An extended unified theory of acceptance and use of technology (UTAUT) model was adopted to predict secondary school mathematics teachers' digital teaching behavior. A questionnaire survey was conducted with all junior high school mathematics teachers in a state-level new area, which is located in a central province of China. Three hundred and eighty-five valid data were collected. The partial least squares structural equation modeling (PLS-SEM) method was used to analyze the data. It was found that technological pedagogical content knowledge (TPACK) was the biggest predictor of secondary school mathematics teachers' digital teaching behavior. Attitude, behavioral intention, performance expectancy, effort expectancy and social influence can also affect teachers' digital teaching behavior in direct and/or indirect ways. The findings have noteworthy realistic implications for enhancing digital teaching behavior of secondary school mathematics teachers and promoting digital transformation of secondary school mathematics education.
Symmetry reduction plays a central role in the field of geometric mechanics [1,4,23], and it involves expressing the dynamics of a mechanical system with symmetry in terms of the equivalence classes of group orbits on the space of solutions. This allows one to derive reduced equations of motion on a lower-dimensional reduced space which is obtained by quotienting the phase space by the symmetry action. The modern approach to symmetry reduction was introduced in [3,26,28,33], but the notion of symmetry reduction arises in earlier work of Lagrange, Poisson, Jacobi, and Noether.
Discrete variational mechanics [12,17,27] provides a discrete (in time) notion of Lagrangian dynamics, based on a discrete Hamilton's principle. This leads to discrete flow maps that are symplectic, and exhibit a discrete Noether's theorem. In turn, this naturally raises the question of whether one can develop a corresponding theory of symmetry reduction for discrete variational mechanics. Interest in this direction was motivated in part by attempts to understand the integrable discretization of the Euler top due to [29]. Prior work on discrete symmetry reduction includes a constrained variational formulation of discrete Euler–Poincaré reduction [7,21], the associated reduced discrete Poisson structure [22], discrete Euler–Poincaré reduction for field theories [36] and discrete fluids [30,32], discrete Lie–Poisson integrators [5,18], discrete higher-order Lagrange–Poincaré reduction [6], and a discrete notion of Routh reduction for abelian groups [11]. The resulting symplectic and Poisson integrators can be viewed as geometric structure-preserving numerical integrators, and this is an active area of study that is surveyed in [10]. In addition, discrete reduction theory can also be expressed in terms of composable groupoid sequences, which was the approach introduced in [39], and explored further in [19], and extended to field theories in [37].
The goal of this paper is to develop a discrete analogue of Dirac cotangent bundle reduction [42] for Lagrangian systems, that is to say, a discrete Dirac reduction theory for implicit Lagrangian systems. The relevance of this type of reduction lies in the fact that it allows for treating a wide variety of systems with symmetry from a unifying viewpoint, including degenerate systems. Therefore, our discrete analogue allows us to construct geometric integrators for those systems. The theory presented here is limited to systems with abelian symmetry groups, but we expect to extend it to nonabelian groups in the future. Moreover, our work here is the first step in the construction of a category containing discrete Dirac structures that is closed under quotients, as proposed in [16], which is fundamental for the study of discrete Dirac reduction by stages.
In addition, framing the discrete reduction theory in the context of discrete Dirac mechanics is significant, as it is the natural setting for studying discrete Hamiltonian mechanics on manifolds, particularly when expressed in terms of the discrete generalized energy. This is because the notion of discrete Hamiltonians [12,17], which are Type 2 and 3 generating functions, does not make intrinsic sense on a nonlinear manifold, since it is not possible to specify a covector on a nonlinear manifold without also specifying a base point. In contrast, the discrete generalized energy does make intrinsic sense, and is a more promising foundation on which to construct a discrete analogue of Hamiltonian mechanics on manifolds. Discrete Dirac mechanics is also the basis of a discrete theory of interconnections [31], which allows one to construct discretizations of complex multiphysics systems by interconnecting simpler subsystems, which provides a framework for geometric structure-preserving discretization of port-Hamiltonian systems [35].
Reduction theory can be addressed either in terms of the reduction of geometric structures like the symplectic or Poisson structures, or in terms of the reduction of variational principles. In this work, we will start with the discrete Lagrange–Dirac mechanics that was developed in [16], which can be viewed as a discrete analogue of Lagrange–Dirac mechanics, that can be formulated both in terms of Dirac structures [40] and the Hamilton–Pontryagin variational principle [41]. In order to coordinatize the reduced spaces arising in the reduction that we will perform, we rely on the notion of discrete principal connections that was introduced in [14] and further developed in [9].
Overview
In Section 2, we will recall the notion of discrete principal connection [9,14] and discrete Dirac mechanics [15,16]. Initially, we will consider the case where the configuration space Q is a vector space, and the symmetry group G is a vector subspace acting on Q by addition, and show how the discrete Dirac structure is group-invariant, descends to a discrete Dirac structure on the quotient space in Section 3. In Section 4, we will show how the reduced discrete Dirac structure can be used to derive the reduced discrete equations of motion, after we derive the reduced discrete Dirac differential, which is a map arising in the reduced discrete Tulczyjew triple. In Section 5, we also show that the discrete variational principle can be expressed in terms of a discrete generalized energy, and that if the discrete Lagrangian is group-invariant, then so is the discrete generalized energy. This induces a reduced discrete variational principle, which yields the same reduced discrete equations of motion. Then, in Section 6, we show that, in the nonlinear setting, we can use the notion of retractions [2] and an atlas of retraction compatible charts [16] to develop a global discrete theory, whose local representatives recover the vector space theory that we considered in the earlier part of the paper. This is significant, because that implies that with respect to an atlas of retraction compatible charts, the local theory that we initially constructed on each chart is compatible on overlapping domains, and induces a well-defined global theory on a manifold endowed with a semi-global retraction map. In Section 7, we will illustrate the proposed discrete reduction theory by applying it to simulate the charged particle in a magnetic field, and the double spherical pendulum. Finally, we will summarize our contributions in the conclusion, and discuss future research directions.
Let Q be a smooth manifold, G be a Lie group, and ΦQ:G×Q→Q a free and proper left action of G on Q. We will denote ΦQ(g,q)=g⋅q for each q∈Q and g∈G. For a fixed g∈G, we define the map ΦQg:Q→Q as q↦q⋅g. Likewise, for a fixed q∈Q, we define the map ΦQq:G→Q as g↦q⋅g. The action being free and proper yields a principal bundle πQ,Σ:Q→Σ, where Σ=Q/G. We denote the equivalence class of q∈Q by [q]∈Σ. In general, we use a superscript to denote the space where G acts, and brackets [⋅] to denote the corresponding equivalence classes.
The diagonal action on Q×Q is given by
ΦQ×Q:G×Q×Q→Q×Q,(g,(q0,q1))↦(g⋅q0,g⋅q1). | (2.1) |
Likewise, the lift of the action to the cotangent bundle is given by
ΦT∗Q:G×T∗Q→T∗Q,(g,pq)↦((dΦQg−1)∗g⋅q(pq)), |
where the superscript ∗ denotes the adjoint map. In other words, for each vg⋅q∈Tg⋅qQ we have
⟨g⋅pq,vg⋅q⟩=⟨pq,(dΦQg−1)g⋅q(vg⋅q)⟩. |
The infinitesimal generators (or fundamental vector fields) of the action ΦQ are denoted by ξQ∈X(Q) for each ξ∈g, where g is the Lie algebra of G, and analogously for the actions defined on the other spaces. In the same fashion, the momentum map J:T∗Q→g∗ of the action is defined by ⟨J(pq),ξ⟩=⟨pq,ξQ(q)⟩ for each pq∈T∗Q and ξ∈g.
Now we suppose that Q is a vector space, which allows us to identify
TQ=Q×Q,T∗Q≃Q×Q∗. | (2.2) |
In addition, assume that G⊂Q is a vector subspace* acting by addition, i.e., g⋅q=g+q for each g∈G and q∈Q. In this case, we have g−1=−g and the action on T∗Q reduces to,
*Recall that any vector space can be regarded as a Lie group with the additive structure.
ΦT∗Q:G×T∗Q→T∗Q,(g,(q0,p1))↦(g+q0,p1). | (2.3) |
To conclude, note that g=G and g∗=G∗, and that the exponential map is the identity. Hence, ξQ(q)=ξ for each ξ∈g and q∈Q. Subsequently, the momentum map is given by ⟨J(q0,p0),ξ⟩=⟨p0,ξ⟩ for each (q0,p0)∈T∗Q and ξ∈g.
Discrete principal connections were first introduced in [14] and further studied in [9]. Let Q be a smooth manifold and G be a Lie group acting freely and properly on Q.
Definition 2.1. A discrete principal connection on the principal bundle πQ,Σ:Q→Σ is a (smooth) function ωd:Q×Q→G such that
1. ωd(q0,q0)=e, the identity element, for each q0∈Q.
2. ωd(g0⋅q0,g1⋅q1)=g1ωd(q0,q1)g−10 for each (q0,q1)∈Q×Q and g0,g1∈G.
Discrete principal connections are not generally defined globally on Q×Q, as its global existence implies a global trivialization of TQ. Instead, it is only semi-globally defined on a G-invariant open subset U⊂Q×Q containing the diagonal, i.e., (q0,q0)∈U for each q0∈Q. Nevertheless, in the following we assume that they are globally defined in order to simplify the notation.
A discrete principal connection ωd enables us to define the discrete horizontal bundle as
Hd={(q0,q1)∈Q×Q∣ωd(q0,q1)=e}⊂Q×Q. |
In addition, ωd induces a discrete horizontal lift, i.e., a map hd:Q×Σ→Q×Q that is the inverse of the diffeomorphism (idQ×πQ,Σ)|Hd:Hd→Q×Σ. We denote ¯hd=π2∘hd:Q×Σ→Q, where π2 denotes the projection onto the second component.
Suppose that Q is a vector space and G⊂Q is a vector subspace acting by addition. Therefore, Σ=Q/G is a vector space and the projection πQ,Σ:Q→Σ is linear. In this case, we assume that the horizontal lift, hd:Q×Σ→Q×Q, is a linear map (where the vector structure on the product is given by the direct sum). This, in turn, ensures that ¯hd:Q×Σ→Q is also linear.
Working in a trivialization of πQ,Σ, i.e., supposing that Q=Σ×G with πQ,Σ=π1 and the vector structure given by the direct sum, then the horizontal lift of the discrete connection is determined by a map hd:Q×Σ→G defined by hd=π2∘¯hd, i.e.,
¯hd(q0,x1)=(x1,hd(q0,x1)),q0=(x0,g0)∈Q,x1∈Σ. |
Of course, hd is also linear and, from [9, Equation (4.2)], it satisfies
ωd(q0,q1)=g1−hd(q0,x1),q0,q1∈Q. |
In particular, hd(q0,x0)=g0 and hd(g+q0,x1)=g+hd(q0,x1), for each g∈G (to obtain this second equation we have used the equivariance of ωd).
On the other hand, the dual of Q is given by Q∗=Σ∗×G∗, and the adjoint of hd can be written as h∗d=(h∗d,Q,h∗d,Σ):G∗→Q∗×Σ∗ for some linear maps h∗d,Q:G∗→Q∗ and h∗d,Σ:G∗→Σ∗. They are related to the adjoint of ¯hd as follows
¯h∗d(p0)=(h∗d,Q(r0),w0+h∗d,Σ(r0)),p0=(w0,r0)∈Q∗. | (2.4) |
Similarly, we denote by hd,Q:Σ→G the adjoint map of h∗d,Q, and analogously for hd,Σ:Σ→G. In fact, we have hd,Q(q0)=hd(q0,0) and hd,Σ(x1)=hd(0,x1). Hence,
hd(q0,x1)=hd,Q(q0)+hd,Σ(x1). | (2.5) |
For the sake of simplicity, we introduce the map h0d:Σ×Σ→G, where h0d(x0,x1)=hd((x0,0),x1). Lastly, observe that hd:Q×Σ→G may be regarded locally as a map defined on (Σ×G)×Σ. For this reason, we denote its partial derivatives by
D1hd(q0,x1)=∂hd∂q0(q0,x1)=(∂hd∂x0(x0,g0,x1),∂hd∂g0(x0,g0,x1)),D2hd(q0,x1)=∂hd∂x1(q0,x1), |
for each (q0,x1)=((x0,g0),x1)∈(Σ×G)×Σ. Due to the linearity of hd, they are given by
D1hd(q0,x1)(q)=hd(q,0),D2hd(q0,x1)(x)=hd(0,x),q∈Q,x∈Σ. | (2.6) |
We conclude with the following straightforward result.
Lemma 2.2. Let Q=Σ×G be a trivialization of πQ,Σ. Then for each q0=(x0,g0)∈Q and p0=(w0,r0)∈Q∗ we have J(q0,p0)=r0.
Let us briefly recall the formulation of discrete Dirac mechanics introduced in [15,16]. Here, we present only the unconstrained case. In the following, let Q be a vector space.
The Tulczyjew triple consists of three diffeomorphisms defined between the iterated tangent and cotangent bundles of a smooth manifold (cf. [40]).
![]() |
If ΘT∗(T∗Q)∈Ω1(T∗(T∗Q)) and ΘT∗(TQ)∈Ω1(T∗(TQ)) denote the tautological 1-forms on T∗(T∗Q) and T∗(TQ), respectively, then the Tulczyjew triple induce a symplectic form on T(T∗Q),
ΩT(T∗Q)=−d(κ∗QΘT∗(TQ))=d((Ω♭)∗ΘT∗(T∗Q))∈Ω2(T(T∗Q)). |
Remark 2.3. Given a continuous Lagrangian, L:TQ→R, the Tulczyjew [34] and the Dirac [40] approaches of mechanics make use of the Tulczyjew triple to define the induced Dirac structure on T∗Q,
D(pq)={(vpq,αpq)∈T(T∗Q)⊕T∗(T∗Q)∣αpq=Ω♭(vpq)}=graphΩ♭,pq∈T∗Q, |
and the Dirac differential,
DL=γQ∘dL:TQ→T∗(T∗Q). |
Then, the Lagrange–Dirac equations for the vector field X:T∗Q→T(T∗Q) are given by
(X(pq),DL(vq))∈D(pq),vq∈TQ,pq=FL(vq)∈T∗Q, |
where FL:TQ→T∗Q is the Legendre transform of the Lagrangian. The key idea of discrete Dirac mechanics is to build a discrete analogue of the Tulczyjew triple that retains the symplecticity of the maps involved. In turn, the discrete Tulczyjew triple will be used to construct the discrete analogue of the induced Dirac structure. To that end, generating functions are utilized to construct the symplectic maps.
By means of the Poincaré Lemma (see [16, § 3.2] for details), it can be shown that a map F:T∗Q→T∗Q, given by (q0,p0)↦(q1,p1) is symplectic if and only if there exists a function S1:Q×Q→R, known as the Type 1 generating function, such that p0=−D1S1(q0,q1) and p1=D2S1(q0,q1) for each (q0,q1)∈Q×Q. We denote by ι1:Q×Q→T∗Q×T∗Q the map defined as (q0,q1)↦((q0,p0),(q1,p1)), and arrive at the following commutative diagram.
![]() |
An analogous conclusion may be reached by using a function S2:Q×Q∗→R, known as Type 2 generating function. In such case, we obtain a map
Ω♭d+:T∗Q×T∗Q→T∗(Q×Q∗),((q0,p0),(q1,p1))↦(q0,p1,p0,q1). |
This way, we define the (+)-discrete Tulczyjew triple as follows,
![]() |
(2.7) |
The discrete triple preserve the symplecticity of the continuous triple in the sense that the following is a natural symplectic form on T∗Q×T∗Q,
ΩT∗Q×T∗Q=−d((κdQ)∗ΘT∗(Q×Q))=d((Ω♭d+)∗ΘT∗(Q×Q∗))∈Ω2(T∗Q×T∗Q). |
On the other hand, a function S3:Q∗×Q→R, known as Type 3 generating function, may be used to get a map
Ω♭d−:T∗Q×T∗Q→T∗(Q∗×Q),((q0,p0),(q1,p1))↦(p0,q1,−q0,−p1). |
By using Ω♭d− instead of Ω♭d+, we arrive to an analogous diagram called the (−)-discrete Tulczyjew triple, which also inherits the symplecticity properties of the continuous triple.
![]() |
(2.8) |
Definition 2.4. The (+)-discrete induced Dirac structure is defined as
Dd+={(z0,z1,αz+)∣z0,z1∈T∗Q,z+=(q0,p1),αz+=Ω♭d+(z0,z1)}⊂(T∗Q×T∗Q)×T∗(Q×Q∗). |
where z=(q,p)∈T∗Q≃Q×Q∗. Similarly, the (−)-discrete induced Dirac structure is defined as
Dd−={(z0,z1,αz−)∣z0,z1∈T∗Q,z−=(p0,q1),αz−=Ω♭d−(z0,z1)}⊂(T∗Q×T∗Q)×T∗(Q∗×Q). |
Remark 2.5. A Dirac structure on a smooth manifold M is a maximally isotropic subbundle of its Pontryagin bundle, TM⊕T∗M (see, for example, [40]). Recall that the Whitney sum is a fibered sum over M, i.e., its elements are of the form (vx,αx)∈TxM×T∗xM for each x∈M. Note that π1(z0,z1)=z0≠z+=π1(αz+), where π1 denotes the projection onto the first component. Subsequently, (z0,z1,αz+) are not elements of the Pontryagin bundle of M=T∗Q and, hence, the (+)-discrete induced Dirac structure Dd+ defined above is not a Dirac structure on T∗Q in the sense of Dirac structures on manifolds. The same holds for the (−)-discrete induced Dirac structure. Despite this, we refer to these objects as discrete induced Dirac structures, in order to be consistent with the existing literature on discrete Dirac mechanics [16,31].
Although these discrete structures are not Dirac structures themselves, the discrete Tulczyjew structure is still present. Therefore, the maps involved are symplectic and, hence, they can be used to construct variational integrators.
Remark 2.6. It is worth noting that a new approach to discrete Dirac mechanics has been introduced in [8]. In this proposed approach, the discrete structures are actual Dirac structures, which allows one to apply the previous results found in the literature for Dirac mechanics. It would be interesting to explore a reduction theory for this new discrete Dirac mechanics and to compare it with the one given in the present paper. We leave this for future work.
Given a (possibly degenerate) discrete Lagrangian Ld:Q×Q→R, its derivative is the map dLd:Q×Q→T∗(Q×Q) given by
dLd(q0,q1)=(q0,q1,D1Ld(q0,q1),D2Ld(q0,q1)),(q0,q1)∈Q×Q, | (2.9) |
where Di denotes the partial derivative with respect to the i-th component, i=1,2. The (+)-discrete Dirac differential is the map
D+Ld=γd+Q∘dLd:Q×Q⟶T∗(Q×Q∗). |
Analogously, the (−)-discrete Dirac differential is the map
D−Ld=γd−Q∘dLd:Q×Q⟶T∗(Q∗×Q). |
At last, a discrete vector field on T∗Q is a sequence
Xd={Xkd=((qk,pk),(qk+1,pk+1))∈T∗Q×T∗Q∣0≤k≤N−1}. |
Definition 2.7 ((+)-discrete implicit Lagrangian system). A (+)-discrete implicit Lagrangian system, also called a (+)-discrete Lagrange–Dirac system, is a pair (Ld,Xd), where Ld is a discrete Lagrangian on Q and Xd is a discrete vector field on T∗Q, satisfying the (+)-discrete Lagrange–Dirac equations, i.e.,
(Xkd,D+Ld(qk,q+k))∈Dd+,0≤k≤N−1. |
The equations are locally given by
q+k=qk+1,pk+1=D2Ld(qk,q+k),pk=−D1Ld(qk,q+k),0≤k≤N−1. |
Definition 2.8 ((−)-discrete implicit Lagrangian system). A (−)-discrete implicit Lagrangian system, also called a (−)-discrete Lagrange–Dirac system, is a pair (Ld,Xd), where Ld is a discrete Lagrangian on Q and Xd is a discrete vector field on T∗Q, satisfying the (−)-discrete Lagrange–Dirac equations, i.e.,
(Xkd,D−Ld(q−k+1,qk+1))∈Dd−,0≤k≤N−1. |
The equations are locally given by
qk=q−k+1,pk+1=D2Ld(q−k+1,qk+1),pk=−D1Ld(q−k+1,qk+1),0≤k≤N−1. |
Since we are considering the unconstrained case, both the (+) and (−)-discrete Lagrange–Dirac equations are equivalent to the discrete Euler–Lagrange equations [27].
The discrete Lagrange–Dirac equations may also be obtained from a variational principle, as shown in [16]. As above, there exist two possible choices when performing discretization. Firstly, the (+)-discrete Pontryagin bundle is the (vector) bundle over Q given by
(Q×Q)⊕Q(Q×Q∗)≃Q×Q×Q∗={(q0,q+0,p1)∣q0,q+0∈Q,p1∈Q∗}. |
Given a discrete Lagrangian Ld:Q×Q→R, the (+)-discrete Lagrange–Pontryagin action is the discrete augmented action defined as
S+Ld[(qk,q+k,pk+1)Nk=0]=N−1∑k=0(Ld(qk,q+k)+⟨pk+1,qk+1−q+k⟩). | (2.10) |
The (+)-discrete Lagrange–Pontryagin principle,
δS+Ld[(qk,q+k,pk+1)Nk=0]=0, | (2.11) |
is obtained by enforcing free variations {(δqk,δq+k,δpk+1)∈Q×Q×Q∗∣0≤k≤N} that vanish at the endpoints, i.e., δq0=δqN=0.
Theorem 2.9. The (+)-discrete Lagrange–Pontryagin principle is equivalent to the (+)-discrete Lagrange–Dirac equations.
On the other hand, the (−)-discrete Pontryagin bundle is given by
(Q×Q)⊕Q(Q∗×Q)≃Q×Q∗×Q={(q−1,p0,q1)∣q−1,q1∈Q,p0∈Q∗}. |
The (−)-discrete Lagrange–Pontryagin action is defined as
S−Ld[(q−k+1,pk,qk+1)Nk=0]=N−1∑k=0(Ld(q−k+1,qk+1)+⟨pk,qk−q−k+1⟩). | (2.12) |
The (−)-discrete Lagrange–Pontryagin principle,
δS−Ld[(q−k+1,pk,qk+1)Nk=0]=0, | (2.13) |
is obtained by enforcing free variations {(δq−k+1,δpk,δqk+1)∈Q×Q×Q∗∣0≤k≤N} that vanish at the endpoints, i.e., δq0=δqN=0.
Theorem 2.10. The (−)-discrete Lagrange–Pontryagin principle is equivalent to the (−)-discrete Lagrange–Dirac equations.
Let Q be a vector space and G⊂Q be a vector subspace acting by addition on Q. In this section we will show that the discrete induced Dirac structure on Q is G-invariant and we will reduce it to the corresponding quotient.
Let ωd:Q×Q→G be a discrete connection form on πQ,Σ. We define a right trivialization of TQ=Q×Q as
λd:Q×Q→Q×(Σ×G),(q0,q1)↦(q0,[q1],ωd(q0,q1)). |
Observe that it is a linear map with the vector structure of Q×Q given by the direct sum. Using [9, Remark 4.3] it is straightforward to check that λd is an isomorphism (of bundles over TΣ=Σ×Σ) with inverse given by
λ−1d:Q×(Σ×G)→Q×Q,(q0,x1,g1)↦(q0,g1+¯hd(q0,x1)). |
The action of G on Q×Q induces an action on Q×(Σ×G) by means of λd. Using the equivariance of ωd, such an action is given by
g⋅(q0,x1,g1)=(g+q0,x1,g1),g∈G,(q0,x1,g1)∈Q×(Σ×G). |
By construction, λd is equivariant, i.e., λd∘ΦQ×Qg=ΦQ×(Σ×G)g∘λd for each g∈G. Subsequently, it descends to a left trivialization of (Q×Q)/G, i.e., an isomorphism of the corresponding quotients,
[λd]:(Q×Q)/G⟶(Q×(Σ×G))/G. |
Furthermore, note that (Q×(Σ×G))/G≃Σ×(Σ×G) via the isomorphism
[q0,x1,g1]⟼([q0],x1,g1). | (3.1) |
Remark 3.1. For the (−)-case, it will be useful to trivialize the first factor instead, i.e., we consider the map
˜λd:Q×Q→(Σ×G)×Q,(q0,q1)↦([q0],ωd(q1,q0),q1). |
Of course, all the computations performed for λd are also valid for ˜λd by exchanging the order of the factors.
On the other hand, we define a right trivialization of T∗Q≃Q×Q∗ as
ˆλd:Q×Q∗→Q×(Σ∗×g∗),(q0,p0)↦(q0,π2∘¯h∗d(p0),J(q0,p0)). |
Again, this trivialization is a linear map with the vector structure on Q×Q∗ given by the direct sum.
Remark 3.2. Observe that the adjoint of the projection πQ,Σ:Q→Σ yields a canonical embedding of Σ∗ into Q∗. However, there is not a canonical linear projection of Q∗ onto Σ∗. The discrete principal connection gives a choice of this projection via the adjoint of the horizontal lift, thus yielding the following split
Q∗=im(π∗Q,Σ)⊕ker(π2∘¯h∗d). |
In addition, ⟨π∗Q,Σ(w),ξQ(q0)⟩=0 for every w∈Σ∗ and ξ∈g, so we have
im(π∗Q,Σ)={ξQ(q0)∈Q∣ξ∈g}0, |
where the superscript 0 denotes the annihilator.
Using the previous remark, it can be seen that the inverse of ˆλd is given by
ˆλ−1d:Q×(Σ∗×g∗)→Q×Q∗,(q0,w0,μ0)↦(q0,π∗Q,Σ(w0)+(μ0)Q(q0)), |
where (μ0)Q(q0)∈Q∗ is implicitly defined by the relations ⟨(μ0)Q(q0),ξQ(q0)⟩=⟨μ0,ξ⟩ for each ξ∈g and (π2∘¯h∗d)((μ0)Q(q0))=0.
It is easy to check that the action of G on Q×(Σ∗×g∗) induced by ˆλd is given by
g⋅(q0,w0,μ0)=(g+q0,w0,μ0),g∈G,(q0,w0,μ0)∈Q×(Σ∗×g∗). |
Remark 3.3. For the (−)-case, it will be useful to trivialize the first factor instead. To that end, we consider the map
ˇλd:Q∗×Q→(Σ∗×g∗)×Q,(p0,q0)↦(π2∘¯h∗d(p0),J(q0,p0),q0). |
As for ˜λd, all the computations performed for ˆλd are also valid for ˇλd by exchanging the order of the factors.
Since Q×Q, Q×(Σ×G), Q×Q∗ and Q×(Σ∗×g∗) are vector spaces, we may identify their tangent and cotangent bundles as in (2.2), e.g., T∗(Q×Q)=Q×Q×Q∗×Q∗. Furthermore, we may consider the diagonal actions of G on T(Q×Q) and T(Q×Q∗), as in (2.1). Likewise, on T∗(Q×Q) and T∗(Q×Q∗) we consider the cotangent lift of the action, as in (2.3). In turn, these actions may be transferred to the corresponding (co)tangent bundles of Q×(Σ×G) and Q×(Σ∗×g∗) using the maps λd and ˆλd, and their adjoint maps, accordingly. Note that since these maps are linear, their derivatives are the maps themselves. This can be done because λd and ˆλd are linear isomorphisms. For instance, the action of G on T∗(Q×(Σ∗×g∗)) is induced from the action on T∗(Q×Q∗) using the map ˆλd and its adjoint, as well as their inverses.
In order to study the explicit expression of the maps introduced above, we choose a trivialization Q=Σ×G of πQ,Σ as in Section 2.2.1. Using the local expression of the discrete connection, we have
λd(q0,q1)=(q0,x1,g1−hd(q0,x1)),(q0,q1)∈Q×Q. | (3.2) |
Hence,
λ−1d(q0,x1,g1)=(q0,(x1,g1+hd(q0,x1))),(q0,x1,g1)∈Q×(Σ×G). | (3.3) |
Its adjoint is given by
λ∗d(p0,w1,r1)=(p0−⟨r1,hd(⋅,0)⟩,(w1−⟨r1,hd(0,⋅)⟩,r1)), | (3.4) |
for each (p0,w1,r1)∈Q∗×(Σ∗×G∗). Hence,
(λ∗d)−1(p0,p1)=(p0+⟨r1,hd(⋅,0)⟩,w1+⟨r1,hd(0,⋅)⟩,r1), | (3.5) |
for each (p0,p1)∈Q∗×Q∗. Now we perform analogous computations for ˆλd, where we used (2.4) and Lemma 2.2,
ˆλd(q0,p0)=(q0,w0+h∗d,Σ(r0),r0),(q0,p0)∈Q×Q∗. | (3.6) |
The inverse is given by
ˆλ−1d(q0,w0,μ0)=(q0,(w0−h∗d,Σ(μ0),μ0)),(q0,w0,μ0)∈Q×(Σ∗×g∗). | (3.7) |
Likewise, its adjoint is given by
ˆλ∗d(p1,x1,ξ1)=(p1,(x1,hd,Σ(x1)+ξ1)),(p1,x1,ξ1)∈Q∗×(Σ×g). | (3.8) |
At last, we have
(ˆλ∗d)−1(p1,q1)=(p1,x1,g1−hd,Σ(x1)),(p1,q1)∈Q∗×Q. | (3.9) |
On the other hand, observe that the group action is locally given by
g+q0=(x0,g+g0),q0=(x0,g0)∈Q,g∈G, |
where we identify G≃{0}×G⊂Q. Using the local expression for the trivializations and their adjoints, we obtain the local expression for the actions of G on the (co)tangent bundles of Q×(Σ×G) and Q×(Σ∗×g∗).
Proposition 3.4. The action of G on T∗(Q×(Σ∗×g∗)) is locally given by
g⋅((q0,w0,μ0),(p1,x1,ξ1))=((g+q0,w0,μ0),(p1,x1,g+ξ1)), |
for each g∈G, (q0,w0,μ0)∈Q×(Σ∗×g∗) and (p1,x1,ξ1)∈Q∗×(Σ×g).
Analogously, the action on T(Q×(Σ∗×g∗)) is locally given by
g⋅((q0,w0,μ0),(q1,w1,μ1))=((g+q0,w0,μ0),(g+q1,w1,μ1)), |
for each g∈G and (q0,w0,μ0),(q1,w1,μ1)∈Q×(Σ∗×g∗).
Proof. As explained at the end of the previous section, the action of G on T∗(Q×(Σ∗×g∗)) is induced from the action on T∗(Q×Q∗). Namely,
![]() |
The computation for T(Q×(Σ∗×g∗)) is analogous.
To conclude, by the previous proposition, we may define the following local isomorphisms,
T(Q×(Σ∗×g∗))/G≃Σ×(Σ∗×g∗)×Q×(Σ∗×g∗),[(q0,w0,μ0),(q1,w1,μ1)]↦(x0,w0,μ0,−g0+q1,w1,μ1), | (3.10) |
and
T∗(Q×(Σ∗×g∗))/G≃Σ×(Σ∗×g∗)×Q∗×(Σ×g),[(q0,w0,μ0),(p1,x1,ξ1)]↦(x0,w0,μ0,p1,x1,−g0+ξ1). | (3.11) |
Remark 3.5. By using ˇλd instead of ˆλd (recall Remark 3.3), we arrive at analogous results. In particular, we have the isomorphisms
T(Q×(Σ∗×g∗))/G≃Q×(Σ∗×g∗)×Σ×(Σ∗×g∗), |
and
T∗((Σ∗×g∗)×Q)/G≃(Σ∗×g∗)×Σ×(Σ×g)×Q∗. |
The definition of invariance for (continuum) Dirac structures [42] can be extended to the discrete setting. More specifically, Dd+ is said to be G-invariant if for each g∈G and (z0,z1,αz+)∈Dd+ we have
(ΦT∗Qg(z0),ΦT∗Qg(z1),ΦT∗(Q×Q∗)g(αz+))∈Dd+. |
Similarly, Dd− is said to be G-invariant if for each g∈G and (z0,z1,αz−)∈Dd− we have
(ΦT∗Qg(z0),ΦT∗Qg(z1),ΦT∗(Q∗×Q)g(αz−))∈Dd−. |
Proposition 3.6. The discrete induced Dirac structures Dd+ and Dd− are G-invariant.
Proof. Let g∈G and (z0,z1,αz+)∈Dd+. By definition, we have
αz+=Ω♭d+(z0,z1)=(q0,p1,p0,q1). |
Recall that the actions are given by
ΦT∗Qg(q0,p0)=(g+q0,p0) |
and
ΦT∗(Q×Q∗)g(q0,p0,p1,q1)=(g+q0,p0,p1,g+q1), |
respectively. Hence,
˜zi=ΦT∗Qg(zi)=(g+qi,pi),i=0,1, |
and
˜α˜z+=ΦT∗(Q×Q∗)g(αz+)=(g+q0,p1,p0,g+q1), |
where ˜z+=(g+q0,p1). It immediately follows that Ω♭d+(˜z0,˜z1)=˜α˜z+, which establishes the desired result. The computation for Dd− is analogous.
On the other hand, the right trivialization ˆλd allows Dd+ to induce a (+)-discrete Dirac structure on Q×(Σ∗×g∗),
ˆDd+={(ˆz0,ˆz1,ˆαˆz+)∣z0,z1∈Q×Q∗,ˆαˆz+∈T∗ˆz+(Q×(Σ∗×g∗)),z+=(q0,p1),(z0,z1,(ˆλ−1d,ˆλ∗d)(ˆαˆz+))∈Dd+}, |
where, for the sake of simplicity, we let ˆz=ˆλd(z) for each z=(q,p)∈Q×Q∗. Equivalently, Ω♭d+ induces a map ˆΩ♭d+ between the trivialized spaces by imposing the commutativity of the following diagram,
![]() |
This way, ˆDd+ can be regarded as the (+)-discrete Dirac structure induced by ˆΩ♭d+, i.e.,
ˆDd+={(ˆz0,ˆz1,ˆαˆz+)∣ˆz0,ˆz1∈Q×(Σ∗×g∗),ˆαˆz+∈T∗ˆz+(Q×(Σ∗×g∗)),ˆz+=ˆλd(q0,p1),ˆΩ♭d+(ˆz0,ˆz1)=ˆαˆz+}. |
Of course, the G-invariance of Dd+ implies the G-invariance of ˆDd+, since we have constructed the actions on the trivialized space so that ˆλd is equivariant.
The same stands for the (−)-discrete Dirac structure. Namely, we have the following diagram,
![]() |
Hence, we define
ˆDd−={(ˆz0,ˆz1,ˆαˆz−)∣ˆz0,ˆz1∈Q×(Σ∗×g∗),ˆαˆz−∈T∗ˆz−((Σ∗×g∗)×Q),ˆz−=ˇλd(p0,q1),ˆΩ♭d−(ˆz0,ˆz1)=ˆαˆz−}. |
The G-invariance of ˆDd+ ensures that it descends to a discrete Dirac structure on the quotient space. Since Ω♭d+ and ˆλd are equivariant, so is ˆΩ♭d+, which induces a well-defined map between the quotient spaces,
[ˆΩ♭d+]:[(Q×(Σ∗×g∗))×(Q×(Σ∗×g∗))]/G⟶[T∗(Q×(Σ∗×g∗))]/G. |
Then, the reduced (+)-discrete Dirac structure is the structure induced by this map, i.e.,
[ˆDd+]={([ˆz0,ˆz1],[ˆαˆz+])∣[ˆz0,ˆz1]∈[(Q×(Σ∗×g∗))×(Q×(Σ∗×g∗)]/G,[ˆαˆz+]∈[T∗(Q×(Σ∗×g∗))]/G,[ˆΩ♭d+]([ˆz0,ˆz1])=[ˆαˆz+]}. | (3.12) |
Locally, identifications (3.10) and (3.11) enable us to regard [ˆΩ♭d+] as a map between the trivializations,
[ˆΩ♭d+]:Σ×(Σ∗×g∗)×Q×(Σ∗×g∗)⟶Σ×(Σ∗×g∗)×Q∗×(Σ×g). |
Lemma 3.7. Working in a trivialization and using the above identification, we have
[ˆΩ♭d+](x0,w0,μ0,q1,w1,μ1)=(x0,w1,μ1,(w0−h∗d,Σ(μ0),μ0),x1,g1−hd,Σ(x1)), |
for each (x0,w0,μ0,q1,w1,μ1)∈Σ×(Σ∗×g∗)×Q×(Σ∗×g∗).
Proof. We employ the explicit local expression computed in the previous sections,
![]() |
Observe that [ˆΩ♭d+] is a bundle morphism covering the identity if we regard the previous maps as bundles over Σ with the projection onto the first component.
Proposition 3.8. Locally, the reduced (+)-discrete Dirac structure is given by
[ˆDd+]={((x0,w0,μ0,q1,w1,μ1),(x0,w1,μ1,p,x1,ξ))∣p=(w0−h∗d,Σ(μ0),μ0),ξ=g1−hd,Σ(x1)}⊂(Σ×(Σ∗×g∗)×Q×(Σ∗×g∗))×(Σ×(Σ∗×g∗)×Q∗×(Σ×g)). |
In the same fashion, we may define the reduced (−)-discrete Dirac structure as
[ˆDd−]={([ˆz0,ˆz1],[ˆαˆz−])∣[ˆz0,ˆz1]∈[(Q×(Σ∗×g∗))×(Q×(Σ∗×g∗))]/G,[ˆαˆz−]∈[T∗((Σ∗×g∗)×Q)]/G,[ˆΩ♭d−]([ˆz0,ˆz1])=[ˆαˆz−]}. | (3.13) |
By analogous computations using Remark 3.5, we arrive at the local expressions.
Lemma 3.9. Locally, we have
[ˆΩ♭d−](q0,w0,μ0,x1,w1,μ1)=(w0,μ0,x1,−x0,−g0+hd,Σ(x0),(−w1+h∗d,Σ(μ1),−μ1)), |
for each (q0,w0,μ0,x1,w1,μ1)∈Q×(Σ∗×g∗)×Σ×(Σ∗×g∗).
Proposition 3.10. Locally, the reduced (−)-discrete Dirac structure is given by
[ˆDd−]={((q0,w0,μ0,x1,w1,μ1),(w0,μ0,x1,−x0,ξ,p)∣ξ=−g0+hd,Σ(x0),p=(−w1+h∗d,Σ(μ1),−μ1)}⊂(Q×(Σ∗×g∗)×Σ×(Σ∗×g∗))×((Σ∗×g∗)×Σ×(Σ×g)×Q∗). |
Making use of the reduced discrete Dirac structure, we will compute the the reduced equations corresponding to a discrete Lagrange–Dirac system. Let Q be a vector space and G⊂Q be a vector subspace acting by addition on Q, and Ld:Q×Q→R be a (possibly degenerate) G-invariant discrete Lagrangian, i.e.,
Ld(g+q0,g+q1)=Ld(q0,q1),g∈G,(q0,q1)∈Q×Q. |
The invariance of the discrete Lagrangian leads to the invariance of its partial derivatives.
Lemma 4.1. If Ld is G-invariant, then so are its partial derivatives DiLd:Q×Q→Q∗, i=1,2, i.e.,
DiLd(g+q0,g+q1)=DiLd(q0,q1),(q0,q1)∈Q×Q,g∈G. |
Proof. For each q∈Q we have
⟨D1Ld(g+q0,g+q1),q⟩=limh→0Ld(g+q0+hq,g+q1)−Ld(g+q0,g+q1)h=limh→0Ld(q0+hq,q1)−Ld(q0,q1)h=⟨D1Ld(q0,q1),q⟩. |
An analogous computation establishes the result for D2Ld.
Remark 4.2. Working on a trivialization Q=Σ×G of πQ,Σ, we may regard Ld as a function defined on (Σ×G)×(Σ×G). This way, its partial derivatives can be written as
D1Ld(q0,q1)=∂Ld∂q0(q0,q1)=(∂Ld∂x0(x0,g0,x1,g1),∂Ld∂g0(x0,g0,x1,g1)), |
for each (q0,q1)=(x0,g0,x1,g1)∈(Σ×G)×(Σ×G), and analogous for D2Ld(q0,q1).
We may regard a discrete vector field, Xd+, that is a solution of the (+)-discrete Lagrange–Dirac equations, as a map
Xd+:Q×Q⟶T(Q×Q∗)=(Q×Q∗)×(Q×Q∗),(q0,q1)⟼((q0,−D1Ld(q0,q1)),(q1,D2Ld(q0,q1))). |
It follows from Lemma 4.1 that this map is G-equivariant. Similarly to Ω♭d+, this induces a map between the trivialized spaces by imposing the commutativity of the following diagram,
![]() |
Since ˆXd+ is G-equivariant, it descends to a (+)-discrete reduced vector field,
[ˆXd+]:(Q×(Σ×G))/G→T(Q×(Σ∗×g∗))/G. | (4.1) |
As above, locally we may regard it as [ˆXd+]:Σ×(Σ×G)→Σ×(Σ∗×g∗)×Q×(Σ∗×g∗).
Similarly, if Xd− is a solution of the (−)-discrete Lagrange–Dirac equations, we may trivialize it as follows,
![]() |
This way, we obtain the (−)-discrete reduced vector field,
[ˆXd−]:((Σ×G)×Q)/G→T(Q×(Σ∗×g∗))/G. | (4.2) |
Locally, we may regard it as a map [ˆXd−]:(Σ×G)×Σ→Q×(Σ∗×g∗)×Σ×(Σ∗×g∗).
The next step is to trivialize γd+Q and the exterior derivative of the discrete Lagrangian. To that end, we impose the commutativity of the following diagram,
![]() |
Furthermore, since γd+Q, λd and ˆλd are G-equivariant, so is ˆγd+Q, by construction. The same holds for ^dLd, by Lemma 4.1. By composing the previous maps, we induce the (+)-discrete Dirac differential on the trivialized spaces,
ˆD+Ld=ˆγd+Q∘^dLd:Q×(Σ×G)⟶T∗(Q×(Σ∗×g∗)). |
Due to G-equivariance, it descends to the corresponding quotients, yielding the reduced (+)-discrete Dirac differential,
[ˆD+Ld]:(Q×(Σ×G))/G⟶T∗(Q×(Σ∗×g∗))/G. | (4.3) |
Proposition 4.3. Locally, the reduced (+)-discrete Dirac differential is given by a map [ˆD+Ld]:Σ×(Σ×G)→Σ×(Σ∗×g∗)×Q∗×(Σ×g). Furthermore, for each (x0,x1,g1)∈Σ×(Σ×G), it is given by
[ˆD+Ld](x0,x1,g1)=(x0,∂Ld∂x1+h∗d,Σ(∂Ld∂g1),∂Ld∂g1,−∂Ld∂q0,x1,g1+hd,Q(x0,0)), |
where the partial derivatives of Ld are evaluated at (x0,0,x1,g1+h0d(x0,x1)).
Proof. Once again, we use the explicit local expressions computed in the previous sections,
![]() |
where the partial derivatives are evaluated at (x0,0,x1,g1+h0d(x0,x1)) and we used (2.5) in the last step.
For the (−)-case, we consider the diagram
![]() |
Subsequently, we arrive at the reduced (−)-discrete Dirac differential,
[ˆD−Ld]:((Σ×G)×Q)/G⟶T∗((Σ∗×g∗)×Q)/G. | (4.4) |
Proposition 4.4. Locally, the reduced (−)-discrete Dirac differential is given by a map [ˆD−Ld]:(Σ×G)×Σ→(Σ∗×g∗)×Σ×(Σ×g)×Q∗. Furthermore, for each (x0,g0,x1)∈(Σ×G)×Σ, it is given by
[ˆD−Ld](x0,g0,x1)=(−∂Ld∂x0−h∗d,Σ(∂Ld∂g0),−∂Ld∂g0,x1,−x0,−g0−hd,Q(x1,0),−∂Ld∂q1), |
where the partial derivatives of Ld are evaluated at (x0,g0+h0d(x1,x0),x1,0).
Define ˆLd+:Q×(Σ×G)→R by the condition ˆLd+∘λd=Ld. Clearly, it is G-invariant, thus inducing the (+)-discrete reduced Lagrangian,
ld+:(Q×(Σ×G))/G⟶R. |
Locally, we may regard it as ld+:Σ×Σ×G→R. It is easy to check that
ld+(x0,x1,g1)=Ld(x0,0,x1,g1+h0d(x0,x1)),(x0,x1,g1)∈Σ×Σ×G. | (4.5) |
Lemma 4.5. Locally, for each (x0,x1,g1)∈Σ×Σ×G we have
∂Ld∂q0=(∂ld+∂x0−⟨∂ld+∂g1,h0d(⋅,0)⟩,−⟨∂ld+∂g1,hd((0,⋅),0)⟩),∂Ld∂x1=∂ld+∂x1−⟨∂ld+∂g1,h0d(0,⋅)⟩,∂Ld∂g1=∂ld+∂g1, |
where the partial derivatives of Ld and ld+ are evaluated at (x0,0,x1,g1+h0d(x0,x1)) and (x0,x1,g1), respectively.
Proof. Let (x0,g0,x1,g′1)∈(Σ×G)×(Σ×G). Using (3.2), we obtain
Ld((x0,g0),(x1,g′1))=(ˆLd+∘λd)((x0,g0),(x1,g′1))=ˆLd+((x0,g0),x1,g′1−hd((x0,g0),x1))=ld+(x0,x1,g′1−hd((x0,g0),x1)). |
Recall that the partial derivatives of hd are given by (2.6). Using this fact, as well as the chain rule and the relation above, we obtain
∂Ld∂x0=∂ld+∂x0−⟨∂ld+∂g1,h0d(⋅,0)⟩,∂Ld∂g0=−⟨∂ld+∂g1,hd((0,⋅),0)⟩,∂Ld∂x1=∂ld+∂x1−⟨∂ld+∂g1,h0d(0,⋅)⟩,∂Ld∂g1=∂ld+∂g1. |
In the above expressions, the partial derivatives of Ld and ld+ are evaluated at (x0,g0,x1,g′1) and (x0,x1,g′1−hd((x0,g0),x1)), respectively. To conclude, we choose g0=0 and g′1=g1+h0d(x0,x1).
Gathering the results of the previous sections, we arrive at the main result of this paper.
Theorem 4.6. ((+)-discrete Lagrange–Poincaré–Dirac equations). Let (Ld,Xd+) be a (+)-discrete Lagrange–Dirac system and suppose that Ld is G-invariant. Let [ˆDd+], [ˆXd+] and [ˆD+Ld] be the reduced (+)-discrete Dirac structure, the (+)-discrete reduced vector field and the reduced (+)-discrete Dirac differential defined in (3.12), (4.1) and (4.3), respectively. Then, they satisfy the (+)-discrete Lagrange–Poincaré–Dirac equations, i.e., for each 0≤k≤N−1, we have
([ˆXd+]([qk,xk+1,gk+1]),[ˆD+Ld]([qk,x+k,g+k]))∈[ˆDd+]. |
In order to obtain its local expression, we write the discrete vector field as
[ˆXd+]={[ˆXkd+]=(xk,wk,μk,qk+1,wk+1,μk+1)∣0≤k≤N−1}. |
Subsequently, the reduced equations read as
([ˆXkd+],[ˆD+Ld](xk,x+k,g+k))∈[ˆDd+],0≤k≤N−1. |
Making use of Proposition 3.8, Proposition 4.3 and Lemma 4.5 we arrive at the local expression for the reduced discrete equations of motion,
{∂ld+∂x1−⟨∂ld+∂g1,h0d(0,⋅)⟩+h∗d,Σ(∂ld+∂g1)=wk+1,∂ld+∂g1=μk+1,−∂ld+∂x0+⟨∂ld+∂g1,h0d(⋅,0)⟩=wk−h∗d,Σ(μk),⟨∂ld+∂g1,hd((0,⋅),0)⟩=μk,x+k=xk+1,g+k+hd,Q(xk,0)=gk+1−hd,Σ(xk+1). | (4.6) |
In the above equations, partial derivatives of ld+ are evaluated at (xk,x+k,g+k).
As in the previous case, we define ˆLd−:(Σ×G)×Q→R by the condition ˆLd−∘˜λd=Ld, which induces (−)-discrete reduced Lagrangian,
ld−:((Σ×G)×Q)/G⟶R. |
Locally, it is given by ld−:Σ×G×Σ→R. It is easy to check that
ld−(x0,g0,x1)=Ld(x0,g0+h0d(x1,x0),x1,0),(x0,g0,x1)∈Σ×G×Σ. | (4.7) |
Lemma 4.7. Locally, for each (x0,x1,g1)∈Σ×Σ×G we have
∂Ld∂q0=(∂ld−∂x0−⟨∂ld−∂g0,h0d(0,⋅)⟩,∂ld−∂g0),∂Ld∂x1=∂ld−∂x1−⟨∂ld−∂g0,h0d(⋅,0)⟩,∂Ld∂g1=−⟨∂ld−∂g0,hd((0,⋅),0)⟩, |
where the partial derivatives of Ld and ld− are evaluated at (x0,g0+h0d(x1,x0),x1,0) and (x0,g0,x1), respectively.
Theorem 4.8 ((−)-discrete Lagrange–Poincaré–Dirac equations). Let (Ld,Xd−) be a (−)-discrete Lagrange–Dirac system and suppose that Ld is G-invariant. Let [ˆDd−], [ˆXd−] and [ˆD−Ld] be the reduced (−)-discrete Dirac structure, the (−)-discrete reduced vector field and the reduced (−)-discrete Dirac differential defined in (3.13), (4.2) and (4.4), respectively. Then, they satisfy the (−)-discrete Lagrange–Poincaré–Dirac equations, i.e., for each 0≤k≤N−1, we have
([ˆXd−]([xk,gk,qk+1]),[ˆD−Ld]([x−k+1,g−k+1,qk+1]))∈[ˆDd−]. |
Locally, the equations are given by
([ˆXkd−],[ˆD−Ld](x−k+1,g−k+1,xk+1))∈[ˆDd−],0≤k≤N−1. |
Making use of Proposition 3.10, Proposition 4.4 and Lemma 4.7 we arrive at the local expression for the reduced discrete equations of motion,
{∂ld−∂x0−⟨∂ld−∂g0,h0d(0,⋅)⟩+h∗d,Σ(∂ld−∂g0)=wk,∂ld−∂g0=μk,−∂ld−∂x1+⟨∂ld−∂g0,h0d(⋅,0)⟩=wk+1−h∗d,Σ(μk+1),⟨∂ld−∂g0,hd((0,⋅),0)⟩=μk+1,x−k+1=xk,g−k+1+hd,Q(xk+1,0)=gk−hd,Σ(xk). | (4.8) |
In the above equations, partial derivatives of ld− are evaluated at (x−k+1,g−k+1,xk+1).
In this section, we perform reduction of discrete Lagrange–Dirac systems from the variational point of view. As expected, we will recover the discrete Lagrange–Poincaré–Dirac equations obtained from the geometric reduction of the discrete Dirac structure. Let Q be a vector space and G⊂Q be a vector subspace acting by addition on Q.
Let ωd:Q×Q→G be a discrete connection form. Using the trivializations defined in Section 3.1, we define the following map
Λd+=(λd,ˆλd):Q×Q×Q×Q∗→Q×(Σ×G)×Q×(Σ∗×g∗). |
Again, the G-action on Q×Q×Q×Q∗ given by
g⋅(q0,q+0,q1,p1)=(g+q0,g+q+0,g+q1,p1),g∈G,(q0,q+0,q1,p1)∈Q×Q×Q×Q∗ |
induces an action on the trivialized space via Λd+.
Let Q=Σ×G be a trivialization of πQ,Σ, as in Section 2.2.1. For each q0=(x0,g0),q+0=(x+0,g+0),q1=(x1,g1)∈Q=Σ×G and p1=(w1,r1)∈Q∗=Σ∗×G∗, the local expression of Λd+ is
Λd+(q0,q+0,q1,p1)=(q0,x+0,g+0−hd(q0,x+0),q1,w1+h∗d,Σ(r1),r1). | (5.1) |
Similarly, for each q0=(x0,g0),q1=(x1,g1)∈Q, (x+0,g+0)∈Σ×G and (w1,μ1)∈Σ∗×g∗ we have
Λ−1d+(q0,x+0,g+0,q1,w1,μ1)=(q0,(x+0,g+0+hd(q0,x+0)),q1,(w1−h∗d,Σ(μ1),μ1)). | (5.2) |
At last, locally we may identify the quotient spaces as
(Q×Q×Q×Q∗)/G≃Σ×Q×Q×Q∗,[q0,q+0,q1,p1]↦(x0,−g0+q+0,−g0+q1,p1), |
and
(Q×(Σ×G)×Q×(Σ∗×g∗))/G≃Σ×(Σ×G)×Q×(Σ∗×g∗),[q0,x+0,g+0,q1,w1,μ1]↦(x0,x+0,g+0,−g0+q1,w1,μ1). | (5.3) |
In the same vein as in the previous section, we trivialize the (−)-discrete Pontryagin bundle. Namely, we define
Λd−=(˜λd,ˇλd):Q×Q×Q∗×Q→(Σ×G)×Q×(Σ∗×g∗)×Q. |
Again, the G-action on Q×Q×Q∗×Q may be transferred to the trivialized space via Λd−.
Let Q=Σ×G be a trivialization of πQ,Σ, as in Section 2.2.1. For each q0=(x0,g0),q−1=(x−1,g−1),q1=(x1,g1)∈Q=Σ×G and p0=(w0,r0)∈Q∗=Σ∗×G∗, the local expression of Λd+ is
Λd−(q−1,q1,p0,q0)=(x−1,g–1hd(q1,x−1),q1,w0+h∗d,Σ(r0),r0,q0). | (5.4) |
Similarly, for each q0=(x0,g0),q1=(x1,g1)∈Q, (x−1,g−1)∈Σ×G and (w0,μ0)∈Σ∗×g∗ we have
Λ−1d−(x−1,g−1,q1,w0,μ0,q0)=((x−1,g−1+hd(q1,x−1)),q1,(w0−h∗d,Σ(μ0),μ0),q0). | (5.5) |
At last, locally we may identify the quotient spaces as
(Q×Q×Q∗×Q)/G≃Q×Σ×Q∗×Q, |
and
((Σ×G)×Q×(Σ∗×g∗)×Q)/G≃(Σ×G)×Σ×(Σ∗×g∗)×Q. | (5.6) |
Let Ld:Q×Q→R be a (possibly degenerate) G-invariant discrete Lagrangian and consider the corresponding (+)-discrete reduced Lagrangian ld+:(Q×(Σ×G))/G→R. The (+)-discrete generalized energy is the map
Ed+:Q×Q×Q×Q∗→R,(q0,q+0,q1,p1)↦Ld(q0,q+0)+⟨p1,q1−q+0⟩. | (5.7) |
Since Ld is G-invariant, so is Ed+. Analogous to the discrete Lagrangian, we consider the trivialized energy, i.e., ˆEd+:Q×(Σ×G)×Q×(Σ∗×g∗)→R, which is defined by the condition ˆEd+∘Λd+=Ed+. Again, ˆEd+ is G-invariant, what enables us define the reduced (+)-discrete generalized energy,
ed+:(Q×(Σ×G)×Q×(Σ∗×g∗))/G⟶R. |
Lemma 5.1. Locally, the reduced (+)-discrete generalized energy is a map ed+:Σ×(Σ×G)×Q×(Σ∗×g∗)→R. Furthermore, for each (x0,x+0,g+0,q1,w1,μ1)∈Σ×(Σ×G)×Q×(Σ∗×g∗) we have
ed+(x0,x+0,g+0,q1,w1,μ1)=ld+(x0,x+0,g+0)+⟨w1−h∗d,Σ(μ1),x1−x+0⟩+⟨μ1,g1−g+0−hd((x0,0),x+0)⟩. |
Proof. It is a straightforward computation, making use of the local expressions of the maps and actions that we have computed previously,
![]() |
The following result relates the variational principles in both the original and the reduced spaces.
Theorem 5.2 (Reduced variational principle). Let Ld:Q×Q→R be a G-invariant discrete Lagrangian and {(qk,q+k,pk+1)∈Q×Q×Q∗∣0≤k≤N} be a trajectory on the (+)-discrete Pontryagin bundle. Consider the reduced trajectory, i.e.,
{[ˆqk,ˆx+k,ˆg+k,ˆqk+1,ˆwk+1,ˆμk+1]∈(Q×(Σ×G)×Q×(Σ∗×g∗))/G∣0≤k≤N−1}, |
where (ˆqk,ˆx+k,ˆg+k,ˆqk+1,ˆwk+1,ˆμk+1)=Λd+(qk,q+k,qk+1,pk+1) for 0≤k≤N−1. Then the (+)-discrete Lagrange–Pontryagin principle (2.11) is satisfied if and only if the reduced (+)-discrete Lagrange–Pontryagin principle is satisfied, i.e.,
δN−1∑k=0ed+([ˆqk,ˆx+k,ˆg+k,ˆqk+1,ˆwk+1,ˆμk+1])=0, | (5.8) |
for free variations
{(δˆqk,δˆx+k,δˆg+k,δˆwk+1,δˆμk+1)∈Q×(Σ×G)×(Σ∗×g∗)∣0≤k≤N} |
with fixed endpoints, i.e., δˆq0=δˆqN=0.
Proof. By construction, we have
S+Ld[(qk,q+k,pk+1)Nk=0]=N−1∑k=0(ˆEd+∘Λd+)(qk,q+k,qk+1,pk+1)=N−1∑k=0ˆEd+(ˆqk,ˆx+k,ˆg+k,ˆqk+1,ˆwk+1,ˆμk+1)=N−1∑k=0ed+([ˆqk,ˆx+k,ˆg+k,ˆqk+1,ˆwk+1,ˆμk+1]). |
To arrive at our conclusion, note that the free variations of the Lagrange–Pontryagin principle yield free variations on the trivialized space (with fixed endpoints), since Λd+ is a linear isomorphism.
Lastly, we show that the reduced variational equations agree with the reduced geometric equations obtained in the previous section from the reduced discrete Dirac structure.
Proposition 5.3. The variational equations obtained from the reduced (+)-discrete Lagrange–Pontryagin principle are the (+)-discrete Lagrange–Poincaré–Dirac equations.
Proof. Since the equations are local, we may work in a trivialization Q≃Σ×G of πQ,Σ. Observe that locally, (5.8) reads as
δN−1∑k=0ed+(xk,x+k,g+k,qk+1,wk+1,μk+1)=0, |
for free variations
{(δxk,δgk,δx+k,δg+k,δwk+1,δμk+1)∈Q×(Σ×G)×(Σ∗×g∗)∣0≤k≤N} |
with fixed endpoints, i.e., δx0=δxN=0 and δg0=δgN=0. Making use of Lemma 5.1 and taking variations δxk, 1≤k≤N−1, with fixed endpoints, we get
∂ld+∂x0+wk−h∗d,Σ(μk)−⟨μk+1,h0d(⋅,0)⟩=0. |
Analogously, taking variations δgk, 1≤k≤N−1, with fixed endpoints, yield
μk−⟨μk+1,hd((0,⋅),0)⟩=0. |
Now, we consider variations δx+k, 0≤k≤N−1,
∂ld+∂x1−wk+1+h∗d,Σ(μk+1)−⟨μk+1,h0d(0,⋅)⟩=0. |
Similarly, for variations δg+k, 0≤k≤N−1,
∂ld+∂g1−μk+1=0. |
Next, for variations δwk+1, 0≤k≤N−1,
xk+1−x+k=0. |
In the end, for variations δμk+1, 0≤k≤N−1,
hd,Σ(xk+1−x+k)+gk+1−g+k−h0d(xk,x+k)=0. |
In the above equations, partial derivatives of ld+ are evaluated at (xk,x+k,g+k). By gathering all the equations and rearranging terms, it is easy to check that these equations are exactly (4.6).
Last of all, we carry out the same procedure, but using the (−)-discrete reduced Lagrangian ld−:((Σ×G)×Q)/G→R. The (−)-discrete generalized energy is the map
Ed−:Q×Q×Q∗×Q→R,(q−1,q1,p0,q0)↦Ld(q−1,q1)+⟨p0,q0−q−1⟩. | (5.9) |
The trivialized energy, ˆEd−∘Λd−=Ed−, gives rise to the reduced (−)-discrete generalized energy,
ed−:((Σ×G)×Q×(Σ∗×g∗)×Q)/G⟶R. |
Lemma 5.4. Locally, the reduced (−)-discrete generalized energy is a map ed−:(Σ×G)×Σ×(Σ∗×g∗)×Q→R. Furthermore, for each (x−1,g−1,x1,w0,μ0,q0)∈(Σ×G)×Σ×(Σ∗×g∗)×Q we have
ed−(x−1,g−1,x1,w0,μ0,q0)=ld−(x−1,g−1,x1)+⟨w0−h∗d,Σ(μ0),x0−x−1⟩+⟨μ0,g0−g–1hd((x1,0),x−1)⟩. |
Theorem 5.5 (Reduced variational principle). Let Ld:Q×Q→R be a G-invariant discrete Lagrangian and {(q−k+1,pk,qk+1)∈Q×Q∗×Q∣0≤k≤N} be a trajectory on the (−)-discrete Pontryagin bundle. Consider the reduced trajectory, i.e.,
{[ˆx−k+1,ˆg−k+1,ˆqk+1,ˆwk,ˆμk,ˆqk]∈((Σ×G)×Q×(Σ∗×g∗)×Q)/G∣0≤k≤N−1}, |
where (ˆx−k+1,ˆg−k+1,ˆqk+1,ˆwk,ˆμk,ˆqk)=Λd−(q−k+1,qk+1,pk,qk) for 0≤k≤N−1. Then the (−)-discrete Lagrange–Pontryagin principle (2.13) is satisfied if and only if the reduced (−)-discrete Lagrange–Pontryagin principle is satisfied, i.e.,
δN−1∑k=0ed−([ˆx−k+1,ˆg−k+1,ˆqk+1,ˆwk,ˆμk,ˆqk])=0, | (5.10) |
for free variations
{(δˆx−k+1,δˆg−k+1,δˆqk+1,δˆwk,δˆμk,δˆqk)∈(Σ×G)×Q×(Σ∗×g∗)×Q∣0≤k≤N} |
with fixed endpoints, i.e., δˆq0=δˆqN=0.
Proposition 5.6. The variational equations obtained from the reduced (−)-discrete Lagrange–Pontryagin principle are the (−)-discrete Lagrange–Poincaré–Dirac equations.
The previous reduction theory has been developed for the linear setting, i.e., when Q is a vector space and G⊂Q is a vector subspace acting by addition on Q. Nevertheless, it can be applied when Q is an arbitrary smooth manifold and G is an abelian Lie group acting freely and properly on Q. In order to see this, we use retractions and retraction compatible charts (see, for example, [2,16]).
Definition 6.1. A retraction of a smooth manifold M is a smooth map R:TM→M such that for each m∈M we have Rm(0m)=m and (dRm)0m=idTmM, where Rm=R|TmM and we make the identification T0m(TmM)≃TmM.
Observe that the second condition ensures that Rm:TmM→M is invertible around 0m.
Definition 6.2. Let M be an n-dimensional smooth manifold and R:TM→M be a retraction of M. A coordinate chart (U,ϕ) on M is said to be compatible at m∈M with R if ϕ(m)=0 and R(vm)=ϕ−1((dϕ)m(vm)) for each vm∈TmM, where we identify TmRn≃Rn using the standard coordinates in Rn.
For the particular case of a Lie group G and g∈G, it was shown in [16, §9] that the canonical coordinates of the first kind at g∈G (cf. [21,38]) are a coordinate chart compatible with the retraction defined by RGg=Lg∘exp∘(dLg−1)g, where Lg:G→G denotes the left multiplication by g.
Proposition 6.3. Let R:TM→M be a retraction of an n-dimensional smooth manifold M and (U,ϕ) be a compatible coordinate chart on M at m∈M. Then for each† r∈U and pm∈T∗mM we have
†We will assume that the inverse of Rm is defined on the whole of U by choosing a smaller coordinate domain if necessary.
⟨pm,R−1m(r)⟩=n∑i=1piri, |
where R−1m(r)≃ri∂i and pm≃pidqi in this chart.
In other words, the previous result says that the dual pairing of TmM and T∗mM reduces to the usual Euclidean inner product on Rn when using retraction compatible charts.
In what follows, let Q be a smooth manifold and G be a connected, abelian Lie group acting freely and properly (on the left) on Q, thus yielding a principal bundle πQ,Σ:Q→Σ=Q/G. Consider retractions RΣ:TΣ→Σ and RG:TG→G of Σ and G, respectively, and a trivializing set U⊂Σ of πQ,Σ. For simplicity, we write U=Σ, so we have an identification Q≃Σ×G. Under this identification, a straightforward check shows that the map
R=(RΣ,RG):TQ→Q |
is a retraction of Q. We may use it to define (at least locally) a discrete Lagrange–Pontryagin action. Namely, given a (possibly degenerate) discrete Lagrangian Ld:Q×Q→R, the (+)-discrete Lagrange–Pontryagin action is defined as
S+Ld[(qk,q+k,pk+1)Nk=0]=N−1∑k=0(Ld(qk,q+k)+⟨pk+1,R−1qk+1(qk+1)−R−1qk+1(q+k)⟩), |
where qk,q+k∈Q and pk+1∈T∗qk+1Q. The (+)-discrete Lagrange–Pontryagin principle is obtained by enforcing free variations vanishing at the endpoints. In order for the previous expression to be well-defined, q+k must be in the neighborhood of qk+1 where Rqk+1 is invertible for each 0≤k≤N−1. This can always be achieved for bounded initial conditions by reducing the size of the time step. Furthermore, Proposition 6.3 ensures that using retraction compatible coordinate charts, this discrete action reduces to the one considered in the linear case (2.10).
In the same vein, the (−)-discrete Lagrange–Pontryagin action is defined as
S−Ld[(q−k+1,pk,qk+1)Nk=0]=N−1∑k=0(Ld(q−k+1,qk+1)+⟨pk,R−1pk(qk)−R−1pk(q−k+1)⟩), |
where q−k+1,qk+1∈Q and pk∈Q∗. Once again, Proposition 6.3 ensures that, in a retraction compatible chart, the discrete action reads as in the linear case (2.12).
On the other hand, recall that the G action on the trivialized principal bundle is given by the left multiplication, i.e., g⋅q0=(x,gg0) for each g∈G and q0=(x0,g0)∈Q≃Σ×G. Furthermore, suppose that the retraction on G is given by RGg0=Lg0∘exp∘(dLg−10)g0, as mentioned when describing the canonical coordinates of the first kind. Since G is abelian and connected, the exponential map is surjective and, hence, the inverse of RGg0 exists locally around every element of the group. As a result, when q0=(x0,g0) is fixed, an action of Tg0G on Tq0Q=Tx0Σ⊕Tg0G may be built as follows
ug0⋅(vx0,vg0)=(vx0,(RGg0)−1(RGg0(ug0)RGg0(vg0))), |
for each vx0∈Tx0Σ, and ug0,vg0∈Tg0G. When g0=0, this action has a very simple expression,
ξ⋅(vx0,ξ0)=(vx0,log(exp(ξ)exp(ξ0)))=(vx0,ξ+ξ0),vx0∈Tx0Σ,ξ,ξ0∈g, |
where we have used that G is abelian. This is the case considered in the previous sections, a vector subspace acting by addition. Note that if g0≠0, we obtain the same result by using the left translation.
In summary, the linear theory developed above is the coordinate representation of a general system with abelian group of symmetries when retraction compatible charts are used. This allows us to use the linear theory at least locally on a coordinate chart. Furthermore, if Σ and G both admit retraction compatible atlases, then a retraction compatible atlas for Q can be built such that each coordinate domain is a trivializing set for πQ,Σ. Hence, we can make computations on the whole Q by starting from a specific compatible chart and changing to another one whenever it is necessary. Since the variational principle, as well as the group action, have the same expressions in each compatible chart, the local preservation of geometric properties extends to the global setting. This is an important feature of retraction compatible atlases, since computation on local charts might otherwise lead to dynamics that is not globally well-defined. The discrete analogue of Tulczyjew dynamics (see, [34]) appears to be the discrete Dirac mechanics of [16] that we based our construction upon, so the analogous reduced discrete geometric structures for discrete Tulczyjew dynamics can be obtained from our construction.
We present two examples to illustrate the reduction theory developed above. In both of them, we employ the (+)-discrete equations.
We analyze the dynamics of a charged particle moving in a magnetic field, as presented in [25] for the continuous case. To account for gauge symmetry, we consider the Kaluza-Klein configuration space,
QK=R3×S1, |
with coordinates (q,θ), where q=(q1,q2,q3)∈R3 and θ≃eiθ∈S1. The Kaluza-Klein Lagrangian is defined as
LK(q,˙q,θ,˙θ)=12m⟨⟨˙q,˙q⟩⟩+12(⟨A(q),˙q⟩+˙θ)2, |
where m∈R+ is the mass of the particle, A∈Ω1(R3) is the magnetic potential, and ⟨⟨⋅,⋅⟩⟩ denotes the Euclidean inner product in R3. The conjugate momenta are given by
p=∂LK∂˙q=m⟨⟨˙q,⋅⟩⟩+(⟨A(q),˙q⟩+˙θ)A(q),pθ=∂LK∂˙θ=⟨A(q),˙q⟩+˙θ. |
It is clear that this Lagrangian is invariant under the tangent lifted action of S1 on QK given by θ′⋅(q,θ)=(q,θ′+θ) for each (q,θ)∈QK and θ′∈S1. Note that using these coordinates, the action is linear. The corresponding quotient is Σ=QK/S1≃R3. Choosing the principal connection ω=A+dθ∈Ω1(QK) on QK→R3, the corresponding reduced equations are the Lorentz force law together with the conservation of the momentum corresponding to θ, i.e.,
md˙qdt=ec˙q×B,˙pθ=0, | (7.1) |
where B∈X(R3) is the magnetic field corresponding to‡ B=dA∈Ω2(R3), and e=cpθ is the electric charge of the particle.
‡Recall that we can associate to each 2-form α=αiι∂i(d3q)∈Ω2(R3) a vector field α=αi∂i∈X(R3), which is known as proxy field, where ιU denotes the left interior product by U∈X(R3).
Given h>0, consider the following discrete Lagrangian
Ld(q0,θ0,q+0,θ+0;h)=hLK(q0,q+0−q0h,θ0,θ+0−θ0h). |
It is easy to check from Definition 2.1 that the following is a discrete principal connection,
ωd((q0,θ0),(q+0,θ+0))=θ+0−θ0,(q0,θ0),(q+0,θ+0)∈QK. |
Subsequently, the local map hd:QK×R3→S1 is given by hd((q0,θ0),q+0)=θ0 and hd,Σ≡0. The reduced discrete Lagrangian (4.5) is
ld(q0,q+0,θ+0;h)=Ld(q0,0,q+0,θ+0+h0d(q0,q+0))=m2h⟨⟨q+0−q0,q+0−q0⟩⟩+12h(⟨A(q0),q+0−q0⟩+θ+0)2. |
Consider an interval [0,T]⊂R and divide it into N=T/h subintervals [tk,tk+1], with tk=kh, 0≤k≤N−1. As usual, we let qk=q(tk), 0≤k≤N, and analogously for the other quantities. Similarly, we express the discrete vector field as [ˆXkd]=(qk,wk,μk,qk+1,θk+1,wk+1,μk+1). By computing the partial derivatives of the reduced discrete Lagrangian, we obtain the reduced discrete equations
{mh⟨⟨qk+1−qk,⋅⟩⟩+μk+1A(qk)=wk+1,1h(⟨A(qk),qk+1−qk⟩+θk+1)=μk+1,mh⟨⟨qk+1−qk,⋅⟩⟩−μk+1(⟨A,qk+1−qk⟩−A(qk))=wk,μk+1=μk,,0≤k≤N−1. | (7.2) |
In order to implement the above equations, we need to make a particular choice of the particle mass and charge, time interval, magnetic field and initial conditions. We express all of the magnitudes in natural units, i.e., c=1. We choose m=1, e=1 and T=20. For each q=(q1,q2,q3)∈R3, we write q=qi∂i∈TqR3≃R3 when regarded as a vector. Hence, ⟨⟨q,⋅⟩⟩=qidqi. On the other hand, we suppose that the magnetic field is constant, i.e., B(q)=B0∂z for some fixed B0∈R. The corresponding magnetic potential is
A(q)=B02(−q2dq1+q1dq2),q=(q1,q2,q3)∈R3. |
We suppose that the initial position is the origin, q0=0, and the initial velocity is ˙q0=∂1+∂3. Likewise, we choose θ0=0. Since A(q0)=A(0)=0, the corresponding initial momenta are
p0=⟨⟨˙q0,⋅⟩⟩+(⟨A(q0),˙q0⟩+˙θ)A(q0)=⟨⟨˙q0,⋅⟩⟩=dq1+dq3, |
and (pθ)0=e=1. Likewise, we have ˙θ0=(pθ)0−⟨A(q0),˙q0⟩=1. The initial position and momenta may be trivialized using (3.6),
((q0,θ0),w0,μ0)=ˆλd((q0,θ0),(p0,(pθ)0))=((0,0),(1,0,1),1). |
On the other hand, it is easy to check that the exact solution of (7.1) for B0=1 is
q(t)=(sin(t),cos(t)−1,t),0≤t≤T. |
After working out the approximate solution for different values of N and comparing it to the exact solution, we can see that the error decreases with the number of steps at a second-order rate of convergence, as shown in Table 1. In addition, Figure 1 compares both the exact and numerical trajectories for N=100, i.e., h=0.2.
N | ||q(T)−qN|| |
10 | 1.6781 |
50 | 0.25971 |
100 | 0.06626 |
200 | 0.01664 |
In this example, we investigate the double spherical pendulum. We assume that there is no friction and that the system is under a uniform gravitational field. The dynamics of the double spherical pendulum has been investigated in [20,24] and variational integrators from different perspectives have been proposed in [11,13].
For i=1,2, we denote by mi∈R+, li∈R+ and ri∈R3 the particle mass, the link length and the position of the i-th pendulum, respectively. Furthermore, we use standard coordinates ri=(r1i,r2i,r3i)∈R3 with the coordinate origin at the fixed pivot, and we suppose that the gravitational acceleration is given by g=(0,0,−g) for some fixed g∈R+. This way, the Lagrangian is
L(r1,r2,˙r1,˙r2)=12m1⟨⟨˙r1,˙r1⟩⟩+12m2⟨⟨˙r2,˙r2⟩⟩−m1gr31−m2gr32, |
where ⟨⟨⋅,⋅⟩⟩ denotes the Euclidean inner product in R3. In addition, the links connecting the particles yield the following constraints,
⟨⟨r1,r1⟩⟩=l21,⟨⟨r2−r1,r2−r1⟩⟩=l22. |
To avoid the need for constraints, we use spherical coordinates for each particle, ri=(ρi,θi,φi), i=1,2, where the origin of the first sphere is at the pivot and the origin of the second one is at the first particle, as shown in Figure 2. As such, the constraints become ρi=li, i=1,2, and may be imposed explicitly in the Lagrangian. Then, the configuration space is given by
Q=S2×S2 |
with angular coordinates (θ1,φ1,θ2,φ2). After the change of coordinates, the Lagrangian reads
L((θ1,φ1,θ2,φ2),(˙θ1,˙φ1,˙θ2,˙φ2))=12l21m1(˙φ21+˙θ21sin2φ1)+T2−gm1l1cosφ1−gm2(l1cosφ1+l2cosφ2). |
where T2 is the kinetic energy of the second pendulum,
T2=12m2(l21˙φ21+l22˙φ22+l21˙θ21sin2φ1+l22˙θ22sin2φ2+2l1l2(˙φ1˙φ2sinφ1sinφ2+˙φ1˙φ2cosφ1cosφ2cos(θ1−θ2)+˙φ1˙θ2sinφ2sin(θ1−θ2)cosφ1−˙φ2˙θ1sinφ1sin(θ1−θ2)cosφ2+˙θ1˙θ2sinφ1sinφ2cos(θ1−θ2))). |
Observe that the system is invariant by simultaneous rotation of both pendula around the Z-axis, i.e., the group of symmetries is G=S1 with the action on S2×S2 given locally by
θ⋅(θ1,φ1,θ2,φ2)=(θ+θ1,φ1,θ+θ2,φ2), |
for each (θ1,φ1,θ2,φ2)∈S2×S2 and θ∈S1. As usual, we denote the quotient by Σ=(S2×S2)/S1.
Remark 7.1. Observe that this action is not free. Indeed, it leaves invariant configurations with φ1=k1π and φ2=k2π for some k1,k2∈Z. Therefore, the following is only valid for trajectories not passing through those configurations.
At last, we perform another change of coordinates,
ϑ1=θ1+θ22,ϑ2=θ2−θ12, |
with φ1 and φ2 remaining the same. Observe that the inverse is given by θ1=ϑ1−ϑ2 and θ2=ϑ1+ϑ2. In these coordinates, the action reads
θ⋅(ϑ1,φ1,ϑ2,φ2)=(θ+ϑ1,φ1,ϑ2,φ2), |
for each (ϑ1,φ1,ϑ2,φ2)∈S2×S2 and θ∈S1.
For the sake of simplicity, we will let q0=(ϑ1,φ1,ϑ2,φ2)∈S2×S2 and x0=(φ1,ϑ2,φ2)∈(S2×S2)/S1, and analogous for q+0 and x+0. Given h>0, we define the discrete Lagrangian as
Ld(q0,q+0;h)=hL(q0+q+02,q+0−q0h),q0,q+0∈S2×S2. |
Likewise, we choose the following discrete principal connection
ωd(q0,q+0)=ϑ+1−ϑ1,q0,q+0∈S2×S2. |
In particular, the map hd:Q×Σ→G is given by hd(q0,x+0)=ϑ1. Thus, hd,Σ≡0, h∗d,Σ≡0 and h0d≡0. The reduced discrete Lagrangian is
ld(x0,x+0,ϑ+1;h)=Ld((0,φ1,ϑ2,φ2),(ϑ+1,φ+1,ϑ+2,φ+2);h), |
for each x0,x+0∈Σ and ϑ+1∈S1. Given the interval [0,T]⊂R, we divide it into N=T/h subintervals [tk,tk+1], with tk=kh, 0≤k≤N−1. We denote the discrete vector field by [ˆXkd]=(xk,wk,μk,qk+1,wk+1,μk+1), 0≤k≤N−1. Observe that wk=(w1k,w2k,w3k)∈Σ∗≃R3 and μk∈G∗≃R. Since hd((ϑ1,0),0)=ϑ1 and hd,Q(x0,0)=0, the reduced discrete equations read
{(∂ld∂φ+1,∂ld∂ϑ+2,∂ld∂φ+2)=(w11,w21,w31),μ0=μ1,(∂ld∂φ1,∂ld∂ϑ2,∂ld∂φ2)=−(w10,w20,w30),∂ld∂ϑ+1=μ0, |
where (φ1,ϑ2,φ2), μ0 and w0 are the initial conditions, and (ϑ+1,φ+1,ϑ+2,φ+2), μ1 and w1 are the unknowns. As in the previous example, by using (3.6), the momentum is given by p0=(μ0,w0).
For the numerical simulation, we need to fix the parameters of the system, as well as the initial conditions. Using SI units, we pick T=100, N=104, m1=20, m2=35, l1=500, l2=800, g=9.8, q0=(0,9/4,2,3) and (μ0,w0)=(0,0,1,1). Recall that the (+)-discrete generalized energy of the system is given by (5.7), i.e., (Ed)k=Ld(qk,q+k), where we have used that qk+1=q+k, 0≤k≤N−1. The evolution of the energy is plotted in Figure 4. Observe that it exhibits good near energy conservation, since it oscillates around a fixed value instead of exhibiting a spurious drift. This is typical of symplectic, and in particular, variational integrators, but is not generally true of standard integrators. Moreover, we have simulated the system by using the (+)-discrete Euler–Lagrange equations. The difference between the energies obtained from our reduced equations and the energy obtained from the Euler–Lagrange equations is also plotted in Figure 4. As can be seen, both methods give almost the same values for the discrete energy. However, we have observed that our method was about 75% faster than the usual discrete Euler–Lagrange equations, which suggests that the reduced integrator could be significantly faster than the unreduced one.
In this paper, we developed the theory of discrete Dirac reduction of discrete Lagrange–Dirac systems with an abelian symmetry group acting on a linear configuration space. This involves using the notion of discrete principal connections to coordinatize the quotient spaces, which allows us to study the reduction of the Dirac structure and the discrete variational principle expressed in terms of the discrete generalized energy. Both the reduced discrete Dirac structure and the reduced discrete variational principle lead to the same reduced discrete equations of motion. We also discussed the role of retractions and the atlas of retraction compatible charts in allowing us to generalize the local theory that was discussed to a discrete reduction theory that is globally well-defined on a manifold.
For future work, we will extend this to the setting of nonabelian symmetry groups, and to discrete analogues of Routh reduction, where the discrete dynamics is also restricted to the level sets of the discrete momentum. In the same vein, it would be interesting to explore discrete Dirac reduction by stages. To that end, a category containing discrete Dirac structures that is closed under quotients must be constructed and the reduction procedure must be defined on the whole category.
The first author was supported by Ministerio de Universidades, Spain, under an FPU grant and partially supported by Ministerio de Ciencia e Innovación, Spain, under grant PID2021-126124NB-I00. The second author was supported in part by the NSF under grants DMS-1411792, DMS-1345013, DMS-1813635, CCF-2112665, by AFOSR under grant FA9550-18-1-0288, and by the DoD under grant HQ00342010023 (Newton Award for Transformative Ideas during the COVID-19 Pandemic).
The authors declare there is no conflict of interest.
[1] | MOE, Standards For Teachers' Digital Literacy, Beijing, (2022). |
[2] | V. Tomé, A. M. Kılıç, A. Bargaoanu, A. Varanauskas, C. Hague, C. Sádaba, Guidelines for Teachers and Educators on Tackling Disinformation and Promoting Digital Literacy Through Education and Training, Publications Office of the European Union, 2022. |
[3] |
M. Beardsley, L. Albo, P. Aragon, D. Hernandez-Leo, Emergency education effects on teacher abilities and motivation to use digital technologies, Bri. J. Educ. Technol., 52 (2021), 1455–1477. https://doi.org/10.1111/bjet.13101 doi: 10.1111/bjet.13101
![]() |
[4] |
C. Audrin, B. Audrin, Key factors in digital literacy in learning and education: A systematic literature review using text mining, Educ. Inf. Technol., 27 (2022), 7395–7419. https://doi.org/10.1007/s10639-021-10832-5 doi: 10.1007/s10639-021-10832-5
![]() |
[5] |
A. Clark-Wilson, O. Robutti, M. Thomas, Teaching with digital technology, ZDM-Math. Educ., 52 (2020), 1223–1242. https://doi.org/10.1007/s11858-020-01196-0 doi: 10.1007/s11858-020-01196-0
![]() |
[6] | NCTM, Principles and Standards for School Mathematics, NCTM, Reston, VA, 2000. |
[7] | UNESCO, Reimagining Our Futures Together: In A New Social Contract For Education, UNESCO, Paris, 2022. |
[8] |
S. Chatterjee, K. K. Bhattacharjee, Adoption of artificial intelligence in higher education: A quantitative analysis using structural equation modelling, Educ. Inf. Technol., 25 (2020), 3443–3463. https://doi.org/10.1007/s10639-020-10159-7 doi: 10.1007/s10639-020-10159-7
![]() |
[9] |
T. Wijaya, Y. Cao, R. Weinhandl, E. Yusron, Z. Lavicza, Applying the UTAUT model to understand factors affecting micro-lecture usage by mathematics teachers in China, Mathematics, 10 (2022), 1008. https://doi.org/10.3390/math10071008 doi: 10.3390/math10071008
![]() |
[10] |
L. L. Wah, H. Hashim, Determining pre-service teachers' intention of using technology for teaching English as a second language (ESL), Sustainability, 13 (2021), 7568. https://doi.org/10.3390/su13147568 doi: 10.3390/su13147568
![]() |
[11] |
J. Sultana, Determining the factors that affect the uses of mobile cloud learning (MCL) platform Blackboard-a modification of the UTAUT model, Educ. Inf. Technol., 25 (2020), 223–238. https://doi.org/10.1007/s10639-019-09969-1 doi: 10.1007/s10639-019-09969-1
![]() |
[12] |
S. Hu, K. Laxman, K. Lee, Exploring factors affecting academics' adoption of emerging mobile technologies-An extended UTAUT perspective, Educ. Inf. Technol., 25 (2020), 4615–4635.https://doi.org/10.1007/s10639-020-10171-x doi: 10.1007/s10639-020-10171-x
![]() |
[13] |
Z. Yuan, J. Liu, X. Deng, T. Ding, T. Wijaya, Facilitating conditions as the biggest factor influencing elementary school teachers' usage behavior of dynamic mathematics software in China, Mathematics, 11 (2023), 1536. https://doi.org/10.3390/math11061536 doi: 10.3390/math11061536
![]() |
[14] |
T. T. Wijaya, Y. Zhou, T. Houghton, R. Weinhandl, Z. Lavicza, F. D. Yusop, Factors affecting the use of digital mathematics textbooks in Indonesia, Mathematics, 10 (2022), 1808. https://doi.org/10.3390/math10111808 doi: 10.3390/math10111808
![]() |
[15] |
A. Baki, T. Kösa, B. Guven, A comparative study of the effects of using dynamic geometry software and physical manipulatives on the spatial visualisation skills of pre‐service mathematics teachers, Bri. J. Educ. Technol., 42 (2009), 291–310. https://doi.org/10.1111/j.1467-8535.2009.01012.x doi: 10.1111/j.1467-8535.2009.01012.x
![]() |
[16] |
O. Birgin, H. Acar, The effect of computer-supported collaborative learning using GeoGebra software on 11th grade students' mathematics achievement in exponential and logarithmic functions, Int. J. Math. Educ. Sci. Technol., 53 (2020), 1–18. https://doi.org/10.1080/0020739X.2020.1788186 doi: 10.1080/0020739X.2020.1788186
![]() |
[17] |
Y. Zengin, H. Furkan, T. Kutluca, The effect of dynamic mathematics software geogebra on student achievement in teaching of trigonometry, Proc. Soc. Behav. Sci., 31 (2012), 183–187. https://doi.org/10.1016/j.sbspro.2011.12.038 doi: 10.1016/j.sbspro.2011.12.038
![]() |
[18] |
M. Demir, Y. Zengin, The effect of a technology-enhanced collaborative learning environment on secondary school students' mathematical reasoning: A mixed method design, Educ. Inf. Technol., 28 (2023), 9855–9883. https://doi.org/10.1007/s10639-023-11587-x doi: 10.1007/s10639-023-11587-x
![]() |
[19] | Y. Zengin, Effectiveness of a professional development course based on information and communication technologies on mathematics teachers' skills in designing technology-enhanced task, Educ. Inf. Technol., (2023). https://doi.org/10.1007/s10639-023-11728-2 |
[20] |
Z. Yuan, X. Deng, T. Ding, L. Jing, Q. Tan, Factors influencing secondary school teachers' usage behavior of dynamic mathematics software: A partial least squares structural equation modeling (PLS-SEM) method, Electron. Res. Arch., 31 (2023), 5649–5684. https://doi.org/10.3934/era.2023287 doi: 10.3934/era.2023287
![]() |
[21] |
A. W. McCulloch, K. Hollebrands, H. Lee, T. Harrison, A. Mutlu, Factors that influence secondary mathematics teachers' integration of technology in mathematics lessons, Comput. Educ., 123 (2018), 26–40. https://doi.org/10.1016/j.compedu.2018.04.008 doi: 10.1016/j.compedu.2018.04.008
![]() |
[22] | T. Assude, C. Buteau, H. Forgasz, Factors influencing implementation of technology-rich mathematics curriculum and practices, in Mathematics Education and Technology-Rethinking the Terrain: The 17th ICMI Study, (Eds. C. Hoyles and J. B. Lagrange), Springer, (2010), 405–419. https://doi.org/10.1007/978-1-4419-0146-0_19 |
[23] | K. J. Topping, W. Douglas, D. Robertson, N. Ferguson, Effectiveness of online and blended learning from schools: A systematic review, Rev. Educ., 10 (2022). https://doi.org/10.1002/rev3.3353 |
[24] |
S. Timotheou, O. Miliou, Y. Dimitriadis, S. V. Sobrino, N. Giannoutsou, R. Cachia, et al., Impacts of digital technologies on education and factors influencing schools digital capacity and transformation: A literature review, Educ. Inf. Technol., 28 (2023), 6695–6726. https://doi.org/10.1007/s10639-022-11431-8 doi: 10.1007/s10639-022-11431-8
![]() |
[25] |
J. Vrugte, T. Jong, S. Vandercruysse, P. Wouters, H. Oostendorp, J. Elen, How competition and heterogeneous collaboration interact in prevocational game-based mathematics education, Comput. Educ., 89 (2015), 42–52. https://doi.org/10.1016/j.compedu.2015.08.010 doi: 10.1016/j.compedu.2015.08.010
![]() |
[26] |
M. S. Alabdulaziz, COVID-19 and the use of digital technology in mathematics education, Educ. Inf. Technol., 26 (2021), 7609–7633. https://doi.org/10.1007/s10639-021-10602-3 doi: 10.1007/s10639-021-10602-3
![]() |
[27] |
G. Bozkurt, K. Ruthven, Classroom-based professional expertise: A mathematics teacher's practice with technology, Educ. Stud. Math., 94 (2017), 309–328. https://doi.org/10.1007/s10649-016-9732-5 doi: 10.1007/s10649-016-9732-5
![]() |
[28] |
M. H. Hussein, S. H. Ow, M. M. Elaish, E. O. Jensen, Digital game-based learning in K-12 mathematics education: A systematic literature review, Educ. Inf. Technol., 27 (2022), 2859–2891. https://doi.org/10.1007/s10639-021-10721-x doi: 10.1007/s10639-021-10721-x
![]() |
[29] | N. Nkopodi, M. Mosimege, Incorporating the indigenous game of morabaraba in the learning of mathematics, South African J. Educ., 29 (2009). https://doi.org/10.15700/saje.v29n3a273 |
[30] |
E. Ortiz-Martínez, J. M. Santos-Jaén, M. Palacios-Manzano, Games in the classroom? Analysis of their effects on financial accounting marks in higher education, Int. J. Manage. Educ., 20 (2022), 100584. https://doi.org/10.1016/j.ijme.2021.100584 doi: 10.1016/j.ijme.2021.100584
![]() |
[31] | E. Ortiz-Martínez, J. M. Santos-Jaén, S. Marín-Hernández, Kahoot! and its effect on financial accounting marks at the university, Educ. Inf. Technol., (2023). https://doi.org/10.1007/s10639-023-11612-z |
[32] | C. K. Lo, K. F. Hew, A comparison of flipped learning with gamification, traditional learning, and online independent study: The effects on students' mathematics achievement and cognitive engagement, Interacitve Learn. Environ., 28 (2020), 464–481. https://doi.org/10.1080/10494820.2018.1541910 |
[33] |
D. Thurm, E. Vandervieren, F. Moons, P. Drijvers, B. Barzel, M. Klinger, et al., Distance mathematics education in Flanders, Germany, and the Netherlands during the COVID 19 lockdown: The student perspective, ZDM Math. Educ., 55 (2023), 79–93. https://doi.org/10.1007/s11858-022-01409-8 doi: 10.1007/s11858-022-01409-8
![]() |
[34] |
M. Wijers, V. Jonker, P. Drijvers, MobileMath: Exploring mathematics outside the classroom, ZDM Math. Educ., 42 (2010), 789–799. https://doi.org/10.1007/s11858-010-0276-3 doi: 10.1007/s11858-010-0276-3
![]() |
[35] |
G. Greefrath, C. Hertleif, H. S. Siller, Mathematical modelling with digital tools: A quantitative study on mathematising with dynamic geometry software, ZDM Math. Educ., 50 (2018), 233–244. https://doi.org/10.1007/s11858-018-0924-6 doi: 10.1007/s11858-018-0924-6
![]() |
[36] |
F. Reinhold, S. Hoch, B. Werner, J. Richter-Gebert, K. Reiss, Learning fractions with and without educational technology: What matters for high-achieving and low-achieving students?, Learn. Instr., 65 (2020), 101264. https://doi.org/10.1016/j.learninstruc.2019.101264 doi: 10.1016/j.learninstruc.2019.101264
![]() |
[37] | F. Z. Barrane, G. E. Karuranga, D. Poulin, Technology adoption and diffusion: A new application of the UTAUT model, Int. J. Innovation Technol. Manage., 15 (2018). https://doi.org/10.1142/S0219877019500044 |
[38] |
E. Fianu, C. Blewett, G. O. A. Ampong, K. S. Ofori, Factors affecting MOOC usage by students in selected Ghanaian universities, Educ. Sci., 8 (2018), 70. https://doi.org/10.3390/educsci8020070 doi: 10.3390/educsci8020070
![]() |
[39] |
V. Venkatesh, M. Morris, G. Davis, F. Davis, User acceptance of information technology: Toward a unified view, MIS Q., 27 (2003), 425–478. https://doi.org/10.2307/30036540 doi: 10.2307/30036540
![]() |
[40] |
S. S. Alghazi, S. Y. Wong, A. Kamsin, E. Yadegaridehkordi, L. Shuib, Towards sustainable mobile learning: A brief review of the factors influencing acceptance of the use of mobile phones as learning tools, Sustainability, 12 (2020), 10527. https://doi.org/10.3390/su122410527 doi: 10.3390/su122410527
![]() |
[41] |
A. Aytekin, H. Ozkose, A. Ayaz, Unified theory of acceptance and use of technology (UTAUT) in mobile learning adoption: Systematic literature review and bibliometric analysis, Collnet J. Sci. Inf. Manage., 16 (2022), 75–116. https://doi.org/10.1080/09737766.2021.2007037 doi: 10.1080/09737766.2021.2007037
![]() |
[42] |
A. Shaqrah, A. Almrs, Examining the internet of educational things adoption using an extended unified theory of acceptance and use of technology, Int. Things, 19 (2022), 100558. https://doi.org/10.1016/j.iot.2022.100558 doi: 10.1016/j.iot.2022.100558
![]() |
[43] |
M. N. Al-Nuaimi, M. Al-Emran, Learning management systems and technology acceptance models: A systematic review, Educ. Inf. Technol., 26 (2021), 5499–5533. https://doi.org/10.1007/s10639-021-10513-3 doi: 10.1007/s10639-021-10513-3
![]() |
[44] |
A. S. Almogren, Art education lecturers' intention to continue using the blackboard during and after the COVID-19 pandemic: An empirical investigation into the UTAUT and TAM model, Front. Psychol., 13 (2022), 944335. https://doi.org/10.3389/fpsyg.2022.944335 doi: 10.3389/fpsyg.2022.944335
![]() |
[45] |
A. Granic, Educational technology adoption: A systematic review, Educ. Inf. Technol., 27 (2022), 9725–9744. https://doi.org/10.1007/s10639-022-10951-7 doi: 10.1007/s10639-022-10951-7
![]() |
[46] | S. Orhan-Ozen, M. Sumer, Factors affecting undergraduate students' acceptance and use of live instructions for learning, Interacitve Learn. Environ., (2023). https://doi.org/10.1080/10494820.2023.2190355 |
[47] | T. Teo, P. Moses, P. K. Cheah, F. Huang, T. C. Y. Tey, Influence of achievement goal on technology use among undergraduates in Malaysia, Interacitve Learn. Environ., (2023). https://doi.org/10.1080/10494820.2023.2197957 |
[48] |
T. Teo, J. Noyes, Explaining the intention to use technology among pre-service teachers: A multi-group analysis of the unified theory of acceptance and use of technology, Interacitve Learn. Environ., 22 (2012), 1–16. https://doi.org/10.1080/10494820.2011.641674 doi: 10.1080/10494820.2011.641674
![]() |
[49] |
H. V. Osei, K. O. Kwateng, K. A. Boateng, Integration of personality trait, motivation and UTAUT 2 to understand e-learning adoption in the era of COVID-19 pandemic, Educ. Inf. Technol., 27 (2022), 10705–10730. https://doi.org/10.1007/s10639-022-11047-y doi: 10.1007/s10639-022-11047-y
![]() |
[50] |
M. Tuncer, Investigation of effects of computer anxiety and internet attitudes on computer self-efficacy, J. Acad. Social Sci. Stud., 5 (2012), 205–222. https://doi.org/10.9761/jasss_156 doi: 10.9761/jasss_156
![]() |
[51] | T. Roh, B. I. Park, S. S. Xiao, Adoption of AI-enabled Robo-advisors in fintech: Simultaneous employment of UTAUT and the theory of reasoned action, J. Electron. Commerce Res., 24 (2023), 29–47. |
[52] |
A.T. Lumpe, E. A. Chambers, Assessing teachers' context beliefs about technology use, J. Res. Technol. Educ., 34 (2001), 107–193. https://doi.org/10.1080/15391523.2001.10782337 doi: 10.1080/15391523.2001.10782337
![]() |
[53] |
A. Albirini, Teachers' attitudes toward information and communication technologies: The case of Syrian EFL teachers, Comput. Educ., 47 (2006), 373–398. https://doi.org/10.1016/j.compedu.2004.10.013 doi: 10.1016/j.compedu.2004.10.013
![]() |
[54] | G. N. Wambiri, M. N. Ndani, Kenya primary school teachers' preparation in ICT teaching: Teacher beliefs, attitudes, self-efficacy, computer competence, and age, African J. Teacher Educ., 5 (2017). https://doi.org/10.21083/ajote.v5i1.3515 |
[55] |
M. Moca, A. Badulescu, Determinants of economical high school students' attitudes toward mobile devices use, Sustainability, 15 (2023), 9331. https://doi.org/10.3390/su15129331 doi: 10.3390/su15129331
![]() |
[56] |
A. Sawyerr, D. D. Agyei, Mathematics teachers' use of ICT in classroom instruction: Exploring the will-skill-tool-pedagogy model in the Ghanaian context, Educ. Inf. Technol., 28 (2022), 9397–9416. https://doi.org/10.1007/s10639-022-11234-x doi: 10.1007/s10639-022-11234-x
![]() |
[57] |
G. García-Murillo, P. Novoa-Hernández, R. Serrano Rodríguez, On the technological acceptance of moodle by higher education faculty: A nationwide study based on UTAUT2, Behav. Sci., 13 (2023), 419. https://doi.org/10.3390/bs13050419 doi: 10.3390/bs13050419
![]() |
[58] |
L. S. Shulman, Those who understand: Knowledge growth in teaching, Educ. Res., 15 (1986), 4–14. https://doi.org/10.3102/0013189X015002004 doi: 10.3102/0013189X015002004
![]() |
[59] |
P. Mishra, M. J. Koehler, Technological pedagogical content knowledge: A framework for teacher knowledge, Teachers College Record, 108 (2006), 1017–1054. https://doi.org/10.1111/j.1467-9620.2006.00684.x doi: 10.1111/j.1467-9620.2006.00684.x
![]() |
[60] |
E. Brianza, M. Schmid, J. Tondeur, D. Petko, The digital silver lining of the pandemic: The impact on preservice teachers' technological knowledge and beliefs, Educ. Inf. Technol., 28 (2023), 1–26. https://doi.org/10.1007/s10639-023-11801-w doi: 10.1007/s10639-023-11801-w
![]() |
[61] | S. Q. Luo, D. Zou, K-12 teacher readiness for flipped foreign language teaching: Scale development and validation, J. Res. Technol. Educ., (2023). https://doi.org/10.1080/15391523.2023.2196459 |
[62] | A. L. Max, S. Lukas, H. Weitzel, The pedagogical makerspace: Learning opportunity and challenge for prospective teachers' growth of TPACK, Bri. J. Educ. Technol., (2023). https://doi.org/10.1111/bjet.13324 |
[63] | Y. Sidi, T. Shamir-Inbal, Y. Eshet-Alkalai, From face-to-face to online: Teachers' perceived experiences in online distance teaching during the COVID-19 pandemic, Comput. Educ., 201 (2023). https://doi.org/10.1016/j.compedu.2023.104831 |
[64] | Q. K. L. Ong, N. Annamalai, Technological pedagogical content knowledge for twenty-first century learning skills: The game changer for teachers of industrial revolution 5.0, Educ. Inf. Technol., (2023). https://doi.org/10.1007/s10639-023-11852-z |
[65] | A. Cebi, T. B. Ozdemir, I. Reisoglu, C. Colak, From digital competences to technology integration: Re-formation of pre-service teachers' knowledge and understanding, Int. J. Educ. Res., 113 (2022). https://doi.org/10.1016/j.ijer.2022.101965 |
[66] | N. Demeshkant, S. Trusz, K. Potyrala, Interrelationship between levels of digital competences and technological, pedagogical and content knowledge (TPACK): A preliminary study with Polish academic teachers, Technol. Pedagogy Educ., 31 (2022), 579–595. https://doi.org/10.1080/1475939X.2022.2092547 |
[67] | C. Chai, J. Koh, C. C. Tsai, A review of technological pedagogical content knowledge, Educ. Technol. Soc., 16 (2013), 31–51. |
[68] |
M. L. Niess, Preparing teachers to teach science and mathematics with technology: Developing a technology pedagogical content knowledge, Teach. Teacher Educ., 21 (2005), 509–523. https://doi.org/10.1016/j.tate.2005.03.006 doi: 10.1016/j.tate.2005.03.006
![]() |
[69] | Z. Yuan, S. Li, Developing prospective mathematics teachers' technological pedagogical content knowledge (TPACK): A case of normal distribution, in The 12th International Congress on Mathematical Education, COEX, Seoul, Korea, (2012), 5804–5813. |
[70] |
X. An, C. S. Chai, Y. Li, Y. Zhou, X. Shen, C. Zheng, et al., Modeling English teachers' behavioral intention to use artificial intelligence in middle schools, Educ. Inf. Technol., 28 (2023), 5187–5208. https://doi.org/10.1007/s10639-022-11286-z doi: 10.1007/s10639-022-11286-z
![]() |
[71] |
T. T. Wijaya, Y. Cao, M. Bernard, I. F. Rahmadi, Z. Lavicza, H. D. Surjono, Factors influencing microgame adoption among secondary school mathematics teachers supported by structural equation modelling-based research, Front. Psychol., 13 (2022), 952549. https://doi.org/10.3389/fpsyg.2022.952549 doi: 10.3389/fpsyg.2022.952549
![]() |
[72] |
V. Venkatesh, J. Thong, X. Xu, Consumer acceptance and use of information technology: Extending the unified theory of acceptance and use of Technology, MIS Q., 36 (2012), 157–178. https://doi.org/10.2307/41410412 doi: 10.2307/41410412
![]() |
[73] |
J. Wu, H. Du, Toward a better understanding of behavioral intention and system usage constructs, Eur. J. Inf. Syst., 21 (2012), 680–698. https://doi.org/10.1057/ejis.2012.15 doi: 10.1057/ejis.2012.15
![]() |
[74] |
R. J. Fisher, Social desirability bias and the validity of indirect questioning, J. Consumer Res., 20 (1993), 303–315. https://doi.org/10.1086/209351 doi: 10.1086/209351
![]() |
[75] |
Z. Drezner, O. Turel, D. Zerom, A modified Kolmogorov–Smirnov test for normality, Commun. Stat. Simul. Comput., 39 (2010), 693–704. https://doi.org/10.1080/03610911003615816 doi: 10.1080/03610911003615816
![]() |
[76] |
P. M. Podsakoff, S. B. MacKenzie, J. Y. Lee, N. P. Podsakoff, Common method biases in behavioral research: A critical review of the literature and recommended remedies, J. Appl. Psychol., 88 (2003), 879–903. https://doi.org/10.1037/0021-9010.88.5.879 doi: 10.1037/0021-9010.88.5.879
![]() |
[77] | J. F. Hair, G. T. M. Hult, C. M. Ringle, M. Sarstedt, A Primer on Partial Least Squares Structural Equation Modeling (PLS-SEM), 3rd edition, Sage Publications, Thousand oaks, CA, USA, 2022. |
[78] |
C. Cao, C. Chu, J. Yang, "If you don't buy it, it's gone! ": The effect of perceived scarcity on panic buying, Electron. Res. Arch., 31 (2023), 5485–5508. https://doi.org/10.3934/era.2023279 doi: 10.3934/era.2023279
![]() |
[79] |
J. M. Santos-Jaén, A. Madrid-Guijarro, D. García-Pérez-de-Lema, The impact of corporate social responsibility on innovation in small and medium-sized enterprises: The mediating role of debt terms and human capital, Corporate Soc. Responsib. Environ. Manage., 28 (2021), 1200–1215. https://doi.org/10.1002/csr.2125 doi: 10.1002/csr.2125
![]() |
[80] | M. A. Moteri, M. Alojail, Factors influencing the supply chain management in e-Health using UTAUT model, 31 (2023), 2855–2877. https://doi.org/10.3934/era.2023144 |
[81] |
J. F. Hair, J. J. Risher, M. Sarstedt, C. M. Ringle, When to use and how to report the results of PLS-SEM, Europ. Business Rev., 31 (2019), 2–24. https://doi.org/10.1108/EBR-11-2018-0203 doi: 10.1108/EBR-11-2018-0203
![]() |
[82] |
C. Fornell, D. F. Larcker, Evaluating structural equation models with unobservable variables and measurement error, J. Mark. Res., 18 (1981), 39–50. https://doi.org/10.1177/002224378101800104 doi: 10.1177/002224378101800104
![]() |
[83] | J. Hair, W. Black, B. Babin, R. Anderson, Multivariate Data Analysis, 8th edition, Cengate, 2018. |
[84] |
J. Henseler, G. Hubona, P. Ray, Using PLS path modeling in new technology research: Updated guidelines, Industr. Manage. Data Syst., 116 (2016), 2–20. https://doi.org/10.1108/IMDS-09-2015-0382 doi: 10.1108/IMDS-09-2015-0382
![]() |
[85] |
C. H. Huang, Using PLS-SEM model to explore the influencing factors of learning satisfaction in blended learning, Educ. Sci., 11 (2021), 249. https://doi.org/10.3390/educsci11050249 doi: 10.3390/educsci11050249
![]() |
[86] |
F. Schuberth, M. Rademaker, J. Henseler, Assessing the overall fit of composite models estimated by partial least squares path modeling, Eur. J. Mark., 57 (2022), 1678–1702. https://doi.org/10.1108/EJM-08-2020-0586 doi: 10.1108/EJM-08-2020-0586
![]() |
[87] |
G. Shmueli, M. Sarstedt, J. F. Hair, J. H. Cheah, H. Ting, S. Vaithilingam, et al., Predictive model assessment in PLS-SEM: Guidelines for using PLSpredict, Eur. J. Mark., 53 (2019), 2322–2347. https://doi.org/10.1108/EJM-02-2019-0189 doi: 10.1108/EJM-02-2019-0189
![]() |
[88] |
M. Ndlovu, V. Ramdhany, E. Spangenberg, R. Govender, Preservice teachers' beliefs and intentions about integrating mathematics teaching and learning ICTs in their classrooms, ZDM Math. Educ., 52 (2020), 1365–1380. https://doi.org/10.1007/s11858-020-01186-2 doi: 10.1007/s11858-020-01186-2
![]() |
[89] |
I. Celik, Towards Intelligent-TPACK: An empirical study on teachers' professional knowledge to ethically integrate artificial intelligence (AI)-based tools into education, Comput. Human Behav., 138 (2023), 107468. https://doi.org/10.1016/j.chb.2022.107468 doi: 10.1016/j.chb.2022.107468
![]() |
[90] |
J. Guggemos, S. Seufert, Teaching with and teaching about technology: Evidence for professional development of in-service teachers, Comput. Human Behav., 115 (2021), 106613. https://doi.org/10.1016/j.chb.2020.106613 doi: 10.1016/j.chb.2020.106613
![]() |
[91] | R. Hamalainen, K. Nissinen, J. Mannonen, J. Lamsa, K. Leino, M. Taajamo, Understanding teaching professionals' digital competence: What do PIAAC and TALIS reveal about technology-related skills, attitudes, and knowledge?, Comput. Human Behav., 117 (2021), 106672. https://doi.org/10.1016/j.chb.2020.106672 |
[92] |
M. Schmid, E. Brianza, D. Petko, Self-reported technological pedagogical content knowledge (TPACK) of pre-service teachers in relation to digital technology use in lesson plans, Comput. Human Behav., 115 (2021), 106586. https://doi.org/10.1016/j.chb.2020.106586 doi: 10.1016/j.chb.2020.106586
![]() |
[93] | S. Seufert, J. Guggemos, M. Sailer, Technology-related knowledge, skills, and attitudes of pre- and in-service teachers: The current situation and emerging trends, Comput. Human Behav., 115 (2021), 106552. https://doi.org/10.1016/j.chb.2020.106552 |
[94] |
B. Anthony, A. Kamaludin, A. Romli, Predicting academic staffs behaviour intention and actual use of blended learning in higher education: Model development and validation, Technol. Knowl. Learn., 28 (2021), 1223–1269. https://doi.org/10.1007/s10758-021-09579-2 doi: 10.1007/s10758-021-09579-2
![]() |
[95] |
S. Bardakci, M. F. Alkan, Investigation of Turkish preservice teachers' intentions to use IWB in terms of technological and pedagogical aspects, Educ. Inf. Technol., 24 (2019), 2887–2907. https://doi.org/10.1007/s10639-019-09904-4 doi: 10.1007/s10639-019-09904-4
![]() |
[96] | Y. S. Wang, Y. W. Shih, Why do people use information kiosks? A validation of the unified theory of acceptance and use of technology, Govern. Inf. Q., 26 (2009), 158–165. https://doi.org/10.1016/j.giq.2008.07.001 |
[97] |
K. T. Wong, T. Teo, P. Goh, Understanding the intention to use interactive whiteboards: Model development and testing, Int. Learn. Environ., 23 (2013), 1–17. https://doi.org/10.1080/10494820.2013.806932 doi: 10.1080/10494820.2013.806932
![]() |
[98] |
P. K. Chopdar, N. Korfiatis, V. J. Sivakumar, M. D. Lytras, Mobile shopping apps adoption and perceived risks: A cross-country perspective utilizing the unified theory of acceptance and use of technology, Comput. Human Behav., 86 (2018), 109–128. https://doi.org/10.1016/j.chb.2018.04.017 doi: 10.1016/j.chb.2018.04.017
![]() |
[99] | MOE, An opinion on the implementing a project named improvement of information technology application abilities of elementary and secondary school teachers of China, Inservice Educ. Training School Teachers, (2013), 3–4. |
[100] |
F. Okocha, Determinants of electronic book adoption in Nigeria, DESIDOC J. Library Inf. Technol., 39 (2019), 175–179. https://doi.org/10.14429/djlit.39.4.14384 doi: 10.14429/djlit.39.4.14384
![]() |
[101] |
E. Kurilovas, On data-driven decision-making for quality education, Comput. Human Behav., 107 (2020), 105774. https://doi.org/10.1016/j.chb.2018.11.003 doi: 10.1016/j.chb.2018.11.003
![]() |
[102] |
A. Ameri, R. Khajouei, A. Ameri, Y. Jahani, Acceptance of a mobile-based educational application (LabSafety) by pharmacy students: An application of the UTAUT2 model, Educ. Inf. Technol., 25 (2020), 419–435. https://doi.org/10.1007/s10639-019-09965-5 doi: 10.1007/s10639-019-09965-5
![]() |
[103] |
M. A. N. Elmaadaway, Y. A. M. Abouelenein, In-service teachers' TPACK development through an adaptive e-learning environment (ALE), Educ. Inf. Technol., 28 (2023), 8273–8298. https://doi.org/10.1007/s10639-022-11477-8 doi: 10.1007/s10639-022-11477-8
![]() |
[104] |
I. Aktas, H. ozmen, Assessing the performance of Turkish science pre-service teachers in a TPACK-practical course, Educ. Inf. Technol., 27 (2022), 3495–3528. https://doi.org/10.1007/s10639-021-10757-z doi: 10.1007/s10639-021-10757-z
![]() |
1. | Marco Castrillón López, Álvaro Rodríguez Abella, Gauge reduction in covariant field theory, 2024, 57, 1751-8113, 305204, 10.1088/1751-8121/ad5bc8 | |
2. | Álvaro Rodríguez Abella, Interconnection of Lagrange–Dirac systems through nonstandard interaction structures, 2023, 20, 0219-8878, 10.1142/S0219887823501244 |
N | ||q(T)−qN|| |
10 | 1.6781 |
50 | 0.25971 |
100 | 0.06626 |
200 | 0.01664 |