Alphabeta Math
Pipeline-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.

Holonomy and discrete geometric interfaces

1 · Prerequisites

2 · Summary

Holonomy and discrete geometric interfaces

This page develops parallel transport for the local Lorentz connection interface of the preceding tetrad page, with the coframe convention e′=Λe and connection law ω′=ΛωΛ−1−dΛ Λ−1. Paths are piecewise smooth and morphisms are their classes under fixed-endpoint thin homotopy. For a tetrad frame map Ex:R4→TxM, the path-functor arrow from TxM to TyM is EyUγ(1)Ex−1; transport respects identity and composition in the thin path groupoid. Small-loop transport for a C2 Mq(R)-valued connection recovers curvature with the stated positive-boundary orientation and the sign fixed by U˙=−ω(γ˙)U, using q=4 for the tetrad connection.

The finite graph interface uses compact SU(2) variables and finite-dimensional continuous unitary representations. It proves vertex gauge invariance of a Wilson trace and constructs a normalized Haar projection onto finite vertex-invariant tensors under the full Axiom of Choice required by the imported Haar supplier. These are finite kinematic statements. They do not assert a reduction of a general Lorentz connection to SU(2), a continuum limit, a Hamiltonian constraint, a physical Hilbert space, or a physical observable. Normalized probability Haar averaging over noncompact SL(2,C) is not used.

The compact-group page supplies the weak Haar averaging definition and the theorem projecting bounded operators onto intertwiners, applied here to maps from the trivial representation on C into each vertex space. The character-theory page supplies the tensor-product and dual-representation definitions for arbitrary groups; no finite-group character theorem is used. The uniform-spaces page supplies the topological-group definition used to establish compact Hausdorff SU(2).

3 · Logical flowchart

4 · Definitions, postulates, theorems and proofs

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passverified 2026-10-22 (gpt-6.1-sol)Open item page →

A finite connected CW complex has the edge-and-2-cell presentation

Statement

Let K be a finite connected CW complex, let v0 be a vertex, and let T be a maximal tree in its 1-skeleton. Choose one orientation of each 1-cell outside T. For each such edge e:u→v, let xe be the based loop that follows T from v0 to u, traverses e, and returns along T from v to v0. For every 2-cell f, choose a point on its attaching circle and a path in the 1-skeleton from v0 to its image; the resulting based attaching loop has a unique reduced word rf in the free basis (xe). Then

π1(K,v0)≅⟨xe (e∉T)∣rf (f a 2-cell)⟩.

Cells of dimension at least three add no generators or relators. Changing the connecting path conjugates its relator, and reversing an edge orientation inverts the corresponding generator, so these choices do not change the presented group.

Facts & Assumptions

Given: The finite connected CW complex K, a vertex v0, a maximal tree T in its 1-skeleton, and the attaching maps of its 2-cells.

[F1]

Based loops and the fundamental group defines π1(X,x0) as the set of based loops modulo endpoint-fixed path homotopy and proposes traversal-first concatenation. Loop classes form the group π1(X,x0) under concatenation proves that this product is well defined and makes that set a group, with the constant loop as identity and reversal as inverse.

[F2]

CW quotients and collapse of a contractible subcomplex: collapsing a nonempty contractible CW subcomplex with a supplied contraction gives a homotopy equivalence of the quotient map.

[F3]

The fundamental group of a finite wedge of circles is free of that rank: the fundamental group of a finite wedge of circles is free on the once-around loops of its circle summands.

[F4]

Seifert–van Kampen identifies the fundamental group with a group pushout: for an open cover by path-connected sets with path-connected overlap, the fundamental group of the union is the pushout of the two inclusion-induced groups.

[F5]

Deg⁡:π1(R/Z,[0])→(Z,+) is an isomorphism: the based fundamental group of a circle is infinite cyclic, generated by a once-around loop.

Proof

1.1givenF2F3construct

The 1-skeleton of a connected CW complex is connected: attaching a cell of dimension at least two has connected attaching sphere, so it cannot join two components of the preceding skeleton. Since K is finite, its 1-skeleton is a finite connected graph. The unique paths in T contract it to v0, supplying the contraction required by [F2]. The quotient that collapses T to a point is a wedge with one circle for each 1-cell outside T, and [F3] gives the free basis represented by the loops xe.

1.2givenF1F4F5construct

Suppose a 2-cell is attached to a path-connected finite subcomplex X along α:S1→X. In the attached space, the open sets consisting of X together with an outer collar of the disk and the inner open disk cover the space; the first retracts to X, the second is contractible, and their overlap is an annulus retracting to S1. Choose a basepoint on that annulus and connect it to v0 and to the attaching basepoint by the collar and a path in X. Under the retraction to X, the once-around generator of the annulus maps to the resulting based attaching loop γ∗α∗γˉ; in the inner disk it maps to the identity. By [F4] and [F5], the pushout therefore imposes exactly that loop as a relation. The quotient by its normal closure has the same universal property: a homomorphism out of it is precisely a homomorphism out of π1(X,v0) that sends the based attaching loop to the identity.

2.1step 1.1step 1.2algebra

Attaching the finitely many 2-cells one at a time therefore quotients the free group from step 1.1 by the normal closure of all the words rf. Replacing a connecting path conjugates the corresponding based loop, so its normal closure is unchanged.

2.2F4step 1.2algebra

If an n-cell with n≥3 is attached, the same collar cover has overlap homotopy equivalent to Sn−1. For m≥2, the sphere Sm is covered by the complements of two antipodal points; both sets are contractible and their overlap Sm−1×R is path-connected. [F4] therefore gives π1(Sm)=1. Applying [F4] to the cell-attachment cover shows that attaching the n-cell induces an isomorphism on fundamental groups.

3.1givenstep 2.1step 2.2∎

Attaching every higher-dimensional cell preserves the group from step 2.1. The finite presentation in the Statement follows, including the cases with no non-tree edges or no 2-cells.

DefinitionDefinition: Literature-sourcedProof: Not applicableprecheck passverified 2026-10-22 (gpt-6.1-sol)Open item page →

Piecewise-smooth paths and thin homotopies

Definition

Let M be a smooth manifold and U⊆M open. A piecewise-smooth path in U is a continuous map γ:[0,1]→U for which some finite partition 0=t0<t1<⋯<tn=1 makes every restriction γ∣[tj−1,tj] smooth as a map of manifolds with boundary. Its source and target are γ(0) and γ(1). The collection of all such paths is a set: it is a subset, defined by separation, of the function set from [0,1] to U.

Two paths γ0,γ1 with the same source x and target y are thin-homotopic, written γ0∼thinγ1, if there is a continuous map H:[0,1]2→U and a finite subdivision of the square into compact curvilinear triangles such that H is smooth up to each triangle's boundary, H(0,t)=γ0(t), H(1,t)=γ1(t), H(s,0)=x, H(s,1)=y, and rank⁡(dH(s,t))≤1 on every smooth triangle. A curvilinear triangle here is a compact region D equipped with a specified homeomorphism ψ:Δ2→D from the standard closed two-simplex which is a smooth embedding on the interior, extends smoothly to a neighborhood of Δ2 in its affine span, and maps the three edges of Δ2 to the three boundary arcs of D. Saying H is smooth up to D's boundary means that H∘ψ extends smoothly from Δ2 to an open neighborhood of Δ2 in its affine span, with values in U; equivalently, it is a smooth singular 2-simplex under the neighborhood-extension convention of Smooth singular simplex. The rank is the dimension of the image of the differential from the two-dimensional tangent space of the triangle to TH(s,t)M, computed through the interior chart ψ and extended to boundary points by these smooth extensions. The quotient by this relation is used only after its equivalence and compatibility properties are proved.

Remarks

The rank condition is the convention for thinness. The curvilinear triangles allow reparameterization homotopies whose smooth break lines move with the homotopy parameter. This is a local piecewise-smooth convention; it does not assert invariance for arbitrary continuous homotopies.

PropositionStatement: Literature-sourcedProof: AI-generatedprecheck passverified 2026-10-22 (gpt-6.1-sol)Open item page →

Thin path classes form a groupoid

Statement

Let M be a smooth manifold and U⊆M open. For composable piecewise-smooth paths γ:x→y and δ:y→z in U, define δ∗γ:[0,1]→U by (δ∗γ)(t)=γ(2t) for 0≤t≤12 and (δ∗γ)(t)=δ(2t−1) for 12≤t≤1. Thus δ∗γ traverses γ first and then δ. A groupoid means a category in which every morphism is an isomorphism.

Then thin homotopy is an equivalence relation on each set of piecewise-smooth paths with fixed endpoints, and concatenation respects the equivalence classes. Tag a morphism by its endpoints and its path class. With objects the points of U, morphisms x→y the tagged classes [γ] from x to y, composition [δ]∘[γ]=[δ∗γ], identity the class of the constant path, and inverse [γ]−1=[γˉ] where γˉ(t)=γ(1−t), the resulting category is a groupoid.

Facts & Assumptions

Given: A smooth manifold M, an open set U⊆M, and the path and thin-homotopy data of Definition Piecewise-smooth paths and thin homotopies.

[F1]

Piecewise-smooth paths and thin homotopies: paths have finite smooth subdivisions; a thin homotopy has fixed endpoints and rank at most one on each smooth curvilinear triangle.

[F2]

Equivalence relation, equivalence class, and the quotient set A/∼: an equivalence relation is reflexive, symmetric, and transitive; its quotient consists of its equivalence classes.

[F3]

Category, object, morphism, domain, codomain, identity, composition, and hom-collection: category composition is associative and has left and right identities; morphisms retain their domain and codomain.

[F4]

Isomorphism, groupoid, and connected category: a groupoid is a category in which every morphism has a two-sided inverse.

Proof

technique · direct
1.1givenF1F2construct

The relation is reflexive because H(s,t)=γ(t) has rank at most one and fixed endpoints; subdivide the square along each breakpoint of a finite smooth partition of γ and triangulate the resulting strips. It is symmetric by replacing s with 1−s and reflecting a witnessing subdivision. For transitivity, first take finite common refinements of the boundary subdivisions of H0 and H1 along their common path γ1, then paste H0(2s,t) on 0≤s≤12 to H1(2s−1,t) on 12≤s≤1. The common boundary is the same path γ1, so this paste is continuous; the scaled finite subdivisions on the two halves give a finite curvilinear-triangle subdivision after triangulating any resulting polygons. It fixes both path endpoints, and its differential has rank at most one on each triangle. Thus the relation is an equivalence relation.

2.1F1step 1.1construct

If γ0∼thinγ1 and δ0∼thinδ1 with matching endpoints, paste their homotopies on the first and second halves of the path parameter, scaling their finite subdivisions to those halves and taking a finite common refinement along their shared fixed endpoint. The shared endpoint is fixed throughout each homotopy, so the paste is continuous and piecewise smooth; on each triangle its differential has image contained in that of the corresponding homotopy differential, hence rank at most one. Therefore δ0∗γ0∼thinδ1∗γ1, and composition of classes is well-defined.

3.1givenF1F3step 2.1construct

Let Γ be the path obtained by placing the three given paths, in order, on the three consecutive thirds of [0,1]. Each parenthesized concatenation is Γ∘ϕj for an increasing piecewise-linear homeomorphism ϕj:[0,1]→[0,1]. Put u(s,t)=(1−s)ϕ0(t)+sϕ1(t) and H(s,t)=Γ(u(s,t)). Refine the t-partition by all breakpoints of ϕ0 and ϕ1. On each resulting strip u is smooth and piecewise bilinear. For every breakpoint b of the piecewise-smooth path Γ, also subdivide along the level set u−1(b); on each strip these finitely many level sets are smooth arcs, with their finitely many endpoints and intersections included in the subdivision. The resulting regions have finitely many smooth boundary arcs and can be triangulated into curvilinear triangles. On each triangle, u remains in one smooth piece of Γ, so H is smooth there and both differential columns are scalar multiples of the single vector Γ′. Its rank is at most one. Thus the two parenthesizations are thin-homotopic. For the right identity law use ρ0(t)=2t on [0,12] and ρ0(t)=1 on [12,1], with ρ1(t)=t; for the left identity law use ρ0(t)=0 on [0,12] and ρ0(t)=2t−1 on [12,1], again with ρ1(t)=t. The corresponding homotopies γ((1−s)ρ0(t)+sρ1(t)) have the required concatenated and unaltered paths as boundaries. Refine each square along the parameter-map breakpoints and the preimages of every breakpoint of γ; any region on which the argument is constant is already smooth. The same rank argument proves both identity laws.

3.2givenF1F3step 2.1construct

Put λ(t)=2t for 0≤t≤12 and λ(t)=2(1−t) for 12≤t≤1. Then t↦γ(λ(t)) traverses γ and then its reverse. The map H(s,t)=γ((1−s)λ(t)) joins this path to the constant path at γ(0) with both endpoints fixed. Subdivide first at t=12, then along the preimages of every breakpoint of a finite smooth partition of γ under (s,t)↦(1−s)λ(t); these are finitely many smooth arcs or constant regions on the two parameter strips. Triangulating the resulting finite curvilinear regions makes H smooth on each triangle. Its differential has rank at most one because both derivatives are scalar multiples of γ˙. Applying the same construction to γˉ contracts the reverse-then-forward path at γ(1). Hence [γˉ] is a two-sided inverse of [γ].

4.1F2F3F4step 2.1step 3.1step 3.2∎

The tagged morphism set has well-defined domain and codomain by construction; step 2.1 makes composition independent of representatives, step 3.1 gives associativity, and step 3.2 gives the inverse axiom. Steps 3.1 and 3.2 also provide the two identity laws stated in [F3]. Thus the data form a category in which every morphism is invertible, which is a groupoid by [F4].

DefinitionDefinition: Literature-sourcedProof: Not applicableprecheck passverified 2026-10-22 (gpt-6.1-sol)Open item page →

Thin path groupoid

Definition

A groupoid is a category in which every morphism has a two-sided inverse. For an open subset U of a smooth manifold, the thin path groupoid Π1thin(U) is the category whose objects are the points of U and whose morphisms from x to y are tagged triples (x,y,[γ]), where [γ] is a thin-homotopy class of piecewise-smooth paths from x to y; composition, identities, and inverses are those of Proposition Thin path classes form a groupoid.

PropositionStatement: AI-adaptedProof: AI-generatedprecheck passverified 2026-10-22 (gpt-6.1-sol)Open item page →

The once-around circle path is not thin-contractible

Statement

Let S1={(x,y)∈R2:x2+y2=1} with its regular-level-set smooth structure. For γ(t)=(cos⁡(2πt),sin⁡(2πt)), 0≤t≤1, the morphism [γ] in Π1thin(S1) is not the identity morphism at (1,0).

Facts & Assumptions

Given: The unit circle S1, the smooth based loop γ above, and the thin-homotopy definition of Piecewise-smooth paths and thin homotopies.

[F1]

Thin path groupoid: the identity morphism at a point is the class of its constant path.

[F2]

A regular level set is an embedded submanifold: the nonempty regular level set x2+y2=1 is a smooth one-dimensional submanifold of R2.

[F3]

A smooth differential k-form: a smooth one-form is a smooth section of the cotangent bundle, so restriction of x dy−y dx is a smooth one-form on S1.

[F4]

The exterior derivative by the invariant vector-field formula: for a one-form α, dα(X,Y)=X(α(Y))−Y(α(X))−α([X,Y]).

[F5]

Stokes theorem for smooth singular chains: for a smooth differential form α and a finite smooth singular chain c, ∫cdα=∫∂cα.

[F6]

Integral of a form over a smooth singular simplex: on a smooth singular 1-simplex σ:[0,1]→S1, ∫σα=∫01ασ(t)(σ˙(t)) dt.

[F7]

Smooth singular simplex: a map from the standard simplex is a smooth singular simplex when it has a smooth extension to an open neighborhood of that simplex in its affine span.

[F8]

The pullback of a differential form: for a smooth map ι, its pullback of a form is obtained by evaluating the form on the images of tangent vectors under dι.

[F9]

Pullback of forms is smooth functorial and preserves wedges: pullback sends smooth forms to smooth forms.

[F10]

The invariant exterior-derivative formula is C∞-multilinear: the invariant formula is alternating and C∞(M)-multilinear, hence defines a smooth (k+1)-form. In degree one, its values on a tangent frame determine the resulting two-form.

Proof

technique · direct
1.1givenF2F3F8F9F4F6F10algebra

The map f(x,y)=x2+y2 has derivative (2x,2y), which is nonzero on f−1(1); thus 1 is a regular value and [F2] makes S1 a smooth one-dimensional submanifold. Let α~=x dy−y dx be the ambient one-form on R2, let ι:S1↪R2 be inclusion, and put α=ι∗α~, which is defined by [F8] and smooth by [F9]. The global tangent field X=(−y,x)∣S1 spans each tangent line and satisfies α(X)=x2+y2=1. By [F10], dα is a smooth two-form. By [F4], dα(X,X)=X(α(X))−X(α(X))−α([X,X])=0; since X spans each one-dimensional tangent space, this gives dα=0 intrinsically on S1. Along γ, γ˙(t)=2πXγ(t), so [F6] gives ∫γα=∫012π dt=2π; the constant loop has integral zero.

2.1givenF1F5F6F7step 1.1assume-contradischarge-contradiction∎

Suppose a thin homotopy H:[0,1]2→S1 joined γ to the constant loop while fixing the basepoint at the path endpoints. Parametrize every curvilinear triangle in its finite subdivision by the specified smooth map from the standard two-simplex and compose that parametrization with H. By the smooth-up-to-boundary convention of Piecewise-smooth paths and thin homotopies, each composition has a smooth extension to a neighborhood of the standard simplex, so it is a smooth singular simplex by [F7]. Orient these finitely many simplices compatibly with the square and apply [F5] to each, then add the formulas. Each shared geometric edge occurs twice with opposite orientations. Choose one smooth reference parametrization σ for such an edge; the two oriented face restrictions are σ∘ϕ and the reverse of σ∘ψ, for increasing smooth reparametrizations ϕ,ψ:[0,1]→[0,1]. By [F6] and one-variable substitution, their oriented integrals are ∫σα and −∫σα, so they cancel. The remaining terms are exactly the oriented square boundary under H. Step 1.1 gives dα=0, hence Stokes gives zero for the total boundary integral. The two path edges have signed integral 2π or −2π because one is γ and the other is constant; the endpoint edges are constant and contribute zero. Thus the boundary integral is ±2π≠0, a contradiction. Therefore [γ] is not the identity class.

PropositionStatement: Literature-sourcedProof: AI-generatedprecheck passverified 2026-10-22 (gpt-6.1-sol)Open item page →

Existence and uniqueness of transport along a piecewise-smooth path

Statement

Let n≥1 and let 0=t0<t1<⋯<tm=1 be a finite partition. For each j, let Aj:[tj−1,tj]→Mn(R) be continuous. There is a unique continuous function U:[0,1]→Mn(R) that is C1 on each partition interval, satisfies U′(t)=−Aj(t)U(t) in its interior, and has U(0)=In. Derivatives at interval endpoints are the corresponding one-sided derivatives.

Facts & Assumptions

Given: A positive integer n, a finite partition of [0,1], one continuous matrix coefficient on each closed subinterval, and the initial matrix In.

[F1]

Linear matrix ODEs have unique global solutions on a fixed interval: a continuous matrix coefficient on a compact interval gives a unique global solution to the linear matrix initial-value problem.

Proof

technique · direct
1.1givenF1construct

Apply [F1] on [t0,t1] with initial matrix In to obtain the unique C1 solution on the first interval.

2.1givenF1step 1.1construct

For each j=2,…,m, apply [F1] on [tj−1,tj] with initial value equal to the terminal value already constructed at tj−1. Adjacent solutions agree at their shared endpoint by construction, so the finite family pastes to a continuous piecewise-C1 solution on [0,1].

3.1givenF1step 1.1step 2.1induction∎

Any other such function has initial value In on the first interval, so it agrees there by [F1]. If it agrees through tj−1, then it has the same initial value as the constructed solution on the jth interval, so [F1] makes them agree there. Induction through the finite partition proves uniqueness on all of [0,1].

DefinitionDefinition: Literature-sourcedProof: Not applicableprecheck passverified 2026-10-22 (gpt-6.1-sol)Open item page →

Connection path transport

Definition

Assume the ACω convention for the local tetrad supplier. Let (M,g,N) be a smooth time-oriented Lorentzian four-manifold of signature (−,+,+,+), let U⊆M be nonempty and open, and let E=(E0,E1,E2,E3) be a smooth future-directed orthonormal tetrad on U. Choose a smooth metric-compatible affine connection ∇ on TM∣U. Its Lorentz-connection matrix ω=(ωIJ) in E is specified by ∇XEJ=∑IωIJ(X)EI; the choice of ∇ is part of the data.

A piecewise-smooth path γ:[0,1]→U is continuous and has a finite partition 0=t0<⋯<tm=1 on whose closed subintervals its restrictions are smooth up to the boundary. On each such piece let Aγ,j(t)=ωγ(t)(γ˙(t)), using that piece's one-sided tangent at its endpoints. Each Aγ,j:[tj−1,tj]→M4(R) is continuous. The piecewise matrix-ODE existence proposition gives a unique continuous piecewise-C1 solution

U˙γ(t)=−Aγ,j(t)Uγ(t),Uγ(0)=I4.

The equation holds in each piece's interior with the corresponding one-sided derivatives at its endpoints; uniqueness also makes the solution independent of subdivision. The endpoint matrix Uγ(1) is the connection path transport in the chosen tetrad trivialization. It maps vector components at γ(0) to components at γ(1). A smooth local Lorentz frame change transforms this matrix by its endpoint frame matrices; it is a gauge transformation in the principal-bundle sense only if it extends to an automorphism over the identity.

Remarks

This is transport of tangent-vector components in a local tetrad, not holonomy of a foliation or a claim that a global tetrad or spin structure exists. Reversing a path reverses its parameter; path ordering is fixed by the displayed left-multiplication ODE.

PropositionStatement: Literature-sourcedProof: AI-generatedprecheck passverified 2026-10-22 (gpt-6.1-sol)Open item page →

Connection transport is invariant under thin homotopy

Statement

Under the assumptions of Connection path transport, if two piecewise-smooth paths γ0,γ1:[0,1]→U are thin-homotopic in the sense of Piecewise-smooth paths and thin homotopies, then Uγ0(1)=Uγ1(1) in the fixed tetrad trivialization.

Facts & Assumptions

Given: A smooth matrix connection ω on U, a finite curvilinear-triangle subdivision of a fixed-endpoint thin homotopy H, and the path ODE of Definition Connection path transport.

[F1]

Piecewise-smooth paths and thin homotopies: a thin homotopy is piecewise smooth on finitely many curvilinear triangles, fixes the two path endpoints, and has differential rank at most one on every triangle.

[F2]

Connection path transport: along each smooth path segment, transport is the unique solution of U′=−ω(γ˙)U, with later transport multiplying on the left.

[F3]

Local Lorentz tetrad and connection: F=dω+ω∧ω is the curvature matrix two-form, and a Lorentz connection satisfies ωTη+ηω=0.

[F4]

Smooth dependence of ODE solutions on parameters: solutions of a smooth parameter-dependent finite-dimensional ODE depend smoothly on the parameter on a common compact interval.

[F5]

Linear matrix ODEs have unique global solutions on a fixed interval: for a continuous matrix coefficient and arbitrary initial matrix, the linear matrix ODE has a unique solution on the given compact interval.

[F6]

Based loops and the fundamental group: the fundamental group consists of based loops modulo endpoint-fixed path homotopy.

[F7]

A finite connected CW complex has the edge-and-2-cell presentation: a finite connected CW complex has the presentation with non-tree 1-cells as generators and 2-cell attaching loops as relators.

[F8]

Group presentation by generators and relations: a presentation ⟨X∣R⟩ is the quotient of the free group on X by the normal closure of R.

[F9]

The normal closure of R is the set of finite products of conjugates of elements of R and their inverses: the normal closure of a set is the set of finite products of conjugates of its elements and their inverses.

Proof

technique · direct
1.1givenF2F3F4F5algebra

On one closed curvilinear triangle Δ of the subdivision, pull the connection back by the smooth restriction of H and write its two coefficient matrices as As=ω(Hs) and At=ω(Ht). For a smooth family of paths inside Δ, let Ut=−AtU, U(s,0)=I, and put K=Us+AsU. Smooth dependence in [F4] permits this differentiation, and [F5] gives uniqueness for the linear equation satisfied by K. The product rule gives Kt+AtK=−(∂sAt−∂tAs+[As,At])U=−H∗F(∂s,∂t)U. Here [F3] identifies the pulled-back two-form as the curvature of the supplier connection.

2.1givenF1F2F3F4F5step 1.1algebra

Since rank⁡(dH)≤1 on Δ, Hs,Ht are linearly dependent and the alternating two-form satisfies H∗F(∂s,∂t)=F(Hs,Ht)=0. Fix a vertex q0 and join it to each q∈Δ by the image of the straight radial path in the standard-simplex parametrization. The associated transports Q(q) exist globally by [F5] and depend smoothly on q: apply [F4] locally in the endpoint parameter and continue over finitely many subintervals of the compact path interval, using uniqueness on overlaps. For each radial path, [F3] and the ODE give (QTηQ)′=0, hence Q(q)TηQ(q)=η and Q(q) is invertible. Step 1.1 on this radial family with fixed start gives dQ=−H∗ω Q. Thus transport from q1 to q2 in Δ is Q(q2)Q(q1)−1 by [F5], and the triangle boundary transport is identity.

3.1givenF1F2F3F6F7F8F9step 2.1algebra∎

The finite curvilinear-triangle subdivision is a finite connected CW complex K; choose the lower-left corner as basepoint and a maximal tree in its one-skeleton. The outer boundary loop contracts to that basepoint by the straight-line contraction of the parameter square, so [F6] makes its fundamental-group class the identity. By [F7], π1(K) has generators given by non-tree edge loops closed along the tree and relators given by based triangular face boundaries. For each free generator xe, assign the inverse transport of its based edge loop and extend to a homomorphism Φ from the free group; [F2]'s path-composition law gives Φ(w)=Uw−1 for every edge word w. These transports are invertible because along each segment [F3] and the ODE give (UTηU)′=−UT(ωTη+ηω)U=0, hence UTηU=η; reversing the ODE gives Uαˉ=Uα−1. A based face relator is a tree path, a triangular boundary and the reverse tree path, so step 2.1 makes its transport and its Φ-image the identity. The boundary word is identity in the presentation by [F6]–[F8], and [F9] writes it as a finite product of conjugates of face relators and their inverses; all of these map to I, so Uλ=I. The side edges of the square are constant by fixed endpoints, giving Uλ=Uγ1−1Uγ0 and Uγ0(1)=Uγ1(1).

PropositionStatement: Literature-sourcedProof: AI-generatedprecheck passverified 2026-10-22 (gpt-6.1-sol)Open item page →

Path transport composes and transforms covariantly

Statement

For transport as in Connection path transport, with composition convention [δ]∘[γ]=[δ∗γ] meaning first traverse γ and then δ,

Uδ∗γ(1)=Uδ(1)Uγ(1),Uγˉ(1)=Uγ(1)−1.

Let E=(E0,E1,E2,E3) be the tetrad of Connection path transport. For each x∈U, let Ex:R4→TxM send the standard basis vector eI to EI(x); because the tetrad vectors are a basis, Ex is an invertible real-linear map, hence a linear isomorphism (Invertible linear maps, linear isomorphisms, and inverse linear maps). A groupoid is a category in which every morphism is an isomorphism (Isomorphism, groupoid, and connected category). Define the target groupoid T(U) to have base-point-tagged objects τx:=(x,TxM) for x∈U and morphisms τx→τy the tagged triples (τx,τy,L) where L:TxM→TyM is a real-linear isomorphism; identities and composition are tagged identity maps and ordinary composition (Category, object, morphism, domain, codomain, identity, composition, and hom-collection). A covariant functor assigns objects and morphisms and preserves identities and composition (Covariant functor, identity functor, composite functor, and contravariant functor). The functor from the thin path groupoid Thin path groupoid to T(U) sends x to τx and sends [γ]:x→y to the tagged tangent-space arrow

(τx,τy,Ey Uγ(1) Ex−1):τx⟶τy.

Here Uγ(1) acts on tetrad components, while Ey and Ex−1 convert between components and tangent vectors. Under the supplier convention e′=Λe, the component matrix in the changed local frame satisfies

Uγ′(1)=Λ(γ(1))Uγ(1)Λ(γ(0))−1.

Facts & Assumptions

Given: The transport ODE and curvature convention of Local Lorentz tetrad and connection, a piecewise-smooth path, and a smooth local Lorentz frame change Λ.

[F1]

Connection path transport: transport solves U′=−ω(γ˙)U with initial value I; on concatenated pieces the later piece multiplies on the left.

[F2]

Thin path groupoid: composition is represented by path concatenation, the identity by a constant path, and inverse by the reversed path.

[F3]

Connection transport is invariant under thin homotopy: thin-homotopic path representatives have the same transport matrix.

[F4]

Local Lorentz tetrad and connection: a Lorentz connection is η-skew, so ωTη+ηω=0; under e′=Λe, ω′=ΛωΛ−1−dΛ Λ−1.

[F5]

Isomorphism, groupoid, and connected category: in a groupoid every morphism has a two-sided inverse.

[F6]

Covariant functor, identity functor, composite functor, and contravariant functor: a covariant functor assigns objects and morphisms and preserves identity morphisms and composition.

[F7]

Invertible linear maps, linear isomorphisms, and inverse linear maps: a linear isomorphism is a linear map with a two-sided linear inverse.

[F8]

Category, object, morphism, domain, codomain, identity, composition, and hom-collection: a category has tagged morphisms with specified domains and codomains, identities, and associative composition.

Proof

technique · direct
1.1givenF1algebra

On the constant path the coefficient ω(γ˙) is zero, so the unique solution is U(t)=I. If γ is followed by δ, solve on the two parameter intervals with the terminal value from the first interval as initial value for the second. The second solution is Uδ(t)Uγ(1), so uniqueness gives Uδ∗γ(1)=Uδ(1)Uγ(1).

1.2givenF1F4algebra

Write η=diag⁡(−1,1,1,1). Along each smooth segment the derivative is ddt(UTηU)=UT(−ωTη−ηω)U=0 by [F4]; continuity across the finite segment endpoints gives U(t)TηU(t)=η throughout. Since η is nonsingular, each U(t) is invertible.

2.1givenF1F2F3step 1.2algebra

Let U(t) solve along γ. The matrix V(s):=U(1−s)U(1)−1 starts at I and, since γˉ˙(s)=−γ˙(1−s), satisfies V′(s)=−ω(γˉ˙(s))V(s). Hence uniqueness gives Uγˉ(1)=U(1)−1. By [F3], transport is independent of the representative of a thin class; [F1]–[F2] and the identities in steps 1.1–1.2 therefore give well-defined component maps on the thin path groupoid.

3.1F1F2F5F6F7F8step 1.1step 2.1algebra

For [γ]:x→y and [δ]:y→z, the associated tangent arrows compose as (EzUδEy−1)∘(EyUγEx−1)=EzUδUγEx−1=EzUδ∗γEx−1 by step 1.1. Constant paths give identity tangent maps, and reversed paths give inverse tangent maps by step 2.1. Thus the stated object and arrow assignments define a functor into T(U) by [F6], with arrows in the stated groupoid by [F5].

4.1givenF1F4algebra∎

Put U~(t)=Λ(γ(t))U(t)Λ(γ(0))−1. Differentiating and using U′=−ω(γ˙)U gives U~′(t)=(dΛ(γ˙)Λ−1−Λω(γ˙)Λ−1)U~(t)=−ω′(γ˙)U~(t) by the transformation law [F4]. Its initial value is I, so uniqueness identifies U~ with transport in the changed frame and gives the endpoint formula. Since Ex′=ExΛ(x)−1, the corresponding tangent map is frame independent: Ey′Uγ′(1)(Ex′)−1=EyUγ(1)Ex−1. This is a local frame covariance statement; it is a principal-bundle gauge action only when Λ has the global extension required by the cited gauge-group definition.

Remarks

The endpoint covariance is summarized by the commutative diagram below; the diagram records the source and target frame maps, while the proof above establishes the equality by differentiating the ODE.

R4E;°(0)R4E;°(1)R4E0;°(0)R4E0;°(1)U°¤(°(0))¤(°(1))U0°

No ordinary-homotopy invariance is asserted here. The design's ordinary-homotopy comparison is a separate flatness-dependent result; the thin path groupoid is the interface proved in this item.

PropositionStatement: Literature-sourcedProof: AI-generatedprecheck passverified 2026-10-22 (gpt-6.1-sol)Open item page →

Small-loop transport recovers curvature

Statement

Fix coordinate dimension n≥2 and matrix size q≥1, independently. Let V⊆Rn be an open coordinate domain, let K⊂V be compact with positive distance from Rn∖V, and let e1,…,en be the standard basis of Rn. Let ω=∑k=1nωk(x) dxk be a C2 Mq(R)-valued connection one-form, with each ωk:V→Mq(R). Along each segment use the matrix ODE U′=−ω(γ˙)U and initial value Iq; existence and uniqueness for this fixed matrix size follow from Existence and uniqueness of transport along a piecewise-smooth path. For the tetrad connection of Connection path transport, take q=4. For p∈K, distinct coordinate directions i,j, and sufficiently small positive ε so the square stays in V, define γε by traversing each straight side at constant speed over one quarter of [0,1], in the order

p→p+εei→p+εei+εej→p+εej→p.

Its boundary orientation is positive for the ordered coordinate pair (ei,ej).

Uγε(1)=Iq−ε2Fij(p)+O(ε3),Fij=∂iωj−∂jωi+[ωi,ωj]∈Mq(R).

Here Iq is the identity in Mq(R) and fix a norm ∥⋅∥ on that space satisfying ∥AB∥≤∥A∥ ∥B∥ for all A,B∈Mq(R). The notation O(ε3) means that the norm of the remainder is at most Cε3 for all sufficiently small positive ε, with C uniform for basepoints p∈K.

Facts & Assumptions

Given: A C2 matrix one-form, the ordered square boundary above, and the ODE convention U′=−ω(γ˙)U.

[F1]

Existence and uniqueness of transport along a piecewise-smooth path: for a fixed matrix size, a continuous matrix coefficient on each compact path segment gives a unique solution of the left-multiplication matrix ODE with the specified initial value.

[F2]

Local Lorentz tetrad and connection defines the smooth four-dimensional tetrad connection curvature by F=dω+ω∧ω, with matrix coefficients in M4(R). This supplier is used only to identify the smooth tetrad specialization.

[F3]

Path transport composes and transforms covariantly: in the q=4 tetrad case, later path segments multiply on the left, Uδ∗γ(1)=Uδ(1)Uγ(1); the tangent-space arrow assignment leaves this component-matrix law unchanged.

[F4]

Connection path transport: the tetrad application uses the same component ODE with q=4.

[L1]

For the arbitrary matrix size q in the Statement, the commutator is [A,B]:=AB−BA, and Fij denotes the explicitly displayed combination ∂iωj−∂jωi+[ωi,ωj]. The proof computes this combination directly.

Proof

technique · direct expansion
1.1givenF1algebra

Set A=ωi(p) and B=ωj(p). The integral equation U(t)=I−∫0tω(γ˙)U gives the positive-i segment expansion S1=I−εA+12ε2(A2−∂iA)+O(ε3). On the following positive-j segment, Taylor expansion at p+εei gives S2=I−εB+ε2(12B2−∂iB−12∂jB)+O(ε3). In each case the second iterated integral contributes 12ε2ωk(p)2, and the first integral contributes the displayed derivative terms.

2.1givenF1step 1.1algebra

Along the negative-i segment from p+εei+εej to p+εej and the negative-j segment from p+εej to p, the same integral expansion gives S3=I+εA+ε2(12A2+12∂iA+∂jA)+O(ε3) and S4=I+εB+12ε2(B2+∂jB)+O(ε3). The derivative terms use starting points p+εej and p; reversing the tangent changes the first-order ODE coefficient's sign.

3.1givenF1F2F3F4L1step 1.1step 2.1algebra∎

For any fixed q, uniqueness in [F1] shows that adjoining a segment with identity-initial transport S to an already traversed path with transport T gives total matrix ST: S(t)T solves the next segment's ODE with its required initial value. Applying this successively gives total transport S4S3S2S1; for q=4 this agrees with [F3] using the same component ODE of [F4]. Its linear terms cancel. The within-segment quadratic terms sum to A2+B2−∂iB+∂jA; the six cross-products sum to BA−B2−BA−AB−A2+BA=BA−AB−A2−B2. The full coefficient is therefore ∂jA−∂iB+BA−AB=−(∂iωj−∂jωi+[A,B])=−Fij(p) by [L1]. In the smooth tetrad specialization, evaluating dω+ω∧ω on the commuting coordinate vectors gives exactly this expression, since dω(∂i,∂j)=∂iωj−∂jωi and (ω∧ω)(∂i,∂j)=ωiωj−ωjωi, in agreement with [F2]. For a uniform remainder, choose a compact neighborhood K′ of K contained in V and containing the four square sides for 0<ε<ε0; the C2 coefficients and derivatives are bounded there. Taylor remainders in single integrals are uniformly O(ε3); replacing either coefficient in the second iterated integral by its value at p also incurs O(ε3), since each coefficient differs by O(ε) over these length-ε sides. If M bounds coefficient norms in the fixed submultiplicative norm, iterated-integral terms of order m≥3 are bounded by Mmεm/m!, whose sum is O(ε3). Multiplying four expansions preserves the uniform remainder order.

PropositionStatement: Literature-sourcedProof: AI-generatedprecheck passverified 2026-10-22 (gpt-6.1-sol)Open item page →

SU(2) is a compact Hausdorff matrix group

Statement

Let M2(C) have its Euclidean topology as R8, write Q†:=Q‾T for conjugate transpose, and define

SU(2)={Q∈M2(C):Q†Q=I2, det⁡Q=1}.

Under matrix multiplication, SU(2) is a compact Hausdorff topological group.

Facts & Assumptions

Given: The Euclidean topology on M2(C)≅R8 and the displayed subset defined by the conjugate-transpose and determinant equations.

[F1]

For same-sized finite square matrices over a commutative ring, det⁡(AB)=det⁡(A)det⁡(B): det⁡(AB)=det⁡(A)det⁡(B) for square matrices over a commutative field.

[F3]

Rectangular matrix multiplication and the identity matrix In, including zero-sized shapes: matrix multiplication and the identity matrix have their usual finite-sum entry formulas.

[F4]

Topological group: multiplication and inversion are continuous: a topological group is a group whose multiplication and inversion maps are continuous for the product and given topologies.

Proof

technique · direct
1.1givenF1F3F4algebra

If Q,R∈SU(2), then (QR)†QR=R†Q†QR=I2 and det⁡(QR)=det⁡Qdet⁡R=1 by [F1]; I2 is in the set. From Q†Q=I2, the columns of Q are linearly independent and hence Q is invertible; therefore Q†=Q−1 and QQ†=I2. By [F1], 1=det⁡(I2)=det⁡(QQ†)=det⁡Qdet⁡(Q†), so det⁡(Q†)=1 and the inverse belongs to SU(2). Associativity is inherited from matrix multiplication. The product entries are polynomials in real and imaginary entries and the inverse Q↦Q† is continuous, so these maps meet the topological-group definition [F4].

1.2F3algebra

The equations Q†Q=I2 and det⁡Q=1 are inverse images of closed points under continuous functions, so SU(2) is closed in R8. Each unitary column has squared norm one, hence the sum of the squared absolute values of all four entries is 2; this bounds the subset.

2.1givenF2step 1.2construct∎

By [F2], the closed bounded subset is compact. Euclidean space is Hausdorff and every subspace of a Hausdorff space is Hausdorff, so SU(2) is compact Hausdorff.

DefinitionDefinition: Literature-sourcedProof: Not applicableprecheck passverified 2026-10-22 (gpt-6.1-sol)Open item page →

Finite SU(2) graph holonomy model

Definition

A finite oriented graph consists of finite vertex and edge sets V,E, source and target maps s,t:E→V, and a fixed-point-free involution e↦eˉ with s(eˉ)=t(e) and t(eˉ)=s(e). A finite SU(2) graph configuration assigns ge∈SU(2) to every oriented edge and requires geˉ=ge−1. A graph path is a finite composable edge word e1,…,en; its holonomy is the later-left product gen⋯ge1, and the empty path has holonomy I2.

A vertex gauge assignment is a function h:V→SU(2). It acts on edge variables by

ge⟼ge′=ht(e)gehs(e)−1.

A finite-dimensional unitary representation is a group homomorphism ρ:SU(2)→U(W) on a finite-dimensional complex inner-product space W that is strongly continuous, meaning g↦ρ(g)w is continuous for each w∈W. Here

U(W):={T∈GL⁡(W):⟨Tv,Tw⟩=⟨v,w⟩ for all v,w∈W},

with the operator-norm topology inherited from End⁡(W). In finite dimension, strong continuity is equivalent to continuity in this operator norm.

For a closed graph path ℓ=(e1,…,en), the associated Wilson trace is the basis-independent trace of the endomorphism of W given by

Tr⁡(ρ(gen)⋯ρ(ge1)).

Here the trace of a finite-dimensional endomorphism is the trace of its matrix in any basis.

Remarks

This definition is a finite graph configuration model. An SU(2) graph is not obtained from a Lorentz connection without an additional reduction choice. This item makes no continuum-limit, Hamiltonian-constraint, physical-Hilbert-space, or empirical-observable claim.

PropositionStatement: Literature-sourcedProof: AI-generatedprecheck passverified 2026-10-22 (gpt-6.1-sol)Open item page →

Wilson traces are invariant under vertex gauge transformations

Statement

For every finite SU(2) graph configuration, continuous finite-dimensional unitary representation ρ, closed graph path ℓ, and vertex gauge assignment h, the Wilson trace of ℓ is unchanged by ge↦ht(e)gehs(e)−1.

Facts & Assumptions

Given: The edge orientation, path ordering, representation, and vertex action of Definition Finite SU(2) graph holonomy model.

[F1]

Finite SU(2) graph holonomy model: each edge variable transforms as ge′=ht(e)gehs(e)−1, and a path product is ordered with later edges on the left.

Proof

technique · direct cancellation
1.1givenF1algebra

The vertex action preserves the reverse-edge condition because geˉ′=hs(e)ge−1ht(e)−1=(ht(e)gehs(e)−1)−1=(ge′)−1. Thus the transformed variables are again a graph configuration.

1.2givenF1algebra

If the path is empty, its product is I2 before and after the gauge action, so its trace is unchanged. For the rest of the proof assume the closed path has n≥1 edges and write it as e1:v0→v1,…,en:vn−1→vn=v0.

2.1givenF1algebrastep 1.2

The transformed product is gen′⋯ge1′=hv0genhvn−1−1hvn−1gen−1⋯hv1−1hv1ge1hv0−1=hv0(gen⋯ge1)hv0−1; all adjacent intermediate factors cancel because hv−1hv=I.

3.1givenF1step 2.1algebra∎

Applying the homomorphism ρ carries this conjugation to conjugation by ρ(hv0). For finite matrices, Tr⁡(AB)=∑i,jAijBji=Tr⁡(BA); take A=ρ(hv0) and B=ρ(gen⋯ge1)ρ(hv0)−1 to obtain the same trace as before. Thus the Wilson trace is invariant.

PropositionStatement: Literature-sourcedProof: AI-generatedprecheck passverified 2026-10-22 (gpt-6.1-sol)Open item page →

Finite graph vertex Haar averaging is an orthogonal projection

Statement

Assume the full Axiom of Choice. Let a finite oriented graph be given, fix total orders on its finite vertex and edge sets, and for each edge e choose a finite-dimensional strongly continuous unitary representation ρe:SU(2)→U(Ve). At a vertex v set

Wv=⨂t(e)=vVe  ⊗ ⁣⨂s(e)=vVe∗,

where the edge order induces the order on each factor list and an empty tensor product is C. Use the dual action g⋅λ=λ∘ρe(g−1) on Ve∗, with the dual Hilbert inner product determined by any orthonormal basis of Ve. On elementary tensors use the tensor-product inner product ⟨⨂iui,⨂iwi⟩=∏i⟨ui,wi⟩, extended sesquilinearly. Let Rv be the resulting diagonal unitary representation and define its fixed-vector subspace by

WvSU(2):={w∈Wv:Rv(g)w=w for every g∈SU(2)}.

An orthogonal projection onto a subspace S⊆Wv, regarded as an endomorphism of Wv, is the idempotent with range S and kernel S⊥.

For the normalized Haar probability measure μ on SU(2),

Pvw:=∫SU(2)Rv(g)w dμ(g)

is the orthogonal projection of Wv onto its invariant subspace WvSU(2). The vector integral is defined coordinatewise in the finite-dimensional space, equivalently by the weak integral in Haar averaging of bounded operators as a weak operator integral. On the coefficient space W=⨂v∈VWv, with vertex order fixed as above, the operators Pv acting on their respective vertex factors commute, and ∏v∈VPv projects onto the tensors invariant at every vertex. This is a finite kinematic projection; it imposes no Hamiltonian or continuum constraint.

Facts & Assumptions

Given: Full AC, compact Hausdorff SU(2), finite-dimensional strongly continuous unitary edge representations, and the finite graph data of Definition Finite SU(2) graph holonomy model.

[F1]

SU(2) is a compact Hausdorff matrix group: SU(2) with its matrix topology is a compact Hausdorff group.

[F2]

The Axiom of Choice: full AC is the adopted set-theoretic principle; it is stronger than the countable-choice assumption used in the tetrad supplier.

[F3]

The tensor product of two complex representations: a finite tensor product carries the diagonal tensor-product representation on the algebraic tensor product.

[F4]

The dual or contragredient complex representation: the dual representation acts by g⋅λ=λ∘ρ(g−1).

[F5]

Normalized Haar probability on a compact group: under AC, a compact Hausdorff group has a unique normalized Haar probability measure.

[F6]

Hilbert space and Real and complex inner-product spaces and their induced length: the spaces here are complex Hilbert spaces with the stated inner products.

[F7]

Strongly continuous unitary representations, invariant linear subspaces and intertwiners: a unitary representation is a group homomorphism into the unitary operators, and strong continuity means each orbit map is continuous.

[F8]

A bounded linear operator between normed spaces: a bounded linear operator has finite operator norm and obeys ∥Tv∥≤∥T∥∥v∥.

[F9]

Haar averaging of bounded operators as a weak operator integral: normalized Haar averaging is defined for compact Hausdorff groups and strongly continuous unitary representations on complex Hilbert spaces.

[F10]

Haar averaging projects contractively onto the bounded intertwiners: under full AC and those compactness/continuity hypotheses, the averaged operator is a contractive idempotent whose range is the bounded intertwiner space.

[F11]

The orthogonal projection PWv is the W-component in V=W⊕W⊥: on a finite-dimensional inner-product space, the orthogonal projection onto a subspace is the component map associated with the orthogonal direct sum of that subspace and its orthogonal complement.

Proof

technique · direct application of Haar averaging and Hilbert geometry
1.1givenF3F4F7algebra

For each dual factor, choose an orthonormal basis of Ve and use its dual-basis inner product; this is basis-independent because a change between orthonormal bases preserves the Euclidean coefficient norm. The matrix of the dual action is the transpose of the inverse unitary matrix, hence is unitary. Tensor products of orthonormal bases are an orthonormal basis for the displayed tensor inner product, so the diagonal action is unitary by [F3]–[F4]. The graph has finitely many incident edges and each Ve is finite-dimensional, so this orthonormal basis of Wv is finite. Its coordinate map is an isometry to some CN, which is complete by coordinatewise completeness; hence Wv is a complex Hilbert space. Its matrix entries are finite sums and products of continuous entries of the edge representations, so [F7] makes Rv strongly continuous.

2.1givenF6F8step 1.1algebra

For fixed w∈Wv, define Tw:C→Wv by Tw(z)=zw, with the trivial representation on C. It is linear and bounded by [F8], with ∥Tw∥=∥w∥. The intertwining equation Tw(z)=Rv(g)Tw(z) for all z is equivalent to w∈WvSU(2).

3.1givenF1F2F5F6F7F9F10step 1.1step 2.1algebra

By [F1], SU(2) is compact Hausdorff; by [F2] and [F5], its normalized Haar probability exists under the stated full AC assumption. The hypotheses of [F9]–[F10] now hold for H=C, J=Wv, and T=Tw, using [F6], [F7], and steps 1.1 and 2.1. Since the trivial representation acts as the identity, the weak Haar average of Tw is TPvw, where the finite-dimensional vector integral is defined coordinatewise. The range clause of [F10] therefore gives Pv2=Pv, ∥Pv∥≤1, and ran⁡Pv=WvSU(2).

4.1givenF10F11step 3.1algebra

If x∈ran⁡Pv and y∈ker⁡Pv, then Pv(x+ty)=x for every complex scalar t. Contractivity gives ∥x∥≤∥x+ty∥. Squaring and taking real t of both signs forces Re⁡⟨x,y⟩=0; taking t purely imaginary of both signs forces Im⁡⟨x,y⟩=0. Hence range and kernel are orthogonal. Since an idempotent has Wv=ran⁡Pv⊕ker⁡Pv, the kernel is the orthogonal complement of the range, and [F11] identifies Pv as the orthogonal projection onto its invariant range.

5.1givenF3F6step 4.1algebra∎

Equip W=⨂vWv with the tensor-product inner product, defined on elementary tensors by ⟨⨂vxv,⨂vyv⟩=∏v⟨xv,yv⟩ and extended sesquilinearly. The graph has finitely many vertices and every Wv has a finite orthonormal basis, so the corresponding tensor basis is finite and W is finite-dimensional. Each vertex operator acts as Pv on one factor and the identity on the others. Operators on distinct tensor factors commute, so their product is an idempotent whose range is ⨂vran⁡Pv, the tensors invariant under every vertex action. Tensor products of orthogonal projections are orthogonal projections for this inner product, so the product projects orthogonally onto that joint invariant subspace. If the graph has no vertices, the empty product is the identity on C, consistent with the statement.

Remarks

The imported Haar theorem's full-Axiom-of-Choice hypothesis is retained explicitly; compactness or finite dimension does not remove that adopted premise from this supplier interface. The projection concerns finite vertex representation spaces only and does not construct a physical Hilbert space for gravity.

5 · Examples, experiments and counterexamples

None yet.

Sources