Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-generatedPipeline-generatedprecheck passverified 2026-11-05 (gpt-6.1-sol)
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.

Elliptic product isogeny rescaling and restriction order

Statement

Assume AC and use the rational conditions σa,b on the product X=En, finite-index intersection image lattice Λn=im⁡(n!(cI)I)⊆Z2n, norm, and divisor H=∑iHi of the rational product-parameter lemma. For slicings put σ⪯ω when Pσ(θ)⊆Pω((−∞,θ]) for all θ, and σ≺ω when the endpoint is strict. Intervals here mean finite HN extension closures. Write σ⊗L for transport by tensoring with the line L.

For every effective sum D=∑i,j{qij}×∏k≠iEk of factor point divisors, σa,b⪯σa,b⊗O(D). If L has numerical first Chern class H, tensoring gives σa,b⊗L=σa,b+1.

Let πm:X→X be multiplication by m≥1. Define πm♯σ by inverse slicing along πm∗ and charge Zπm∗, and (πm)♯σ by inverse slicing along πm∗ and charge Zπm∗. Both are locally finite support-property conditions, with their actual coimage lattices and inherited norms. They satisfy πm♯σa,b=σm2a,m2b,(πm)♯σa,b=m2nσa/m2,b/m2, where a positive scalar changes only the charge. In particular these operations are inverse on these slicings and preserve ⪯,≺ whenever their two inputs are defined.

For each integer N≥1 there are rational a>0,b such that σa,b⊗LN≺σa,b[1]. These conditions are invariant under factor reflections and permutations, and all skyscrapers are semistable of phase one, with the full finite-lattice norm support specified above.

Facts & Assumptions

Given: The Statement's data, line-action convention and inverse-slicing conventions.

[F1]

Rational elliptic product parameters and full intersection support supplies the rational family, its actual Pic0 and translation symmetries, semistable phase-one points, full intersection support, restricted HRS uniqueness, and its nearby rational branch identification.

[F2]

Isotrivial fibre stability restriction from torsion invariance, proof1.1, supplies the support-over-finitely-many-base-points argument from actual invariance under all torsion lines of that base. It applies to HN factors of a factor-divisor-supported complex, whose slicing truncations commute with the flat-line action. No arbitrary restriction theorem is assumed.

[F3]

Compact adjunction and induced stability with its actual image lattice supplies inverse-image slicing along an exact conservative functor F between the stated smooth-projective bounded categories, when the compact adjoint hypotheses and FL(P(θ))⊆P([θ,∞)) hold. It supplies the HN triangles and support on the image of vF. For the isogeny, both adjunctions are finite flat and its relative dualizing line is trivial. Its compactness, bounded-reflection and adjoint hypotheses are checked below.

[F4]

Bridgeland stability condition with support property fixes the slicing and finite-HN conventions. The Axiom of Choice is inherited from F1 and F3.

Proof

Given: F1–F4.

1.1F4algebra

The order calculus follows directly from HN and Hom vanishing. An inequality σ⪯ω bounds the largest ω phase of every σ-semistable by its σ phase. Applying this to the finitely many σ-HN factors bounds ϕω+(E)≤ϕσ+(E) for every E. Conversely testing semistables recovers the definition. Equivalently every ω-semistable E has ϕω(E)≤ϕσ−(E): if its last σ-HN quotient had smaller phase, its ω-phases would all be smaller, contradicting the nonzero last quotient map from E. The reverse implication follows by the dual first-HN-map argument. The strict forms follow with the same nonzero maps and finite strict maxima/minima. These characterizations prove transitivity, transitivity mixing one strict and one nonstrict inequality, and invariance under every exact autoequivalence. They also give the lower-phase bound for all objects by applying the second characterization to finite ω-HN filtrations.

1.2F1F3constructalgebra

Multiplication by m is the finite étale quotient by Km=X[m], of degree d=m2n. Its trace pairing identifies its dualizing line with the trivial line: on local étale sheets the pairing is the sum of coordinate products. The two exact adjoint composites decompose as πm∗πm∗E≅⨁g∈Kmg∗E,πm∗πm∗E≅⨁χ∈K^mE⊗Lχ. The first equality is finite étale base change along X×πm,X,πmX=∐gGr⁡(g). For the second, decompose the finite étale algebra πm∗OX by character projectors d−1∑gχ(g)−1g; each eigensheaf has rank one, and its character power makes it torsion in Pic0. Both detecting functors are conservative, since each displayed composite contains the identity summand. For F3 take the ambient categories to be unbounded derived quasi-coherent complexes; coproducts and mapping telescopes are formed on complexes and preserve compatible triangles. On a smooth projective variety every bounded coherent complex is perfect; its finite locally free local models make it compact (global Hom is computed on a finite affine Cech cover), as in F1's compact-generator construction. Both functors preserve coproducts. Finite faithfully flat pullback reflects bounded coherence by faithfully flat descent of the finitely many coherent cohomology modules; finite pushforward reflects it because it is restriction of scalars along a finite algebra, and a module finite over the smaller ring is finite over the larger ring. Thus the bounded-reflection hypothesis holds in both directions. The left adjoint to the detecting F=πm∗ is L=πm∗; the left adjoint to F=πm∗ is L=πm∗ by the displayed finite-etale trace duality. F1 preserves all summands as slicings, so the two adjoint composites have exactly their original phases, verifying F3's required lower-phase condition in both directions. F3 now gives actual inverse-image conditions and their HN filtrations. Support is precisely the inherited bound on im⁡(vπm∗) or im⁡(vπm∗), not an assertion about an unproved larger lattice.

1.3F1algebra

A line L of numerical class H gives Za,b(E⊗L−1)=Za,b+1(E). Transport preserves torsion-flat invariance and phase-one points, so restricted uniqueness identifies σa,b⊗L=σa,b+1. The same proof works for integral powers and for any line numerically equivalent to them: their difference is in Pic0 on the product, and F1 gives actual invariance. This also shows that πm∗L and Lm2 act identically on the slicing.

2.1F1F2F4step 1.1construct

We prove the factor Bayer inequality for any actually base-Pic0-invariant condition, hence for F1's conditions. Write i:D={q}×M↪C×M and let F be semistable of phase θ. Its divisor triangle is i∗Li∗F[−1]→F(−D)→F→i∗Li∗F. Let G be the highest HN factor of i∗Li∗F. Every base-flat line fixes that whole object, so uniqueness of HN makes it fix G. F2's support argument puts G over finitely many points of C; splitting into its disjoint-fibre-supported summands and projecting the HN filtration to any fibre other than q would give an HN filtration of zero there. Thus G is supported set-theoretically on D. The line O(D) is trivial on an open neighbourhood of q in C, so it is trivial on this support and on its formal thickenings. Apply Hom⁡(G,−) to F→i∗Li∗F→F(−D)[1]. The nonzero highest HN map yields a nonzero map G→F or G→F(−D)[1]; the latter Hom group identifies with Hom⁡(G,F[1]) by that trivialization. Hence ϕ(G)≤θ+1. The original triangle gives ϕ+(F(−D))≤max⁡(θ,ϕ(G)−1)≤θ. Equivalently ϕσ⊗O(D)+(F)≤θ, proving σ⪯σ⊗O(D). This applies successively to point divisors on every factor; step1.1 gives all their effective sums.

2.2F1F3step 1.2algebra

The induced conditions retain torsion-flat invariance. For the inverse slicing along πm∗, projection against tensoring is literal. For that along πm∗, write a torsion line upstairs as πm∗M with M torsion downstairs; this is possible because a finite character on the source lattice extends to the finite-index target lattice by choosing finite-order roots. Projection formula then proves invariance. Translations similarly commute with πm∗ and πm∗ after choosing a translation lift under the surjective isogeny. Points in the πm∗ inverse slicing push to points; points in the πm∗ inverse slicing pull to direct sums of reduced points. They are therefore semistable of phase one in both conditions; multiplying the charge by a positive number does not alter this phase.

2.3F1F3step 1.1step 1.2algebra

The operations are inverse on these slicings even before using their parameter formulas. For example E lies in the inverse slicing detected by πm∗πm∗ precisely when ⨁χE⊗Lχ lies in P(θ). If E lies there, every summand does by invariance. Conversely the identity summand belongs there because phase categories are closed under direct summands: its HN filtration would otherwise contribute a forbidden phase to the sum. The translation composite is identical. If σ⪯ω and both inverse-image data are conditions, their HN filtrations are carried by the detecting exact functor to the ambient HN filtrations with the same ordered phases; conservativity keeps every nonzero factor nonzero. Applying the largest-phase characterization of step1.1 proves order preservation. Strict inequalities are preserved by the same finite maximum argument.

3.1F1step 1.2step 2.2algebra

In degree 2j, multiplication by m acts by m2j, since it multiplies degree-one cohomology by m and the cohomology ring is the exterior algebra of that of the elliptic factors. Trace/pullback gives the pushforward factor m2n−2j. Thus expansion of the exponential gives Za,bπm∗=m2nZa/m2,b/m2,Za,bπm∗=Zm2a,m2b. These are also equalities on every intersection coordinate, so the charges factor through their precise coimage lattices. The restricted uniqueness of F1, with the actual invariance and point semistabilities proved in step2.2, identifies the entire slicings with the rational conditions in the Statement. This is the required global identification argument at these particular charges; equality of the displayed polynomials alone would not suffice.

4.1F1step 3.1step 2.3step 1.3construct

Start with σ1,0. By F1's branch identification there is ϵ>0 such that the rational condition σ1,δ has slicing distance less than one from it whenever 0<δ<ϵ is rational. Consequently σ1,δ≺σ1,0[1]: an object of the first slicing of phase θ has old largest phase strictly less than θ+1, which is phase strictly less than θ for the shifted condition. Choose m with 1/m2<ϵ. Steps3.1 and1.3 identify (πm)♯(πm♯σ1,0⊗L)=m2nσ1,1/m2. The positive scalar is irrelevant to this order. Apply πm♯ to this strict comparison and use step2.3 to obtain σm2,0⊗L≺σm2,0[1]. Every datum used here is a defined stability condition by steps1.2–1.3.

5.1F1step 1.1step 2.1step 3.1step 2.3step 1.3step 4.1algebra∎

Choose k with k2≥N and apply πk♯ to step4.1. Projection formula gives πk♯(τ⊗L)=(πk♯τ)⊗πk∗L; its charge and slicing equalities are direct from the detecting functor πk∗. Hence σk2m2,0⊗Lk2≺σk2m2,0[1]. Step2.1, applied repeatedly and transported by line powers, gives σ⊗LN⪯σ⊗Lk2. Mixed transitivity yields the claimed restriction-N inequality, with explicit possible parameters (a,b)=(k2m2,0). The factor reflections/permutations, point phases and finite-lattice support are exactly F1's actual conclusions and are retained by these choices.

Depends on

Dependency tree · 2 levels

Sources