SURFACE / ORDERACTUAL BRANCH MODULES

GRAPHS · KERNELS · IMAGES · MONODROMY

Follow a filtration through a dessin module.

The infinite locally gentle algebra comes from the clean dessin on y² = xᵐ − 1, β = xᵐ. This tool displays finite modules inside that algebra: bᵢ = 0, aᵢ = identity except a₀ = T. A finite module drawing does not replace the infinite algebra.

Each ring is one basis layer; a node is (quiver vertex, basis vector). Cyan marks displayed basis vectors lying in the selected subspace, not a canonical basis for arbitrary subspaces. Solid arrows are nonzero coefficients of the actual a maps; b maps vanish. This is a 3D projection of a coefficient graph, not a uniformizing embedding of the Riemann surface.

Unbounded path coordinates are faithful

For the genus-two algebra, a positive branch path has image tᵠEᵢⱼ in one polynomial-matrix factor, where i < j or q > 0, and length 5q + j − i. Shared stationary images are (Eᵢᵢ,Eᵢᵢ). Reading a branch, entry and coefficient recovers every finite normal expansion; the Lean theorem has no degree cutoff. Membership and spanning are now proved: the actual generated algebra has unique finite normal coordinates with an explicit inverse. A separately constructed path-quotient algebra equivalence and its universal property still need formal packaging.

Actual algebra, module and normal-image Lean proofs · Exact path-coordinate checker · Million-degree selector evidence · Constructive generator-product checker · Generated-algebra round trips

Correcting the original graph example

For f(e₁)=e₂, f(e₂)=e₃, f(e₃)=0, the full graph includes (e₃,0). The graph of f² includes (e₁,e₃), (e₂,0), (e₃,0); both graphs have dimension three. For every full graph Γ(T), Γ(T)ʳ(0)=0. The ordinary stable kernel instead uses the inverse relation.

With g the reverse nilpotent shift, gf = diag(1,1,0) has stable kernel ke₃, while fg = diag(0,1,1) has stable kernel ke₁. Kernel/image splitting requires finite-length hypotheses; it is not an automatic decomposition of every infinite module.

Exact rational checker · Eleven kernel-checked relation and Fitting statements · Exact finite evidence · Formal coverage and remaining boundaries

The determinant det(1 − zL) = det(1 − zᵐT) follows from cyclic block elimination. Its band roots need not lie on the unit circle. This computation supplies no arithmetic zero-location theorem, derived/Fukaya equivalence or GRH proof.