Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-generatedPipeline-generatedprecheck pending
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.

Affine filling and the exact reducible-locus repair step

Example

Assume ZF together with the Axiom of Choice. Let M=S3 or S4, let N≥2, take the trivial principal right SU(N)-bundle P=M×SU(N), and use its zero connection as affine origin. For any integer j≥1 and any continuous sphere family f:Sj→A∞∗ of smooth connections on P, the cone formula F([r,x])=rf(x) extends f continuously over Dj+1 in the full affine connection space. The apex is the zero connection, whose holonomy group is the identity and which preserves every complex line, so this affine filling is reducible and does not lie entirely in A∞∗. Relative avoidance changes the filling while fixing its boundary and produces a filling in A∞∗; contraction of the disk to any chosen boundary point gives a based nullhomotopy. The weak-contractibility theorem ensures that such families exist for the trivial bundle and that their based homotopy classes vanish.

Facts & Assumptions

Given: ZF and the Axiom of Choice; M=S3 or S4; N≥2; the trivial principal right SU(N)-bundle; its product connection 0; and a continuous map f:Sj→A∞∗ for j≥1.

[A1]

The Axiom of Choice means every family of nonempty sets has a choice function (The Axiom of Choice).

[F1]

In the trivialization P=M×SU(N), the affine connection space is Ω1(M;su(N)) translated by the product connection, and the product connection has identity holonomy around every loop (Smooth and Sobolev configuration and reduced gauge spaces).

[F2]

The relative avoidance lemma homotopes a continuous finite-polyhedron family into A∞∗ while fixing its irreducible values on a subpolyhedron (Relative finite-parameter avoidance of reducible connections).

[F3]

The weak-contractibility theorem asserts nonemptiness and vanishing of all based homotopy groups for this irreducible locus, under the same bundle, dimension, and group hypotheses (Weak contractibility of the irreducible connection locus).

Proof

technique · explicit affine cone and relative repair
1.1F1givenalgebra

The zero connection has parallel transport equal to the identity in the product trivialization, so its based holonomy group is {IN}. Since N≥2, every complex line in CN is a nonzero proper subspace invariant under IN. Thus 0∉A∞∗.

1.2F1givenalgebraconstruct

The cone Dj+1=CSj identifies all (0,x) to one apex and has boundary parameter r=1. The formula F([r,x])=rf(x) is well-defined because it is independent of x at r=0, and equals f(x) at r=1. For every continuous section seminorm p, compactness of Sj gives Cp=sup⁡xp(f(x))<∞, so p(F([r,x]))≤rCp→0 as r→0. Away from the apex, continuity follows from continuity of f and scalar multiplication in the Fréchet vector space. Hence F is a continuous affine filling in A∞.

2.1step 1.1step 1.2algebra

By step 1.1, the apex value lies outside A∞∗; therefore this explicit extension is not an irreducible filling, regardless of its irreducible boundary values. In particular, convexity of the full affine space does not imply convexity of its irreducible subset.

2.2F2givenstep 1.2constructalgebra

Apply [F2] to F with K=Dj+1 and L=Sj. The lemma fixes the boundary and supplies a homotopic endpoint F~:Dj+1→A∞∗. If x0∈Sj is the based point with f(x0)=A, the maps x↦F~((1−t)x+tx0) stay in the disk, remain in A∞∗, and fix x0. Their restriction to the boundary is a based nullhomotopy of f.

3.1A1F3step 2.2algebra∎

Theorem [F3] supplies such irreducible sphere families, for example the constant family at any irreducible connection, and identifies the conclusion with vanishing of πj(A∞∗,A). The example therefore isolates the precise role of relative avoidance: it upgrades a continuous affine filling, which may hit a reducible connection, to an irreducible filling without moving the sphere family.

Depends on

Dependency tree · 2 levels

Sources