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.
Wilson loop is invariant under vertex gauge transformations
Statement
Assume . Let be a group and let be a finite-dimensional complex Hermitian inner-product space. Define , and let be a group homomorphism, with . Let a finite oriented graph have vertices and one chosen orientation for each edge; for write for its source and target. A link configuration assigns to each and sets . A based closed edge word has length , consecutive endpoints match, and when it starts and ends at a chosen vertex ; for it consists only of . Put in traversal order, with the empty product equal to the identity, and put . For every vertex tuple acting by , one has . Thus the normalized trace is gauge invariant and unchanged when the based word is cyclically rotated; for reversal is , while the empty word reverses to itself, and .
Statement references
Facts & Assumptions
Given: , the finite link gauge action, a based closed edge word , and a finite-dimensional unitary representation .
is inherited through the finite non-Abelian lattice datum. The Axiom of Countable Choice ()
Finite non-Abelian lattice gauge data: and a face or loop holonomy is the ordered product of its edge variables.
Proof
If , both the loop holonomy and its conjugate are the identity. For , write the successive vertices as . Substituting [F1] into the ordered product gives , because each adjacent factor is the identity. The set-theoretic input is the inherited [A1].
Applying the homomorphism preserves conjugation, and trace is cyclic, so . Thus [F2] is gauge invariant; a cyclic rebase is the same trace after a cyclic permutation of factors.
Reversal replaces each edge matrix by its inverse in reverse order, hence replaces by its inverse. Since is unitary, ; dividing by the real integer gives the stated complex-conjugation identity, including the empty-word case.