Alphabeta Math
PropositionStatement: AI-adaptedProof: AI-adaptedPipeline-generated
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.

Canonical resolution of marked ideals

Statement

Assume AC (The Axiom of Choice).

Let K be an algebraically closed field of characteristic zero and let (I,E,μ) be a marked ideal with μ≥1 on a smooth K-scheme X of finite type (Marked ideals and their support), where I is not identically zero on any irreducible component of X (equivalently, its stalk at each component's generic point is nonzero). Then (I,E,μ) admits a canonical resolution: a resolution (Xi)0≤i≤m, X0=X, satisfying the four conditions of Canonical resolutions with invariants of a marked ideal: (1) there are successively defined invariants inv⁡, ν and ρ with values in Q≥0×Q≥0∞, Q≥0 and Sub⁡(Ei) respectively and finite ranges on each support; inv⁡ and the lexicographically ordered pairs (inv⁡,ν) and (inv⁡,ρ) are upper semicontinuous there, equivalently the auxiliary functions are upper semicontinuous on each fixed-inv⁡ stratum; (2) the centers Ci of the blow-ups are regular, are contained in the supports, have SNC with Ei, and are the locus where the pair (inv⁡,ρ) attains its maximum (components of the maximal locus of inv⁡); (3) after blowing up Ci, (a) for x∈supp⁡(Ii+1,Ei+1,μ) with σi+1(x)∈Ci either inv⁡(x)<inv⁡(σi+1(x)) or inv⁡(x)=inv⁡(σi+1(x)) and ν(x)<ν(σi+1(x)); (b) for σi+1(x)∉Ci the three invariants are unchanged; (4) for every etale morphism φ ⁣:X′→X the induced sequence φ∗(Xi) is an extension of the canonical resolution of φ∗(I,E,μ) and the invariants agree. The construction is an induction on dim⁡X and proceeds in two steps: Step 1 resolves marked ideals of maximal order by first replacing the ideal with the equivalent coefficient ideal of its homogenization, then moving marked ideals and normal-crossings strata apart (Step 1a), removing codimension-one components (Step 1ba) and reducing to hypersurfaces of maximal contact (Step 1bb), where the glueing lemma makes the invariant independent of the chosen tangent direction and the inductive hypothesis on the hypersurface provides the next center; Step 2 resolves a general marked ideal by decreasing the maximal order of its non-monomial part through the companion ideal (Step 2a), reducing to the monomial case (Step 2b), whose resolution is finite because ν takes values in the discrete set 1μZ≥0.

Facts & Assumptions

Given: Assume AC. Let K be an algebraically closed field of characteristic zero, let X be a smooth finite-type K-scheme, and let (I,E,μ) be a marked ideal with μ≥1 and I nonzero at the generic point of every component.

[A2]

The Axiom of Choice: AC is assumed for the marked-sum, completion, and regular-local UFD suppliers used in the construction.

[A1]

Encode each source invariant coordinate by the order embedding q↦(0,q) for q∈Q≥0 and ∞↦(1,0) into Q≥02. Apply this map once when a source coordinate is introduced. An invariant returned by a lower-dimensional or companion induction is already encoded; prepend the new encoded coordinates directly and never encode that returned tuple again. Thus, for example, the source values (s,∞,0,0,…) and (0,∞,0,0,…) are compared using the rational tuples ((0,s),(1,0),(0,0),(0,0),…) and ((0,0),(1,0),(0,0),(0,0),…), respectively. Flatten each displayed pair and each grouped tuple into a single rational sequence, identified with its first coordinate and its remaining infinite tail in the stated codomain. This preserves lexicographic comparisons and uses only rational coordinates.

[F1]

Marked ideals of maximal order, tangent directions and transversality to the exceptional divisors, Iterated derivative ideals preserve support in the safe characteristic range: a marked ideal is of maximal order when Dμ(I)=OX; its support is V(Dμ−1I), and tangent directions are multiplicity-one sections of T(I)=Dμ−1I.

[F2]

The homogenized ideal is equivalent to the marked ideal, The coefficient ideal is equivalent to the marked ideal: (J,μ)≃(H(J),μ)≃C(H(J),μ); replacing a marked ideal by an equivalent one does not change its supports, its admissible centers or the resolution process.

[F3]

Glueing of homogenized ideals along etale neighbourhoods, An automorphism of the completed local ring matching two tangent directions preserves the homogenization: homogenized ideals look the same from all tangent directions, and the étale neighbourhoods constructed from two tangent directions identify the two pullbacks; hence invariants defined via different tangent directions agree.

[F4]

The coefficient ideal controls the support after restriction, Coefficient-ideal control with centres allowed off the subvariety, Refined maximal-contact statement via the coefficient ideal: restriction of the coefficient ideal to a smooth subvariety computes the support on that subvariety, and multiple test blow-ups of the restriction define ones of the ambient marked ideal with centers in the strict transforms.

[F5]

Codimension-one components of a maximal-order support: codimension-one maximal-order support components are smooth and isolated. Their labelled Cartier ideal division gives the unit ideal near the exceptional divisor; this is an admissible controlled transform when the component has SNC with the boundary.

[F6]

Order functions and normal-crossings strata are upper semicontinuous: the order function and normal-crossings count sE are upper semicontinuous; finite-range lexicographic assembly preserves this property. Upper semicontinuity of the algorithm's branchwise invariants must be proved in the induction below; it is not supplied by the definition.

[F7]

The monomial part, the non-monomial part and the companion ideal, Addition and multiplication of marked ideals: if the support is empty, Step 2 is terminal and no companion is used. If ord⁡N(I)=0, the marked ideal is handled directly by the monomial Step 2b; when the input is of maximal order, (M(I),μ) is an equivalent maximal-order input for Step 1. If ord⁡N(I)>0, the companion O(I,μ) is of maximal order with support supp⁡(I,μ)∩{x:ord⁡xN(I)=ord⁡N(I)}; its sum branch has positive marks and uses the AC clause of the addition lemma. It is considered on the open neighbourhood of the original support where ord⁡(N)≤r. A positive-residual-order companion is not asserted to be equivalent to the entire original input.

[F8]

Canonical resolutions with invariants of a marked ideal, Equivalence of marked ideals, Multiple test blow-ups, controlled transforms and resolutions of marked ideals: a canonical resolution is a resolution whose invariants satisfy conditions (1)–(4) of the definition; equivalence preserves supports and multiple test blow-ups at every stage.

[F9]

Locally finite type and finite type morphisms, Chain dimension and the empty-space convention: X is Noetherian of finite dimension, so an induction on dim⁡X is available, and closed subsets have finitely many irreducible components.

[F10]

Affine blowup standard charts and overlaps: for a center ideal generated by regular parameters, its chart indexed by a generator w has coordinate ring R[I/w]; the other center parameters divide by w, and the new exceptional divisor has equation w=0.

Proof

1.1A2F2F9

Induction setup. We argue by induction on d=dim⁡X, componentwise on the disjoint irreducible components of the smooth scheme. For d=0, X is a finite disjoint union of K-points; the generic-nonzero hypothesis makes I=OX on every component, so the support is empty and the trivial sequence is the canonical resolution. Assume the proposition for smooth schemes of dimension <d and marked ideals satisfying the stated positive-marking and componentwise generic-nonvanishing hypotheses; by [F2] we may replace any marked ideal of maximal order by its equivalent C(H(J,μ)), and we do so without changing the supports or the admissible centers.

1.2A2A1F5F6

Step 1a, eliminating strata contained in the support. At the start of each nonterminal Step 1a pass at stage i, compute and hold fixed for that pass si=max⁡{si(x):x∈supp⁡(Ji,Ei,μ)}, where si(x) counts strict transforms of the boundary family E fixed when this maximal-order Step 1 begins; new exceptional divisors created during Step 1a remain in the full Ei but are not added to this boundary count. If the support is empty, terminate; if si=0, finish Step 1a and proceed to Step 1b without restricting to H0=X. For si>0, use only irreducible components Hα,isi of intersections of exactly si boundary components that meet the support. These strata are smooth and have finitely many pairwise disjoint irreducible components; taking them componentwise ensures that each retained restricted ideal is generically nonzero unless the stratum belongs to the contained-support branch. Their intersections with the support are pairwise disjoint: a point in two distinct such pieces would lie on more than si boundary components. The ambient intersections can overlap away from the support, where the induced test blow-ups are identities. If Hα,isi⊆supp⁡(Ji,Ei,μ), blow up this stratum. For si≥2, the boundary count drops at every support point above it; for si=1, [F5] shows that the controlled transform has empty support above the codimension-one stratum. Assign points of this stratum the source invariant (si,∞,0,0,…), represented by ((0,si),(1,0),(0,0),(0,0),…) under [A1], with ν=0 and ρ=∅. This is lexicographically above the finite lower-dimensional invariant values on the other support pieces. Recompute s only at the start of the next pass.

1.3A2A1F5F10

Step 1b, codimension-one components. After Step 1a reaches s=0, no strict transform of the inherited Step 1 boundary family meets the support. If the support has codimension-one components, [F5] shows they are smooth and isolated from the remaining support. They are strict transforms of the original such components: maximal order makes the ideal order at the generic point of each earlier center exactly its marking, so division by that exceptional power leaves no new exceptional component in the support. Every earlier center is contained in an isolated component or disjoint from it. For a center contained in a smooth component C=(u=0), choose adapted regular parameters for that center including u and the equations of the exceptional divisors already transverse to C; this is possible because the center is regular and SNC with that boundary. In a blowup chart indexed by another center parameter w, the strict transform of C has equation u/w=0 and the new exceptional divisor has equation w=0; the chart indexed by u misses the strict transform. These coordinate charts preserve simultaneous SNC of C with the newly created boundary members, by induction over the preceding blowups. Since the inherited boundary no longer meets the support, C has SNC with the full current boundary. Its labelled Cartier blowup is therefore admissible under [F5]; assign them the source invariant (0,∞,0,…), represented under [A1] by ((0,0),(1,0),(0,0),…), with ν=0 and ρ=∅. This is above all finite lower-dimensional invariant values, so these components are the next centers. Blowing them up makes the controlled-transform support empty above them. The remaining support has codimension at least two.

1.4A2F6F7F8

Step 2b, the monomial case. If the support is empty, terminate. Otherwise, for a monomial ideal I=M(I)=∏DxDaD, set inv⁡=(0,0,…) and ν(x)=ord⁡x(I)/μ. At each point, let A be the inclusion-minimal threshold subset selected by the source's maximal ρ rule: ∑D∈AaD≥μ, while ∑D∈A∖{D0}aD<μ for every D0∈A. The maximal locus of (inv⁡,ρ) gives the regular SNC center locally defined by the divisors in this selected A. In a blow-up chart indexed by any Dj∈A, the new exceptional exponent is a=∑D∈AaD−μ<aDj, by the minimality condition with D0=Dj. For any surviving support point q above p∈C, the old strict boundary divisors through q are among those through p, except for the chart divisor Dj, whose old exponent is replaced by a<aDj. Hence ord⁡q(Mnew)≤a+∑D∋p, D≠DjaD<ord⁡p(M); divisors missing q only lower the sum. Thus at every support point above the center the total monomial order drops, so ν strictly drops while the monomial-case inv⁡ stays fixed; equivalently, (inv⁡,ν) strictly descends. There are finitely many initial maximal support components. Each chosen component is replaced by finitely many maximal components above it, and the maximum monomial order on each new component is strictly smaller, as shown by the chart inequality. This is a finitely branching replacement tree whose path length is bounded by the initial integer monomial-order maximum. It is finite, so the process terminates with empty support; the discreteness of ν∈1μZ≥0 provides this integer bound.

2.1A2F4F6step 1.2

Step 1ab, moving support away from maximal boundary strata. This branch occurs only for the pass-start value si>0, after all strata contained in the support have been blown up. Resolve each lower-dimensional restricted marked ideal on Hα,isi. These restrictions are generically nonzero: at the generic point of a retained component the ambient support is absent, and [F4] identifies the restricted support with its ambient intersection. The restricted support pieces are disjoint, so their canonical sequences glue; on ambient overlaps outside the support there are no centers and the induced maps are identities. By [F4], each restricted support equals the corresponding ambient support intersection, and the glued sequence is a multiple test blow-up of the ambient ideal. On a support piece use inv⁡(x)=((0,sE(x)),inv⁡Ji∣Hα,isi(x)), encoding the finite leading coordinate by [A1], with the restricted ν and ρ; the support piece determines the stratum uniquely. By induction, above each center the pair (inv⁡,ν) strictly descends, while off the center the induced map is the identity and the invariants are unchanged. Once all these restrictions are resolved, no support point remains on any maximal stratum from the pass-start boundary count, so the maximum boundary count drops before the next pass; recompute it only at that next pass. As the count is a nonnegative integer, finitely many passes reach si=0, and then Step 1b begins.

2.2A2A1F1F3F4F6F10step 1.3

Step 1b, hypersurfaces of maximal contact. When the inherited Step 1 boundary misses the support, first remove codimension-one support components as in 1.3. For the remaining codimension-at-least-two support, use the strict transforms of tangent hypersurfaces chosen on finitely many initial Step 1 charts, with the inherited boundary temporarily forgotten. These charts cover the surviving support: the original isolated codimension-one pieces have already been removed. By Derivative ideals under a multiple test blow-up, their controlled equations remain in the transformed tangent ideal, and The supports of a multiple test blow-up stay inside the strict transforms of a hypersurface of maximal contact puts the support in their strict transforms. They are simultaneously transverse to the newly created boundary: initially that boundary is empty; if a regular center lies in V(u) and is SNC with the existing boundary transverse to V(u), choose adapted center parameters including u. In a chart indexed by another center parameter w, the equations are u/w for the strict hypersurface and w for the new exceptional divisor, along with the surviving old boundary parameters; the u-chart has no hypersurface support. Thus transversality persists. The inherited boundary now misses the support, so these transformed hypersurfaces are transverse to the full boundary there, as [F3] requires. Write V(u) for such a transformed hypersurface. Its coefficient-ideal restriction is generically nonzero on each component, since [F4] identifies its support with a subset of ambient codimension at least two, hence a proper subset of every hypersurface component. By [F4], the inductive resolution on V(u) transfers to the ambient ideal; off the restricted support, this transfer is an isomorphism. Set inv⁡(x)=((0,0),inv⁡J∣V(u)(x)), with ν,ρ from the restriction. Apply [F3] to two initial tangent directions with the inherited boundary forgotten, and lift its étale comparisons along the preceding test sequence. The new exceptional divisors are preserved by these lifted comparisons; near the surviving support the inherited boundary is absent. Hence they identify the pulled-back homogenized ideals and the full current boundary, so the values, centers, and local resolutions agree on overlaps. Thus above every transferred center (inv⁡,ν) strictly descends by induction, and off the center all invariants are unchanged. The local sequences glue to the canonical resolution.

3.1A2A1F7F8step 2.2

Step 2, the companion reduction and monomial case. If supp⁡(I,E,μ)=∅, the resolution is complete. Otherwise factor I=M(I)N(I) and compute r=ord⁡N(I) as in [F7]. If r=0, N(I) is a unit on a neighbourhood of the support, so the marked ideal agrees there with (M(I),μ): resolve this neighbourhood by Step 2b and extend by the identity outside its support, without forming a companion. The maximal-order Step 1 may use (M(I),μ) only when the original input is already of maximal order. If r>0, form the maximal-order companion O(I,μ) and apply Step 1. For r<μ, a companion test sequence is simultaneously admissible for (N,r) and (M,μ−r), and their product transforms to (Ii,μ) by the product rule. For r≥μ, the controlled transform of I is the transformed (N,r) times a monomial factor, with each new exponent containing r−μ≥0. Thus every companion center is admissible for (I,μ) in either case. Write Ni∗ for the transform of (N,r); it remains of maximal order by Controlled transforms preserve maximal order on nonempty transformed schemes. Factoring its exceptional powers gives N(Ii), so ord⁡N(Ii)≤ord⁡Ni∗≤r. At a point with ord⁡N(Ii)=r, every exceptional factor removed from Ni∗ is a unit there, so ord⁡Ni∗=r. If that point is in the original marked support, it is in the transformed companion support by the sum-support rule (or directly when r≥μ). Consequently clearing the companion support lowers the maximum order of N(Ii) on the remaining original support, so the first source coordinate r/μ, represented by (0,r/μ) under [A1] in inv⁡=((0,r/μ),inv⁡O) on the transformed companion support, strictly drops between companion passes. This formula is used only where inv⁡O is defined; values at other original-support points are assigned by the successive-transfer construction below. Within a companion pass, Step 1 gives strict descent of (inv⁡O,νO) above every center; therefore (inv⁡,ν) strictly descends there, and off the center the induced map is the identity and all invariants are unchanged. Repeat only while r>0; the finite sequence of strictly decreasing nonnegative integer values of r ends with empty support or r=0. In the latter case, Step 2b has constant monomial-case inv⁡ and strictly lowers ν=ord⁡x(M(I))/μ above every center, so (inv⁡,ν) strictly descends until the support is empty.

4.1A2A1F6F7F8step 1.4step 2.1step 2.2step 3.1

Define the invariants on the entire support by successive assignment, rather than evaluating a companion invariant outside its domain. During a positive-r pass assign the tuple in 3.1 only on the transformed companion support; within Step 1 assign boundary-stratum and maximal-contact values only on their stated domains. Each point not yet assigned lies off every center in that pass, so it has a unique unchanged lift through the pass, with the same local ideal and boundary germs. After that pass continue the algorithm on the remaining support. When its residual-order stratum, boundary-count stratum, or final monomial branch is reached, assign the corresponding invariant there and transfer it back through these unchanged lifts. Termination proved in the preceding steps guarantees a finite first assignment for every point still in a support: otherwise an unassigned point would survive to the empty final support. Use the same transferred value at all earlier stages where the point was untouched. In particular a point of residual order below r receives its own later residual-order coordinate, not the current r/μ and not an undefined inv⁡O. The analogous convention fills lower boundary-count pieces during Step 1. Thus the active maximum is unchanged, and the invariants at points outside every intervening center are unchanged by construction.

5.1A2A1F3F4F6F7F8step 1.2step 1.4step 2.1step 2.2step 3.1step 4.1

Descent, termination, and canonicity. In a boundary pass the fixed pass-start count makes each maximal-stratum blow-up lower sE above its center; on restricted strata, induction strictly lowers (inv⁡,ν) above centers, and the ambient maps are identities off the support intersections. The codimension-one branch assigns the top source value (0,∞,0,…), rationally encoded as ((0,0),(1,0),(0,0),…); blowing up that component makes the controlled-transform support empty above it. In the hypersurface branch, induction strictly lowers (inv⁡,ν) above every transferred center and the maps are identities off the restricted support. In the companion branch, the first source coordinate r/μ (encoded as (0,r/μ)) strictly decreases between passes and the companion invariant pair strictly decreases within a pass. In the monomial branch, inv⁡ is constant and ν strictly decreases above each center by 1.4. Thus in every branch the pair (inv⁡,ν) strictly decreases above centers, while off centers the morphism is an isomorphism and all invariants are unchanged; each loop terminates by the decreasing boundary count, the decreasing integer r, induction in lower dimension, or the discrete nonnegative values of ν. The values and maximal centers are determined by boundary counts, orders, the threshold-subset rule and lower-dimensional canonical invariants. Their semicontinuity is proved in the next steps.

6.1A1F6F9step 5.1

Finite ranges and lexicographic assembly. Each stage has finitely many boundary components and finitely many maximal-contact charts. There are finitely many passes by step 5.1; in each dimension reduction the finite collection of restricted stage invariants has finite range by induction, and the tuple depth is uniformly bounded by the ambient dimension. Residual orders, boundary counts and the exponents of the finitely many monomial ideals occurring in these passes take finitely many values. Consequently all three invariants have finite ranges on each support; padding the bounded-depth rational tuples adds no values. For the finite-stratum assembly used below, let f be a finite-range upper semicontinuous function on a support S. For each attained value a, its level stratum Sa={f=a} is locally closed, since {f>a} is a finite union of closed superlevels. If F={x∈Sa:g(x)≥b} is closed in Sa, then its closure in S lies in {f≥a} and meets Sa exactly in F. Thus F‾⊆F∪{f>a}, and the lexicographic superlevel {(f,g)≥(a,b)}={f>a}∪F={f>a}∪F‾ is closed. For unattained a this superlevel is just {f>a}. Conversely, restricting pair superlevels to Sa gives relative superlevels of g.

7.1A1F3F4F5F6F7F8step 1.2step 1.3step 1.4step 2.1step 2.2step 3.1step 4.1step 6.1

Primary and auxiliary semicontinuity. On each residual-order or boundary-count stratum, unchanged lifts in step 4.1 identify the local ideal and boundary germs with their later pass. The leading residual-order and boundary-count functions have closed superlevels by [F6]. On a fixed leading level, the terminal infinity branch is closed and has maximal tail; distinct maximal boundary pieces are disjoint on the support, and their lower-dimensional primary tails are upper semicontinuous by induction. In the nonboundary branch, the isolated codimension-one pieces have the maximal infinity tail; on the remainder, the finitely many maximal-contact charts identify their primary tails étale-locally by [F3], so relative closed superlevels glue. Repeated application of step 6.1, with the leading coordinate as f and the lower-dimensional tail as g, proves upper semicontinuity of the entire primary invariant. Now fix its complete value a. In every recursive branch this fixes the leading coordinate and the entire lower-dimensional primary tail, so the inductive auxiliary semicontinuity on that lower primary level applies. Terminal infinity branches have constant ν=0, ρ=∅. On a monomial branch, ν is a finite sum of nonnegative exponents of boundary divisors through the point divided by the mark, hence has closed superlevels. Each eligible inclusion-minimal threshold subset contributes its closed boundary intersection; the maximum subset rule makes each ρ superlevel a finite union of these intersections. Boundary pieces are disjoint on the relevant support; maximal-contact charts agree by [F3]; unchanged lifts transport these relative-closed loci through earlier passes. Hence ν and ρ are upper semicontinuous on {inv⁡=a}. Applying step 6.1 to the primary invariant and each auxiliary function proves upper semicontinuity of (inv⁡,ν) and (inv⁡,ρ) on the entire support. In particular their finite ranges yield closed maximal loci; the branch constructions prove that the center selected by (inv⁡,ρ) is regular and has SNC with the boundary.

8.1A2A1F3F4F8step 5.1step 7.1∎

Étale canonicity. Under an étale morphism, the tracked Step 1 boundary components, orders, monomial and non-monomial factors, threshold subsets, companion supports and maximal-contact restrictions pull back compatibly. The glueing equality [F3] identifies maximal-contact choices, while [F4] and [F8] preserve restrictions, test sequences and equivalences. Thus the primary and both auxiliary values agree at corresponding points, the pair maxima give the pulled-back centers, and empty centers contribute only identity steps. The induced sequence is an extension of the canonical resolution with agreeing invariants. For an arbitrary étale source X′, take finite-type open charts: étale local finite presentation over the finite-type X gives such charts, and the preceding finite-type comparison applies on each. Use the pulled-back original finite sequence to align these chart sequences, inserting only empty-center isomorphisms. The sheaf ideals, boundary labels and invariant values agree on overlaps because they are pullbacks of the same original data. Their ranges are subsets of the original finite ranges. At a nonempty inverse center the original maximum is attained in the image and is exactly the maximum on the pullback; centers missed by the entire image give only inserted identities. Hence, after deleting globally empty-center steps, the glued sequence is canonical in the extended sense of the definition, with at most m blowups, even when X′ is not quasi-compact. Compatibility with further étale pullbacks follows by composition. Together with the descent and termination of step 5.1 and the semicontinuity of step 7.1, this proves all four stated conditions.

Remarks

Separate upper semicontinuity of the auxiliary functions on the whole support is not asserted. On X=AK2 take I=(x(x+y)), marking 1, and ordered boundary E={V(x)}. Its monomial part is (x) and its residual part is (x+y). At points of V(x) away from the origin, the residual order is zero, so successive assignment reaches Step 2b with ν=1 and ρ={V(x)}. At the origin the companion is (x+y,1) and Step 1a restricts it to V(x), giving (y,1) with empty restricted boundary. The lower-dimensional codimension-one branch assigns ν=0 and ρ=∅. Thus the superlevel locus {ν≥1} is V(x)∖{0}, which is not closed in the support V(x)∪V(x+y); the corresponding positive-ρ superlevel locus is the same. The source's Proposition 3.0.8 makes the same standalone upper-semicontinuity assertion, but its displayed branch formulas give this counterexample. Semicontinuity on fixed-primary-invariant strata does not imply the stated independent semicontinuity on the whole support. The corrected pair semicontinuity in the Statement retains closed superlevels for the center and descent comparisons while preserving the source algorithm and its invariant values.

Depends on

Used by

Dependency tree · two levels

96 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