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.
The local Dolbeault lemma on nested polydiscs
Statement
Assume AC. Let , let and be finite open coordinate polydiscs such that each closed coordinate disc is a compact subset of . Let and , and let be a smooth form with . Then there is a smooth such that
Facts & Assumptions
Given: Full AC; and are finite open polydiscs with each closed coordinate disc compactly contained in ; , , and is smooth and -closed.
The expansion is unique, and the coefficient formula for differentiates the coefficients in and wedges before their type factors (Bigraded complex forms and the Dolbeault operators).
The graded product rule holds for (The d, partial and dbar identities).
Under full AC, on a smaller coordinate polydisc the parameterized one-variable transform is smooth, satisfies , and preserves any selected equations with (Local Cauchy transform with smooth parameters).
Full AC means every family of nonempty sets has a choice function, and the local Cauchy-transform supplier explicitly assumes AC (The Axiom of Choice, Local Cauchy transform with smooth parameters).
Proof
If , take . Otherwise, by the unique type expansion [F1], some barred coordinate occurs. Let be the largest index appearing in any barred multi-index of . Group the terms uniquely as , absorbing the permutation signs into , so that neither nor contains a barred differential with index at least . Here has type and has type .
The product rule [F2] gives . For each , the coefficient terms containing both and can only come from : the form has no barred factor with index at least , so has no term containing both indices. Uniqueness of the wedge expansion [F1] therefore gives for every , coefficientwise.
Suppose the current residual form is smooth and closed on a working polydisc containing , and its largest barred index is . In the descending process, the th factor has not yet been shrunk, so and . Apply the same local operator from [F4] to each of the finitely many coefficient functions of in the unique expansion [F1]. It produces a smooth form on a working polydisc that still contains , with . Since every coefficient of has zero derivative for by step 2.1, [F4] preserves those equations for . The full AC premise needed for [F4] is part of the given hypothesis by [F5].
By the coefficient formula [F1], , where every barred index in is less than : the th derivative supplies the displayed first term, derivatives with index greater than vanish by step 3.1, and the remaining derivatives have index less than . Set . It has type and contains only barred indices less than . It remains closed, since by [F3].
Repeat steps 1.1–3.1 on each nonzero residual, in descending order of the largest barred index. At each stage the local transform shrinks only the coordinate currently being processed and its output domain still contains , so all later residuals and the previously constructed primitives restrict to a common neighborhood of . If no barred factor occurs at index , skip that transform and retain the current domain. After index is removed, the residual has barred degree but no barred basis factor; the unique expansion [F1] forces it to be zero. There are at most transforms.
Let be the sum of the finitely many forms constructed by the repeated step 3.1 procedure in step 5.1, restricted to . The successive residual identities of step 4.1 telescope, and the final residual is zero by step 5.1; hence . Each summand is smooth on a neighborhood of , so is smooth there and has type .
Depends on
Used by
Dependency tree · two levels
15 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
- Lebl, Tasty Bits of Several Complex Variables, v4.4, Chapter 4 §4.4 (standard reference, not scraped)