Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-14
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.

Uniform Laurent approximation through bundle automorphisms

Statement

Assume AC. Let X be compact Hausdorff and let f be a normalized automorphism of prXE on X×S1. Then f is homotopic through normalized automorphisms to a finite Laurent-polynomial family in the circle coordinate in local bundle charts. The coefficient endomorphisms vary continuously with x, and a finite partition of unity combines the local approximations. The approximation can be chosen uniformly close enough that the whole straight-line homotopy remains invertible. If two normalized clutching maps are homotopic through normalized automorphisms, normalized Laurent approximations of their endpoints can be joined by a normalized Laurent-polynomial homotopy.

Facts & Assumptions

Given: AC, compact Hausdorff X, a finite-rank complex bundle EX, and normalized f as in the statement.

[F1]

The normalization and clutching conventions are those of Normalized clutching data for bundles over X×S².

[F2]

A continuous map from a nonempty compact Hausdorff space to a uniform space is uniformly continuous (Every continuous map from a nonempty compact Hausdorff space to a uniform space is uniformly continuous).

[F3]

Continuous real functions on a compact interval are Riemann integrable (A continuous function on [a,b] is Riemann integrable, by Heine-Cantor and Riemann's criterion); complex matrix entries are integrated by real and imaginary parts.

[F4]
[A1]

AC is spent through [F5] in the cited partition result; the integrability supplier [F3] is used with its published hypotheses as stated.

Proof

technique · direct
1.1

Fix a bundle chart over an open UX whose closure is compact and lies in a larger chart. For an integer N1, use the Fejér kernel KN(t)=N11+eit++ei(N1)t2. It is nonnegative, has integral 2π, and expands as j<N(1j/N)eijt. Entrywise integration in [F3] therefore defines on U the Laurent polynomial pN(x,z)=j<N(1j/N)cj(x)zj, where cj(x)=(2π)1ππf(x,eit)eijtdt. Riemann-sum convergence uniform on compact chart closures makes every cj continuous in x.

F3constructalgebra
2.1

Let M bound the matrix entries of f on the compact chart closure times S1. Given ϵ>0, [F2] supplies δ>0 such that f(x,zeit)f(x,z)<ϵ/2 for t<δ. On tδ, KN(t)(Nsin2(δ/2))1, so the integral of the tail times the bound 2M is below ϵ/2 for all sufficiently large N. Since pNf is the convolution of f(x,zeit)f(x,z) with KN/(2π), the short-arc and tail estimates prove pNf uniformly on that chart closure.

F2step 1.1algebra
3.1

Choose finitely many such charts and a finite subordinate partition {ϕi} by [F4]. In chart i, choose a Laurent approximant pi within a common tolerance. The section ϕipi of End(E) has support inside its chart and extends by zero; hence p=iϕipi is a global finite Laurent polynomial in z. Because iϕi=1, the same tolerance bounds pf globally.

F4F5A1step 2.1constructalgebra
4.1

The automorphisms form an open subbundle of End(E): in a chart, invertibility is the open condition det0. Compactness of X×S1 and the finite chart cover give a positive tolerance such that every section within that tolerance of f is invertible, and every convex combination with f remains within it. Choose p accordingly. Since f(x,1)=I, p(x,1) is invertible; put q(x,z)=p(x,z)p(x,1)1. Then q is still Laurent polynomial, is normalized, and can be made arbitrarily close to f.

F1step 3.1algebra
5.1

The straight-line family hs=(1s)f+sq consists of automorphisms by step 4.1, depends continuously on (x,z,s), and satisfies hs(x,1)=I for every s. It is the required normalized homotopy. For the rank-zero bundle the unique family is already polynomial, and for X= every assertion is vacuous.

F1step 4.1construct
6.1

Let ft be a normalized automorphism homotopy. Apply steps 1.1–5.1 over the compact parameter space X×I to obtain a normalized Laurent family pt uniformly close to ft. If prescribed normalized Laurent approximations q0,q1 were chosen sufficiently close at the endpoints, the straight segments from q0 to p0 and from p1 to q1 stay in the same open automorphism neighborhood and remain Laurent and normalized. Concatenating these with pt gives the required normalized Laurent-polynomial homotopy.

F1step 1.1step 2.1step 3.1step 4.1step 5.1construct

Depends on

Used by

Dependency tree · two levels

51 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