Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedPipeline-generated
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Toric cycle classes are determined by two winding parities

Statement

Let Z1 be the space of primal edge chains with even incidence at every vertex, and let B1 be the span of the face boundaries. Then B1⊆Z1, the quotient Z1/B1 has dimension two, and the two winding parities give coordinates on that quotient. The same statement holds for dual edge chains, with dual face boundaries (the stars around primal vertices) in place of primal face boundaries. The horizontal loop γh=∑ihi,0 has winding pair (1,0), and the vertical loop γv=∑jv0,j has pair (0,1); their dual counterparts give the corresponding basis of the dual quotient.

Facts & Assumptions

Given: The periodic square cellulation for L≥3. Here F2={0,1} with addition modulo two, and F2S is the coordinate vector space on a finite set S.

[F1]

Periodic square cellulation of the torus: there are L2 vertices and faces and 2L2 edges, with horizontal and vertical edges indexed periodically.

[F2]

Toric incidence maps have exactly one relation each: the span of face boundaries has dimension L2−1, and the vertex-edge and dual incidence graphs are connected.

Proof

1.1givenF1constructalgebra

The primal vertex-edge graph has the explicit spanning tree T={hi,0:0≤i<L−1}∪{vi,j:i∈ZL, 0≤j<L−1}. The horizontal edges form a path through row zero, and each other row is attached to that path by one vertical column path; hence T is connected and has no cycle. For each edge e∉T, add e to the unique tree path between its endpoints. This gives a cycle γe containing e and no other edge outside T. These cycles are independent because the coefficient of each non-tree edge in a linear combination is its own coefficient. They span Z1: subtract from any cycle the γe corresponding to its non-tree edges; the remainder is an even-incidence chain supported on the tree, and a nonempty finite forest has a leaf of odd degree, so the remainder is zero. Thus dim⁡Z1=∣E∣−(∣V∣−1)=L2+1.

2.1givenF1F2step 1.1algebra

Every face boundary has even incidence at each vertex, so B1⊆Z1. By [F2], dim⁡B1=L2−1. For a cycle c, define whk(c)=∑jc(hk,j) and wvℓ(c)=∑ic(vi,ℓ), with all sums in F2. Summing the even-incidence equations over column k shows whk=whk−1; summing over row ℓ shows wvℓ=wvℓ−1. Thus the two parities wh,wv are independent of the chosen cuts. Each face boundary crosses every such cut zero or two times, so both parities vanish on B1.

3.1F1F2step 1.1step 2.1algebra∎

The horizontal fundamental loop γh=∑ihi,0 has (wh,wv)=(1,0), and the vertical fundamental loop γv=∑jv0,j has (wh,wv)=(0,1). Therefore no nonzero combination of these loops lies in B1. A basis of B1 together with γh,γv is an independent family of (L2−1)+2=L2+1 cycles, which is the dimension of Z1 from step 1.1. It is therefore a basis of Z1, proving that the winding map identifies Z1/B1 with F22. The dual square cellulation has the same coordinate graph and incidence counts, so the identical argument proves its two winding coordinates.

Depends on

Used by

Dependency tree · two levels

3 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources