Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-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.

Left Maurer--Cartan form

Definition

Assume ACω as in The Axiom of Countable Choice (ACω), let G be a Lie group Lie group with identity e, and write g=TeG. A g-valued one-form on G means a smooth map α:TG→g whose restriction αg:TgG→g is linear for every g. Equivalently, V↦(πG(V),α(V)) is a smooth vector-bundle map TG→G×g over id⁡G in the sense of Vector bundle maps over a smooth base map.

The left Maurer--Cartan form is the g-valued one-form θ:TG→g whose fibre map at g is

θg=d(Lg−1)g:TgG⟶TeG=g.

This formula is well-defined because left translation by g−1 sends g to e. It is smooth and fibrewise linear because Translations are diffeomorphisms and their differentials trivialize the tangent bundle identifies

TG⟶G×g,Vg⟼(g,θgVg)

as the inverse vector-bundle isomorphism to left trivialization. In particular, θe=d(Le)e=id⁡g.

The stated ACω is used exactly through that supplied smooth left-trivialization theorem; the pointwise formula and passage to its second component add no choice. A Lie group is nonempty. When dim⁡G=0, θ is the unique map between zero tangent fibres, and the definition is unchanged in dimension one. Lie groups are boundaryless by convention, and no metric, nondegeneracy, endpoint, or biconditional occurs.

Depends on

Dependency tree · 2 levels

Sources