Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedaudited 2026-09-22
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.

Weighted circle actions and weighted projective singular quotients

Example

Assume ACω. Fix n1 and integers w1,,wn1 and let the circle act on Cn with the standard form ω0 by

eiθ(z1,,zn)=(eiw1θz1,,eiwnθzn).

This action is Hamiltonian with μ(z)=12jwjzj2+c. Fix c>0 and reduce at 0. If some weight satisfies wj2, then the circle acts not freely on μ1(0): the point with only the j-th coordinate nonzero has stabilizer the group of wj-th roots of unity. The quotient of this level is the weighted projective space CP(w1,,wn), a possibly ineffective orbifold locally modeled by finite cyclic quotients in its natural quotient structure rather than a quotient to which the free-action reduction theorem applies. (Its coarse underlying space can still be a manifold in low-dimensional or ineffective cases.) This exhibits why freeness cannot be erased from the theorem of this page.

Facts & Assumptions

Given: ACω, n1, weights w1,,wn1, the weighted circle action on Cn with ω0=jdxjdyj, and c>0.

[A1]

ACω is The Axiom of Countable Choice (ACω) and is inherited through the fundamental-field and reduction interfaces; the finite coordinate constructions below need no additional choice.

[F1]

The scalar case shows how to contract the fundamental field; for the weighted action and ξ=1 the fundamental field is ξM=jwj(yjxjxjyj). Circle rotation on complex n-space and its quadratic moment map, Fundamental vector fields for a left action.

[F2]

The component equation is dμξ=ιξMω0 and the coadjoint action of the circle is trivial. Circle rotation on complex n-space and its quadratic moment map.

[F3]

The reduction theorem applies only when the value is regular and the stabilizer action on the level is free and proper; No conclusion about a singular quotient is imported from the boundary remark; its cyclic charts are constructed below. Marsden--Weinstein--Meyer symplectic reduction, Regularity of a moment map is equivalent to local freeness, Nonregular or nonfree symplectic quotients need not be manifolds.

Proof

technique · direct
1.1

With zj=xj+iyj, contraction of the weighted fundamental field against ω0 gives ιξMω0=jwj(yjdyj+xjdxj)=d(12jwjzj2), so μ(z)=12jwjzj2+c satisfies the component equation for every constant c by [F2].

F1F2given
2.1

The function μ is invariant under the weighted action because each zj is, and the coadjoint action of the circle is trivial; hence μ is an equivariant moment map.

step 1.1F2
3.1

Since n1 and c>0, the level μ1(0) is the nonempty ellipsoid jwjzj2=2c. For each j, it contains the point with zj2=2c/wj and all other coordinates zero. At that point the equation eiwjθzj=zj holds exactly when eiwjθ=1, so the stabilizer is the cyclic group of order wj. If wj2 this is nontrivial, so the action on this level is not free and the hypotheses of [F3] fail. At every point of the level some coordinate is nonzero, so dμ=jwj(xjdxj+yjdyj) is nonzero: the value is regular. Stabilizers are finite since they are intersections of the cyclic groups for the nonzero coordinates. The action is proper because the circle is compact. Thus it is precisely freeness that fails when a weight exceeds one.

step 2.1F3givenalgebra
4.1

Define weighted projective space as (Cn{0})/C for the action λz=(λwjzj)j. For each nonzero z, the function fz(r)=jwjr2wjzj2 is continuous and strictly increasing from 0 to infinity on r>0, so has a unique solution r(z) to fz(r)=2c. Its derivative is positive; the implicit function theorem shows r(z) is smooth. Radial normalization zr(z)z meets every complex orbit in exactly one circle orbit, since λ=reiθ uniquely. This normalization and the level inclusion induce mutually inverse continuous quotient maps, identifying the level quotient with weighted projective space.

givenstep 3.1algebra
5.1

On the open set zj0, choose a complex scalar with λwjzj=1. The residual ambiguity is precisely ζwj=1, acting on the remaining coordinates by ukζwkuk. Thus the quotient has chart Cn1/μwj. Locally on overlaps one chooses a root of the nonzero coordinate; the corresponding coordinate substitutions are holomorphic with holomorphic inverses, and two choices differ by the indicated finite group actions. These charts give the natural, possibly ineffective orbifold structure. At the axis point the whole chart group fixes the origin. At a general point the stabilizer is the subgroup fixing all nonzero coordinates, hence cyclic as in step 3.1. The common ineffective subgroup has order gcd(w1,,wn): a scalar acts identically exactly when all its wj-th powers equal one. This chart construction is independent of any unproved singular-reduction assertion in [F3].

step 4.1step 3.1algebra
6.1

For n=1 the coarse quotient is a point and its orbifold chart retains the group μw1 acting trivially. If all weights are one, all stabilizers are trivial and the charts are the ordinary projective charts. Nontrivial isotropy need not make the coarse space nonmanifold (already a finite rotation quotient of C has underlying space C). The example therefore exhibits failure of the free-action hypothesis, not a claim that every nonfree quotient fails to be a manifold. The assumption n1 excludes the empty level at n=0 and c>0.

step 5.1step 3.1F3A1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

33 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