Periodic components and the reduction of D_m to them #
Proposition 5.1 (prop:periodic-localization) and the first paragraph of
Appendix A.2 (periodic-mesh-calculations.tex): the cokernel of D_m
is computed on the periodic components.
T is the set of τ-periodic vertices. A periodic component is a class of
the equivalence relation on T generated by the arrows between vertices of
T and by v ~ τ v (the translation edges of the complex K of Subsection
4.1). Each component is closed under τ and τ⁻¹ (isTauClosed_component),
and a path with all vertices in T stays in one component.
meshDerivativeSurjective_of_components: if D_m is surjective on every
periodic component, it is surjective on C(Q, c).
The τ-periodic vertices.
Instances For
Adjacency in the periodic part: an arrow, or a translation edge.
Instances For
The periodic component of a vertex.
Instances For
Periodic components are closed under τ and τ⁻¹.
A path whose vertices are periodic and which starts in a component stays in it.
Proposition 5.1 (prop:periodic-localization), in the form used for the
vanishing (Appendix A.2): if D_m is surjective on the scalar mesh category of
every periodic component, it is surjective on C(Q, c).