Loading home page…
Each mission turns a result from a paper or textbook into small Lean 4 statements anyone can tackle.
Campaigns group missions around a shared mathematical goal. Each one tracks a quantity, such as an upper or lower bound. Have a good candidate in mind? Ping us on Slack, Zulip, or WeChat.
Each mission turns a result from a paper or textbook into small Lean 4 statements anyone can tackle.
Campaigns group missions around a shared mathematical goal. Each one tracks a quantity, such as an upper or lower bound. Have a good candidate in mind? Ping us on Slack, Zulip, or WeChat.
Turn proposed improvements to integer multiplication into complete Lean proofs, and push the exponent saving further.
Harvey and van der Hoeven established an algorithm in 2021. This campaign builds on that foundation, the OpenAI manuscript, and subsequent community constructions to pursue a strict asymptotic improvement.
For two -bit integers, the target is
A positive beats asymptotically; larger is better. Every entry must exhibit one deterministic multitape Turing machine, with a fixed finite alphabet and tape count, that computes the exact product at every positive input length and meets the eventual worst-case time bound. The tracked number measures an asymptotic exponent saving.
Classical algorithms solve 3SUM in time. In a 2026 breakthrough, Alman and Vassilevska Williams gave a deterministic algorithm, refuting the integer 3SUM hypothesis. How low can the exponent go?
Building on existing Lean formalizations, this campaign tracks upper bounds for 3SUM on polynomially bounded integers, using a word RAM with -bit words, and pursues smaller exponents.
Classical algorithms solve all-pairs shortest paths in time. In a 2026 breakthrough, Alman and Vassilevska Williams refuted the APSP conjecture with a deterministic algorithm. How low can the exponent go?
Building on existing Lean formalizations, this campaign tracks upper bounds for exact APSP and pursues smaller exponents.
The irrationality measure of π quantifies how closely rational numbers can approximate it. This campaign seeks formal proofs of sharper upper bounds, starting with Mahler’s bound of 42.
The sharp Hlawka inequality for Schatten -norms is a cousin of the triangle inequality: it relates the norms of three matrices to the norms of their pairwise sums and their total sum. For complex diagonal matrices, an exact formula for the best possible comparison constant has been proved in Lean for every real . We conjecture that the same formula holds for all .
What is the smallest cutoff for which this formula holds for every real ?
References:
Is every odd number a sum of primes? This campaign tracks formalized proofs of the smallest that suffices.
Schnirelmann (1930) showed some finite works. Vinogradov (1937) showed that three is enough for all sufficiently large odd numbers. Tao (2012) proved unconditionally. Helfgott (2013) proved that every odd number greater than is a sum of three primes, though the proof is still unrefereed. Ideally, we can formalize this statement here. Note that three is optimal: is neither prime nor + prime.
Schoolbook matrix multiplication takes operations. The exponent is the infimum of all such that two matrices can be multiplied in arithmetic operations; trivially , and is conjectured but open.
Strassen gave the first nontrivial bound, , in 1969, and introduced the laser method in 1986 to reach . Coppersmith and Winograd's 1990 bound of stood for two decades. Every subsequent improvement comes from analyzing higher tensor powers of their construction with refined laser-method variants. That line reached in 2025, and the current record is , from August 2026. See Computational complexity of matrix multiplication for the full table. Can we formalize these results and even improve on them?
A stochastic process can be described through the way functions of its state change over time. For a suitable pair of functions f and g, the difference between f evaluated along the process and the accumulated integral of g has zero conditional drift. A martingale problem specifies a collection of such pairs. The question is whether these local conditions determine the evolution of the process, including the dependence of its future on its past. Ethier and Kurtz's Chapter 4, Theorem 4.1 answers this question under analytic hypotheses on the collection of pairs and a separation condition on the functions being observed.
Let E be a separable metric space, with its Borel sigma algebra. Write B(E) for the bounded real Borel functions, equipped with the uniform norm. A linear relation A is a linear subspace of B(E) × B(E). A pair (f,g) in A prescribes g as the drift associated with f; the relation is allowed to be multivalued. It is dissipative when
Let μ be a probability measure on E. A solution X of the martingale problem for (A,μ) is a jointly measurable process on a probability space with initial law μ, satisfying the compensated moment identities of Chapter 4, equation (3.4). Those identities test each compensated increment against products of bounded Borel functions of finitely many earlier states. The natural past at time s is the sigma algebra generated by all coordinates X(r) with r≤s.
A subspace L of B(E) is separating if two Borel probability measures that have the same integral against every function in L must be equal. This is a condition on measures, stronger in purpose than merely distinguishing individual states.
Suppose A′ is a linear subrelation of A and, for some λ>0,
where both closures use the uniform norm and L is separating. Given a solution X of (A,μ), the target is the existence of a strongly continuous contraction semigroup T on L generated by the closed relation , together with
The process is Markov: for every bounded Borel observable, conditioning a future observation on the entire past agrees almost surely with conditioning on the present state. In addition, any other solution with initial law μ has exactly the same finite-dimensional distributions as X. The competing solution may live on a different probability space. Existence of X is an assumption; the existence conclusion concerns its corresponding semigroup.
The theorem joins an analytic description of evolution with a probabilistic one. The closed generator relation determines a semigroup, while the martingale identities identify the conditional evolution of the supplied process. Separation allows observables in L to determine probability laws. Uniqueness concerns every finite list of observation times, which is the source's convention for this martingale problem.
This is a known theorem of Ethier and Kurtz. The formalization target is its complete statement and eventually a machine-checked proof. The present theorem remains a proof obligation. Its expression infrastructure consists of bounded functions, the natural past, and the finite-history definition of a solution.
The observed functions initially lie in a subspace L, whereas the Markov conclusion ranges over all bounded Borel observations. Identifying only individual expectations does not by itself establish conditional evolution or equality of joint laws. The analytic part must also identify the entire generator graph: agreement on the original relation alone is weaker than the asserted equality with its closure. Both closure hypotheses and probability-measure separation are therefore part of the target.
Bounded functions are actual pointwise real functions with the uniform norm. Borel measurability is imposed on the relation, and uniform limits preserve it. The construction does not use functions modulo almost-everywhere equality. The state space is separable and metric; completeness and local compactness are not additional hypotheses. Processes need no right-continuous or cadlag paths.
Histories may be empty, repeated, or unordered, with every history time at most the start of the increment. Products combine repeated observations. Boundedness and finite time intervals ensure the required integrability. Nonnegative real times index the processes. The semigroup is represented by a real-indexed family whose axioms concern nonnegative times; negative-time values have no mathematical role. Generator equality is a biconditional for the derivative limit from positive times. The target retains semigroup correspondence, the ordinary Markov property, and unrestricted finite-dimensional uniqueness as one theorem.
Stewart N. Ethier and Thomas G. Kurtz, Markov Processes: Characterization and Convergence, Wiley, 1986, Chapter 4, Theorem 4.1, printed p.182 (PDF p.191); equations (3.4) and (4.2), printed pp.174 and 183. Separation conventions: Chapter 3, printed pp.112 and 116. Chapter 4.
Optional sampling relates a process observed at two random times. A martingale has a conditional expectation at an earlier index equal to its value there, but this defining property initially concerns deterministic indices. Random indices require a separate theorem. In Chapter 2, Section 8, Ethier and Kurtz extend optional sampling to a partially ordered family of indices for use in the time changes of Chapter 6. The target is their Theorem 8.7, printed pages 87–88.
A metric lattice is a partially ordered metric space I in which each pair of points has a greatest lower bound and a least upper bound. These are written as the meet and join. Both operations are jointly continuous. Points need not be comparable. The interval between u ≤ v consists of all points w with u ≤ w ≤ v.
A subset is separable from above if it contains a sequence aₙ that approximates each of its points w by the finite meets of those aᵢ with w ≤ aᵢ and i ≤ n. Each such meet is taken once this finite set is nonempty. The resulting sequence of meets must converge to w. The theorem assumes this condition for each interval.
Let Ω carry a probability measure P and an ambient sigma algebra. A filtration assigns a sub-sigma algebra Fᵤ to each index u, increasing with the order. A real-valued process X is a martingale if each X(u) is Fᵤ-measurable and integrable and, whenever u ≤ v,
Right continuity here has a specific lattice meaning: for every u and every outcome ω, X(u ∨ v,ω) tends to X(u,ω) as v tends to u. A stopping time τ is a Borel-measurable I-valued random variable such that {τ ≤ u} belongs to Fᵤ for every u.
Take stopping times τ₁ ≤ τ₂ pointwise. Suppose there are deterministic sequences uₙ and vₙ in I such that
and
Assume also that X(τ₂) is integrable. The target is
The sigma algebra Fτ consists of ambient-measurable events A for which A ∩ {τ ≤ u} belongs to Fᵤ for every u. This is the information used in the conclusion.
The conclusion extends the martingale identity to random lattice indices under explicit exhaustion and tail assumptions. Neither a deterministic bound on both stopping times nor a linear ordering of all indices is part of the statement. This is a known theorem in the cited book. The formal target retains the full conditional-expectation identity; its proof remains to be formalized.
In a partially ordered space, the complement of {τ₂ ≤ vₙ} includes incomparable indices. Replacing this complement by {vₙ < τ₂} would change the tail assumption. Likewise, right continuity must use lattice joins, rather than a one-dimensional time convention. Controlling probabilities of the exhaustion events alone does not state the integrability control required by the second limit. Both limits belong to the theorem.
The index space has a metric and a lattice structure with continuous meet and join. No top, bottom, completeness of the metric, or linear order is required. The filtration need not be complete or right continuous. The stopping times are finite I-valued variables; their measurability is explicit. The sequences uₙ and vₙ need not be monotone. The nonnegative tail expectation uses extended nonnegative integration, avoiding a default value for a nonintegrable real integral. Indexwise integrability is retained explicitly, along with terminal integrability.
The two accompanying definitions express separation from above and the stopped sigma algebra. Together with the martingale and stopping-time conditions, they specify the single optional-sampling theorem. The target contains no additional supporting-theorem milestones.
Stewart N. Ethier and Thomas G. Kurtz, Markov Processes: Characterization and Convergence, Wiley, 1986, Chapter 2 §8, Theorem 8.7, printed pp. 87–88 (supplied PDF pp. 96–97); definitions and equation (8.6), printed p. 85 (PDF p. 94). Chapter 2.
Critical branching is a basic scaling model for populations whose expected size neither grows nor decays at leading order. A single-type population has one macroscopic direction, but a two-type population has two coupled directions. In the critical regime considered by Ethier and Kurtz, one weighted population mode survives on the diffusive scale while a second mode is pulled rapidly toward zero. The rapid mode still leaves a random integrated contribution and an initial boundary layer, so discarding it would lose part of the limiting dynamics. The mission packages all of these conclusions from Chapter 9, Section 2, Theorem 2.1 of Ethier and Kurtz as one formal target.
The state is a pair of natural numbers recording the numbers of particles of types 1 and 2. A type- particle lives for an exponential time with positive rate . At death it is replaced by a random pair of offspring with law . The generator therefore applies the type-specific replacement rule at an intensity proportional to the current number of particles of that type. The formal predicate IsTwoTypeBranching records a measurable càdlàg process satisfying the corresponding natural-past martingale identities on finite-support tests, with an explicit integrability condition.
The offspring mean matrix has strictly positive entries. Its critical weighted rate matrix has a positive eigenvector with eigenvalue zero and an opposite-sign eigenvector with eigenvalue , where . For the th process, Lean consistently uses the positive index . At accelerated time , the scaled modes are
The compensated fast coordinate is
The goal is the complete three-part statement of Theorem 2.1. First, converges jointly in path law to a continuous two-dimensional diffusion . Its covariance matrix is built from the raw second moments of the two offspring replacement increments, and its generator has the form
Second, on every finite time interval the fast mode is uniformly close in probability to its exponentially decaying initial layer . On every interval , its integrated drift converges weakly to . Third, the first population coordinate is uniformly reconstructed from together with that same initial layer. The limit statement keeps the possibly nonzero initial fast coordinate and the separate nonnegativity conclusion for the slow coordinate.
The theorem identifies both the persistent and collapsing directions of a critical multitype system. The slow direction produces population-scale diffusion, while the compensated fast direction records fluctuations that remain visible after the raw fast mode contracts. The reconstruction formula connects these mode coordinates back to the original particle count. Keeping the path limit, fast decay, integrated limit, and reconstruction together prevents an apparently simpler marginal statement from omitting the initial-layer behavior needed at time zero.
The textbook theorem is already mathematically proved. This mission asks for a Lean proof of the reviewed formal statement; the uploaded goal is intentionally a statement with a proof placeholder, not a claim of machine-checked completion. The concrete generator, branching-law predicate, scaling map, càdlàg condition, and diffusion martingale-problem predicate provide reusable vocabulary for related multitype limit theorems.
Coordinatewise convergence is insufficient. The result couples full path laws, a continuous diffusion martingale problem, compact-uniform control of an initial layer, and a positive-time integral of a rapidly changing mode. The naive step of simply setting the fast mode to zero fails at time zero and erases the exponential term needed in the population reconstruction. The covariance coefficients also come from replacement increments rather than centered offspring counts, so changing that convention alters the limiting operator.
The state space is exactly ; both offspring laws are probability measures, both coordinates have finite third moments under each parent law, and all four entries of the mean matrix are positive. Initial populations are deterministic floors of for nonnegative densities . The positive indexing avoids division by zero in every scaling, clock, and exponential. Natural-number subtraction in the generator is used only with a zero event intensity when the relevant population is empty.
Path convergence is represented by a joint probability-space realization carrying the correct complete prelimit path laws and almost-sure uniform convergence on compact intervals to a continuous limit. This is the continuous-limit Skorohod convention used in the reviewed development. The definitions are concrete: none contains the target theorem or assumes its conclusions. The mission includes only expression-essential dependencies, reusing exact private book-wide definitions for càdlàg paths and the continuous diffusion generator law. It does not add proof-only lemmas or split the three source conclusions into separate missions.
A convex polytope has both a geometric realization and a finite combinatorial structure: its faces, ordered by inclusion. Reconstruction asks how much of that structure must be known before the rest is forced. Chapter 12 of Branko Grünbaum's Convex Polytopes distinguishes several forms of unambiguity and then proves reconstruction results for general polytopes and for important special classes. The central input is not a coordinate description. It is a lower-dimensional part of the face lattice, such as the graph or a higher skeleton.
This mission groups five established results that address the same recovery problem under different hypotheses. The main theorem reconstructs every d-polytope, for d ≥ 3, from a supplied equivalence of its (d−2)-skeleton. The supporting targets sharpen the amount of data needed for simple polytopes, simplicial polytopes, and zonotopes, and record a polynomial-time version whose output is the vertex–facet incidence relation. Each theorem retains its own quantified polytopes, equivalence, and reconstruction witness. Grouping them does not require a single witness to serve all five regimes.
A d-polytope is represented as the convex hull of a nonempty finite subset of Fin d → ℝ, with affine span equal to the whole ambient space. A face is an exposed face in Mathlib's sense. This convention includes the empty face and the polytope itself. PolytopeFace P is the resulting face poset ordered by set inclusion.
For a natural number k, the k-skeleton face poset SkeletonFace P k contains the empty face and every nonempty exposed face whose affine dimension is at most k. An equivalence of skeletons is an order equivalence, so it preserves and reflects every inclusion relation among the retained faces. Strong unambiguity is represented by demanding an extension of every supplied skeleton equivalence, rather than merely asserting that some full face-lattice equivalence exists. The extension equation requires agreement on every skeleton face.
The graph of a polytope is modeled through its vertices and one-dimensional faces. PolytopeVertex P consists of points whose singleton is exposed. Two distinct vertices are adjacent in polytopeGraph P when they lie in a common one-dimensional exposed face. A source polytope is simple when every vertex has exactly d graph neighbors. A simplicial polytope is one whose facets are simplices. A zonotope is a finite vector sum of closed line segments; full dimension is imposed separately by the d-polytope hypothesis.
(d−2)-skeletonFor d ≥ 3, d-polytopes P and Q, and every supplied order equivalence
the main target produces an order equivalence of the complete face posets whose restriction is exactly φ. This is the explicit face-lattice reformulation of Theorem 12.3.1. It asserts strong and weak d-unambiguity, but it does not add dimensional unambiguity.
The Blind–Mani target uses only the 1-skeleton when the source is simple. The target polytope is arbitrary in the same dimension; its simplicity is not assumed separately. The Björner–Edelman–Ziegler target likewise uses the 1-skeleton when the source is a full-dimensional zonotope, without requiring the target to be a zonotope.
Perles's target has a different domain. The source is a simplicial d-polytope, the target is an arbitrary e-polytope, and the input compares their floor(d/2)-skeletons. Its conclusion includes both e=d and extension of the supplied skeleton equivalence. Thus this clause, unlike the other reconstruction clauses, explicitly includes dimensional unambiguity.
The algorithmic target states that one binary function works uniformly for every d ≥ 3, every vertex count, and every valid labelled d-polytope input. The input contains the complete duplicate-free table of nonempty faces in dimensions at most d−2; the output contains exactly the facets, as labelled vertex sets. Dimension, vertex count, and row count are self-delimiting headers, followed by dense incidence rows. Correctness is required on valid encodings, while the binary function itself is total. ContainmentPolyTime uses Mathlib's Turing-machine polynomial-time predicate together with finite stack alphabets.
The general theorem says that codimension-two face data already fixes every missing facet and incidence relation. The special-class results show that much smaller data can suffice: only the graph for simple polytopes and zonotopes, and the half-dimensional skeleton for simplicial polytopes. Perles's result also recovers ambient dimension. The algorithmic theorem separates mere uniqueness from effective recovery by requiring one polynomial-time procedure and a concrete vertex–facet output.
Formalizing these results creates reusable interfaces for face-poset reconstruction, graph-based simplicity, zonotopes, and finite incidence encodings. It also records distinctions that informal summaries can blur: extension of every supplied equivalence versus existence of an unrelated isomorphism; combinatorial reconstruction versus dimension recovery; and uniqueness versus polynomial-time computability. The statements are established mathematics, but their Lean theorem bodies remain open and use sorry; this mission makes no proof-completion claim.
Counting faces or matching their dimensions does not reconstruct the face lattice. The conclusion must preserve every inclusion relation and agree with the specific equivalence supplied on the visible skeleton. An arbitrary isomorphism of complete face lattices would be too weak if it failed to extend that map.
For simple polytopes and zonotopes, graph isomorphism alone does not expose higher-dimensional faces directly; the target still asks for all incidences. In the simplicial case, reconstructing the lattice without proving e=d would omit the dimensional-unambiguity clause. For the effective result, a mathematical reconstruction argument is insufficient unless it yields one uniform polynomial-time binary function. Conversely, an efficient procedure on an incomplete or coordinate-dependent input would not meet the stated incidence model.
All geometric ambient spaces are finite-dimensional real coordinate spaces. Full-dimensional polytopes are nonempty finite convex hulls. Exposed faces include both improper faces. Skeletons retain the empty face separately, avoiding a natural-number encoding of its source dimension −1. Natural subtraction in d−2 is protected by the explicit 3 ≤ d hypothesis wherever that threshold is used.
The graph definition removes loops and symmetrizes adjacency. Simplicity is the exact neighbor-cardinality condition at every vertex. The zonotope definition allows arbitrary segment endpoints and degenerate summands, but the separate full-dimensionality hypothesis rules out a lower-dimensional source. Only the simplicial theorem compares different ambient dimensions and concludes their equality.
The algorithm receives no real coordinates. Its vertex map is injective and has range exactly the exposed singleton faces. The input and output row predicates are biconditionals, so they prohibit missing faces and extraneous rows; Nodup prohibits repetitions. The empty face is implicit, and the output row order is unrestricted. Contributions must not weaken extension to unrelated existence, assume the target belongs to the source's special class, omit Perles's dimension equality, replace complete incidence tables by partial data, or allow the polynomial bound to depend on the individual instance.
A stochastic linear program is a linear optimization problem whose coefficients depend on a random parameter. Even when the model is feasible and bounded almost surely, its optimal value is itself a random quantity. Knowing only its expectation can hide the probability of unusually favorable or unfavorable outcomes; its full distribution supports threshold probabilities, quantiles, and later risk-sensitive decisions. Chapter II of Peter Kall's Stochastic Linear Programming develops a finite-dimensional method for determining that distribution when the constraint matrix, right-hand side, and objective coefficients depend affinely on the same random vector. Theorem 8, printed p. 29 / PDF35, is the chapter's general distribution formula. This mission asks for that known theorem to be proved in Lean from its reviewed statement.
Fix a finite parameter vector . An affine random linear program supplies a matrix , a right-hand side , and costs , each affine in . Its optimal value is the extended-real infimum
The parameter has a probability law , supported almost surely on a measurable set , with a nonnegative extended-real density relative to Lebesgue measure. The extended-real value records infeasibility as and unboundedness as ; the target distribution deliberately restricts to the finite-value event .
A candidate basis is an increasing selection . Its basis matrix consists of the selected columns of . Kall enumerates exactly those candidate bases whose determinant is nonzero at some point of . For each one, its raw optimality region consists of the parameters for which and the reduced costs are nonnegative. Matrix inversion is totalized to zero at singular matrices, matching the source convention. The ordered basis regions remove every earlier raw region, so overlapping optimal bases are assigned to the first enumerated basis. On a basis region the associated value is
Assumption A1 is explicit in Lean: the density and support clauses above, both almost-sure feasibility/boundedness implications from Theorem 4, and the existence of one full-row-rank column minor at a point of . The basis enumeration is injective and exhaustive for the almost nonsingular increasing selections.
For the ordered regions , the theorem states
For every real threshold , it further identifies the finite optimal-value distribution by
The normalization and distribution identity are the two clauses of the same source theorem and remain one goal. Determinant facts, special stochastic models, and examples elsewhere in the chapter are context rather than additional mission targets.
The result turns the distribution of a random optimization value into a finite sum of ordinary density integrals over explicitly described parameter regions. It connects parametric linear programming geometry with probabilistic questions about the optimum and provides the chapter's foundation for studying particular stochastic models and derived distributional quantities. Without the coverage and normalization clauses, the integral expression could omit positive-probability parameter regimes; without the finite-value event, extended-real exceptional outcomes would be conflated with a real-valued distribution function.
The theorem is established in the 1976 source, but the staged Lean declaration contains a proof placeholder. Completing it would produce a machine-checked account of the basis-region decomposition under the source's full hypotheses. The reusable content includes the affine model, basis matrix, raw-region inequalities, ordered disjointification, basis value, and the referenced extended-real linear-program value.
The natural pointwise argument chooses an optimal basis and substitutes its basic solution. That alone does not prove a measurable probability decomposition: several bases may be optimal at the same parameter, bases may become singular on exceptional sets, and the optimal value may be infinite. The ordered subtraction of earlier regions resolves overlap only after one proves exhaustive coverage under A1. The final equality must also connect the extended-real infimum to the real basis value on each region and justify the density integrals on the threshold sets. Treating the raw regions as automatically disjoint or silently assuming every parameter has a unique nonsingular optimizer would bypass the central issues.
All dimensions and basis lists are finite. The law is a probability measure on , represented as volume.withDensity f; is measurable and carries the law almost surely. The density is ENNReal-valued and the displayed integrals are nonnegative lintegrals. No integrability or finite-moment hypothesis is imposed on the optimal value. LPValue is an existing referenced platform definition using EReal.sInf; the book-local declarations remain in the shared Kall1976 namespace. Mathlib's nonsingular inverse supplies the source's zero value at singular matrices.
The formal target must retain both almost-sure implications, the one-point full-rank condition, increasing and exhaustive basis enumeration, region ordering, probability-one normalization, the strict lower bound by , and the weak upper threshold . Removing any of these clauses would change the reviewed theorem rather than simplify its proof. Contributions may develop measurable-region, finite-basis coverage, LP optimality, and density-integration lemmas, provided they preserve these conventions.
A spin-flip system models a countable collection of two-state components whose transition rates may depend on the entire current configuration. Such systems are basic examples of interacting particle processes: each local move is simple, but infinitely many possible moves may be active and their rates interact through the configuration. The central analytic question is whether the formal sum of local flip operators determines a genuine time evolution on continuous observables. Chapter 8, Section 3 of Stewart N. Ethier and Thomas G. Kurtz, Markov Processes: Characterization and Convergence, answers this question under uniform rate and influence bounds Ethier--Kurtz, Theorem 3.5.
This mission states that result without replacing the countable system by a finite-state chain or assuming finite total jump intensity. It also retains the theorem's cylinder-function core, which identifies finitely coordinate-dependent observables as a sufficient starting class for recovering the closed generator.
Let S be a countable type of sites. A configuration is a function η : S → Bool; false and true relabel the source spins -1 and 1. The product topology on these configurations is the one induced by the discrete topology on each coordinate. The Lean space C(S → Bool, ℝ) consists of real-valued continuous observables on this compact product space and carries its uniform norm.
For a site i, spinFlip i η agrees with η away from i and negates the Boolean value at i. For an observable f, its coordinate variation at i is
The domain used in the theorem is the full class of continuous observables for which ∑ i, var_i(f) is summable. This is a one-coordinate variation domain: it measures the effect of changing one spin, rather than exchanging two occupied sites.
For every site i, the flip rate c i is itself a continuous function of the configuration. Rates are nonnegative and uniformly bounded in the uniform norm. Their dependence on other coordinates is controlled by a second uniform bound: for each i, the series ∑ j, var_j(c i) is summable, with a bound independent of i. These are the two clauses of equation (3.24).
The pre-generator graph implements equation (3.25). For every pair (f,g) in that graph, f has summable coordinate variation and
The goal is Theorem 3.5 in full. It asserts that every function in the prescribed domain has a continuous image in the graph; the closure of the graph in the product uniform-norm topology is single-valued; and that closure is exactly the generator graph of a strongly continuous contraction semigroup. The semigroup is positive and preserves the constant function one, giving the conservative Feller conclusion used by the source.
The final clause retains the source's cylinder core. Restrict the initial graph to functions depending on a finite set of coordinates, expressed by the existence of a finite set F such that agreement on F forces equal function values. The closure of this restricted graph equals the full generator graph. Generation and the core are kept together because both are conclusions of the same theorem.
The result turns an infinite formal sum of local moves into a closed, single-valued Markov generator. This is stronger than merely defining the pointwise series: it supplies the strongly continuous positive contraction evolution, conservativity, and the derivative characterization of the entire generator domain. The cylinder-core clause means that finite-coordinate observables are graph-norm dense enough to recover that generator, even though the state space and the total collection of possible flips are countable.
The theorem is already proved in the source. The formalization target is its precise Lean statement, including the infinite-site domain, the uniform influence hypothesis, generator closure, and core. The reusable infrastructure consists of the book-wide strongly continuous contraction-semigroup predicate and the mission-local flip, variation, and graph definitions.
The naive finite-rate jump argument does not apply. A uniform bound on each individual rate does not bound the sum of rates over a countably infinite site set, so the system may have infinite total potential flip intensity. Pointwise notation for the generator also does not by itself show that its image is continuous or that its graph closure is single-valued. The coordinate-influence bound and summable-variation domain are therefore essential parts of the target rather than optional regularity decoration.
The neighboring exclusion-process theorem is not interchangeable with this one. A spin flip changes one coordinate and permits creation or destruction of occupation, whereas exclusion dynamics exchanges two coordinates and conserves particle number. Their domains and rate conditions are correspondingly different.
The Lean statement allows empty, finite, and countably infinite S; it does not impose nonemptiness or finiteness. Bool is an exact two-state relabeling, not a restriction to a special numerical spin convention. spinVariation uses a real supremum over the nonempty compact configuration space. Explicit Summable hypotheses prevent divergent real tsum expressions from receiving an unintended default interpretation.
The operator graph uses the actual pointwise series and requires a continuous output. Closure is taken in C(S → Bool, ℝ) × C(S → Bool, ℝ). The semigroup is indexed by real time, but every law and bound uses nonnegative times; negative-time values carry no mathematical requirement. No finite-total-rate hypothesis, finite-site approximation, two-site exchange dynamics, or weakened core statement is admitted.
A convex polytope carries more than its underlying topological ball. Its faces form a finite complex whose incidence relations record the polytope's combinatorial structure. Chapter 11 of Branko Grünbaum's Convex Polytopes asks how this structure can be represented by subdivisions and by embeddings into Euclidean spaces of smaller dimension. The first target places every polytope boundary over the simplest boundary complex in the same dimension, that of a simplex. The second determines exactly how much ambient dimension is needed to realize any prescribed skeleton, both topologically and as a genuine polytopal complex.
These are established mathematical results, not open conjectures. The mission poses their reviewed Lean statements as formal proof tasks. It groups Theorems 11.1.1 and 11.1.9 because both use the boundary-complex, carrier, refinement, skeleton, and incidence-equivalence model introduced at the start of §11.1. They remain separate statements with separate quantified objects; no common homeomorphism, realization, or witness is imposed between them.
A d-polytope is represented in Lean as the convex hull of a nonempty finite subset of Fin d → ℝ whose affine span is the whole ambient space. A face uses Mathlib's exposed-face convention. For polytopes this includes the proper exposed faces as well as the empty and full improper faces.
The boundary complex boundaryFaces P consists of every exposed face of P except P itself. Thus the empty face is retained. Its carrier is the union of those cells. The statement BoundaryRefines P Q supplies one homeomorphism between the two complete boundary carriers. For each boundary face of Q, its inverse image must be exactly the union of a finite subfamily of boundary faces of P, and that subfamily must be closed under taking faces. Exact inverse-image equality is essential: containment alone would not express the source's refinement relation.
The k-skeleton face poset SkeletonFace P k contains the empty face and every nonempty exposed face of affine dimension at most k, ordered by inclusion. Its topological carrier skeletonCarrier P k is the union of these cells. A finite polytopal complex in real m-space is a finite family of polytopal cells, explicitly permitting the empty cell, closed under taking faces, with each pairwise intersection a face of both participating cells. Combinatorial equivalence is represented by an order isomorphism of the complete cell posets, rather than merely by a homeomorphism of their carriers.
For every natural dimension d, every full-dimensional d-polytope P, and every affinely independent family of d+1 vertices in real d-space, the first target states
The chosen vertices describe an arbitrary d-simplex. The result does not assume that P is simplicial. The same homeomorphism controls all target-face inverse images, and the zero-dimensional case retains its empty boundary carrier.
For 1 ≤ k ≤ d and every d-polytope P, the second target identifies two attained minima. The first ranges over dimensions m for which the carrier of the k-skeleton is homeomorphic to some subset of real m-space. The second ranges over dimensions m for which a finite polytopal complex in real m-space has a cell poset order-isomorphic to the complete k-skeleton face poset. Both minima equal
This compact formula preserves the four cases stated in Theorem 11.1.4: d=k, d=k+1, k+2≤d≤2k+2, and d≥2k+2. The latter two formulas agree at their shared endpoint. Applying the arbitrary-polytope statement to simplices retains the source comparison with a(d,k) and b(d,k).
The refinement theorem gives a uniform relationship between the boundary complex of an arbitrary polytope and the simplex boundary. It preserves both topology and the subdivision data carried by faces. The embedding theorem then gives the exact ambient dimension required by every k-skeleton, while showing that allowing an arbitrary topological embedding does not improve on the best dimension obtainable from a combinatorially equivalent polytopal complex.
Formalizing these targets provides reusable infrastructure for boundary carriers, face-closed refinements, skeleton carriers, and finite polytopal complexes. The definitions distinguish topological equivalence from incidence equivalence and record attainment as well as lower bounds through IsLeast. The theorem bodies remain open: the proposal does not claim that either classical result already has a Lean proof.
For the refinement target, a homeomorphism of boundary carriers alone is insufficient. One must also prove, simultaneously for every target cell, that its inverse image is exactly a finite union of source cells closed under faces. The obvious topological equivalence of polytope boundaries therefore does not establish the required combinatorial refinement.
For the embedding target, constructing one realization in the displayed dimension proves only attainment. It does not rule out all realizations in smaller dimensions. Conversely, a lower-bound argument does not construct the topological subset or polytopal complex required by IsLeast. Both notions of realization must meet at the same explicit value without replacing the full cell-poset equivalence by a weaker topological condition.
All ambient spaces are finite-dimensional real coordinate spaces. Polytopes are nonempty finite convex hulls, and the goal polytopes are full-dimensional. Exposed faces include the empty face and the whole polytope; the boundary removes only the whole polytope. Skeleton dimension is the real dimension of an affine-span direction, with the empty face admitted separately. The topological minimum ranges over arbitrary subsets with the subspace topology, while the combinatorial minimum ranges only over finite polytopal complexes satisfying face closure and the common-face intersection condition.
IsLeast asserts both membership of the displayed value and that it is a lower bound for every attainable dimension. The condition 1 ≤ k ≤ d excludes the source's untreated k=0 case. Natural subtraction occurs only in the branch d>k+1, so the formula does not gain a truncated-subtraction shortcut. Contributions must not drop attainment, restrict the arbitrary polytope, replace exact inverse-image equality by containment, omit empty faces, weaken order isomorphism to a carrier homeomorphism, or require the two source theorems to share a witness.
Markov processes with jumps model changes that cannot be represented by continuous diffusion paths: arrivals in queueing systems, sudden failures, population events, and discontinuous changes in financial or physical systems. Their infinitesimal descriptions are nonlocal generators, because the value of the operator at a state depends on test-function values at displaced states rather than only on derivatives at the current point. Chapter 8, Section 3 of Stewart N. Ethier and Thomas G. Kurtz, Markov Processes: Characterization and Convergence (Wiley, 1986), treats three complementary regimes. Theorem 3.1 covers finite-rate jumps on a general locally compact state space. Theorem 3.4 treats homogeneous Lévy operators on Euclidean space, including infinite jump activity and degenerate covariance. Theorem 3.3 gives the main target here: well-posedness for a time- and state-dependent compensated Lévy-type martingale problem.
These results connect concrete jump kernels and integro-differential operators to two standard descriptions of stochastic dynamics. Autonomous operators are realized as generators of conservative Feller semigroups, while time-dependent operators are characterized through martingale identities. Keeping all three source results in one mission records the nonlocal-generator theme without claiming that their distinct hypotheses imply one another.
For the Euclidean results, the state space is , represented in Lean as EuclideanSpace ℝ (Fin d), with . A covariance field is a continuous linear endomorphism, a drift field is a vector, and is a measure of jump displacements. For a smooth compactly supported test function , the compensated Lévy-type operator is
The denominator in the compensation term is part of the source convention. The covariance factor applies only to the second-order term; the drift is unscaled. The weighted moment permits measures with infinite total mass while controlling the compensated integral.
A solution of the Lévy-type martingale problem is a jointly measurable process with the prescribed initial pushforward law whose integrated-generator increments have zero expectation against every bounded continuous function of any finite history. Smooth compactly supported functions are the spatial tests. This definition imposes no path-continuity requirement.
The finite-rate model uses a locally compact, noncompact, separable metric space , a nonnegative rate , and a weakly continuous probability transition kernel . Its operator is . Positive weights and specify the graph domain and control behavior at infinity.
The main target is Chapter 8, Section 3, Theorem 3.3. The covariance is continuous, symmetric, bounded, and strictly positive definite at every nonzero vector, without a uniform ellipticity constant. The drift is measurable and bounded. The weighted jump measure is integrable, and for every measurable set its weighted mass is a bounded continuous function of time and state.
For every initial probability measure, the conclusion asserts existence of a measurable-process solution on some probability space and uniqueness of all finite-dimensional distributions among every solution on every probability space. Setwise continuity is retained exactly; it is not replaced by weak convergence of measures or by finite total jump intensity.
Theorem 3.4 freezes the coefficients in time and space. The covariance may be degenerate but is symmetric and nonnegative, and the jump measure needs only the finite weighted integral. The full graph consists of functions, first derivatives, and second derivatives that vanish at infinity. Its closure is the exact generator of a positive conservative strongly continuous contraction semigroup on , and smooth compactly supported functions form a core.
Theorem 3.1 retains the general-state-space jump model. The transition kernel is both setwise measurable and weakly continuous; the rate and weights satisfy the source's vanishing and signed integral bounds. The weighted graph closes to a single-valued conservative Feller generator, and compactly supported continuous functions form a core.
The main theorem says that the displayed nonlocal characteristics determine stochastic dynamics in distribution even when the drift is only measurable and jump activity need not be finite. The two autonomous theorems identify concrete domains whose closures are genuine Feller generators, including positivity, contraction, strong continuity, conservativity, and core statements. Together they distinguish finite-rate kernels, homogeneous compensated Lévy dynamics, and nonautonomous Lévy-type dynamics while sharing the same generator language.
The formal contribution is a machine-checkable statement layer, not a proof claim. It exposes the exact compensation, weighted-integrability, graph-domain, semigroup, and finite-history conventions on which later proofs depend. The common diffusion operator, bounded-pointwise closure, and strongly continuous contraction-semigroup predicate are reused from earlier private missions in the same textbook series rather than duplicated under conflicting identifiers.
The obvious finite-jump approximation does not by itself preserve the full conclusions. Infinite jump activity requires compensation near zero, and convergence of the associated operators must still identify the intended martingale problem or the exact closed Feller generator. In the nonautonomous theorem, setwise continuity of weighted jump masses must coexist with merely measurable drift, while uniqueness ranges over arbitrary probability-space realizations and all finite-dimensional laws. Strengthening to continuous drift, imposing finite total jump intensity, assuming uniform ellipticity, or comparing only continuous-path solutions would materially weaken or alter the source theorem.
Nonnegative real time is represented by ℝ≥0; Euclidean coordinates use Fin d. Fréchet derivatives express both gradient and Hessian terms. The jump measure is a measure of displacements , so the operator evaluates . Integrable hypotheses prevent Lean's totalized integral from silently assigning zero to a divergent positive weighted moment. Positive dimension is explicit through [NeZero d].
The martingale predicate includes empty finite histories and repeated observation times. Its bounded continuous history tests determine the same finite-dimensional identities used by the source, and no sample-path regularity is inserted. The autonomous graphs live in ; bounded-pointwise closure means closure under uniformly bounded pointwise sequential limits, not ordinary norm closure. The finite-rate theorem preserves its restriction of the additional integrability clause to states with positive rate. No vacuous solution predicate, unweighted moment assumption, hidden nonzero-rate condition, or proof-only theorem dependency is introduced.
A convex polytope has finitely many faces in each dimension, and their numbers form its f-vector. Determining which integer vectors occur is a basic realization problem in discrete geometry: necessary identities such as Euler's relation do not by themselves decide whether a proposed vector comes from a polytope. For simplicial polytopes, whose facets are simplices, the g-theorem gives a complete answer. In the matrix formulation recorded in Chapter 10 of Branko Grünbaum's Convex Polytopes, realizable extended f-vectors are exactly the products of M-sequences with an explicit binomial matrix.
This is a known theorem, not an open conjecture. The mission asks for a machine-checked proof of the reviewed Lean statement while preserving the theorem's full biconditional. It is not merely a collection of upper or lower bounds on individual coordinates: one side asserts geometric realizability of the whole vector, and the other gives a simultaneous arithmetic characterization.
A d-polytope is represented as a nonempty finite convex hull in the real coordinate space Fin d → ℝ whose affine span is the whole space. A nonempty exposed face has dimension equal to the real dimension of the direction space of its affine span. The function faceCount P j counts the nonempty exposed j-dimensional faces of P.
A simplicial d-polytope is a d-polytope for which every facet is the convex hull of d affinely independent points. The extended f-vector is indexed by Fin (d+1): its coordinate f 0 is fixed to one for the empty face, while f j.succ is the integer embedding of faceCount P j for each j : Fin d.
An M-sequence in the formalization is a natural-valued function g used only from index zero through m. It begins with g 0 = 1. Each positive entry through m is either zero, with empty boundary, or is represented by a strictly increasing binomial expansion whose upper boundary is at most the preceding entry. This is the finite Macaulay condition used on printed pages 198a–198b.
The integer-valued matrix gTheoremMatrix d j k is Björner's matrix . Its entries are
with rows and columns . Subtraction is performed in the integers, not truncated natural-number arithmetic.
For every natural dimension d and every integer vector f : Fin (d+1) → ℤ, the main item states the equivalence
The left side includes both f 0 = 1 and a single simplicial polytope realizing every remaining coordinate. The right side uses one M-sequence and checks the matrix equation at every column. Its sum ranges over exactly Finset.range (d / 2 + 1), so the row indices are zero through the floor of half the dimension. Values of g outside that finite range are irrelevant on both sides of the arithmetic condition.
The theorem converts a geometric existence question into an exact finite arithmetic criterion. It characterizes the entire vector at once, retaining the correlations between face numbers that coordinatewise extremal theorems cannot express. The biconditional also has two substantive directions: every simplicial polytope produces an M-sequence, and every permitted M-sequence is realized by a simplicial polytope.
Formalizing this statement supplies reusable interfaces for full-dimensional polytopes, exposed-face counts, simpliciality, finite M-sequences, and the g-theorem matrix. The theorem body remains open in the proposal. The established mathematical result is being posed as a Lean proof task rather than claimed as already machine-checked.
Neither direction follows from Euler or Dehn–Sommerville linear identities alone. Those equations describe an affine subspace but do not impose the nonlinear integrality and growth conditions encoded by an M-sequence. Conversely, verifying the Macaulay inequalities for a candidate sequence does not directly construct a polytope realizing all coordinates. Proving separate inequalities for each face number would also be insufficient, because the target requires one polytope and one sequence to witness simultaneous equality of the complete vectors.
All ambient geometry is finite-dimensional and real. Faces use Mathlib's exposed-face convention, and faceCount excludes the empty face before assigning a natural dimension; the leading coordinate f 0 = 1 restores the empty face in the extended vector. The polytope witness is full-dimensional in Fin d → ℝ. The matrix and the target vector are integer-valued, while the M-sequence itself is natural-valued.
The mission retains all dimensions, including the low-dimensional boundary cases. Natural subtractions inside binomial indices use Lean's truncated subtraction exactly as in the reviewed source adapter, while subtraction between the two binomial coefficients occurs in ℤ. The M-sequence witness is constrained only over the finite range used by the matrix product; no unintended condition is imposed on its unused tail.
The definitions of IsDPolytope and faceCount are reused from exact private platform declarations. The simplicial predicate is reused byte-for-byte from the preceding staged package, and the M-sequence and matrix declarations preserve their reviewed local definitions with only platform-compatible module imports. Contributions should prove the iff without weakening it to one direction, replacing realizability with coordinatewise inequalities, restricting the dimension, changing the index ranges, or allowing different witnesses for different coordinates.
Finite-dimensional simplices are the natural state spaces for proportions: allele frequencies, population shares, and other collections of nonnegative coordinates whose total cannot exceed one. A diffusion on such a space must do more than solve an unconstrained stochastic equation. Its covariance degenerates on the boundary, and its drift must respect every face so that the process remains in the simplex. Chapter 8 of Ethier and Kurtz develops generator results for this setting as part of the analytic foundation for Markov-process models with constrained state spaces Ethier and Kurtz, Chapter 8, §2.
This mission formalizes their Theorem 2.8, a known generation theorem rather than an open conjecture. The theorem treats arbitrary Lipschitz drift satisfying the inward boundary inequalities. It identifies the closed diffusion graph as a Feller generator and also states that polynomial restrictions form a core. The generality of the drift distinguishes this result from later population-model applications with particular mutation or selection coefficients.
For a positive integer , the simplex state space is
The missing mass may be viewed as an additional coordinate. In Lean, WFState d is the subtype of functions Fin d → ℝ satisfying precisely nonnegativity and the upper bound on the coordinate sum. These conditions already imply for every coordinate.
Let be the drift. The boundary conditions say that whenever , while whenever . Thus the drift cannot point outward through a coordinate face or through the top face. No mutation–selection formula or extra smoothness condition is imposed: global Lipschitz continuity and these face inequalities are the complete drift hypotheses retained here.
The covariance matrix is
and the associated simplex diffusion operator is
Only the second-order sum is multiplied by . The covariance becomes singular on boundary faces, so this is not an immediate instance of a uniformly elliptic whole-space theorem.
The formal target asserts that the uniform graph closure of
is single-valued and is exactly the generator graph of a positive, conservative, strongly continuous contraction semigroup on . Conservativity is expressed by preservation of the constant function . The generator is identified by the right derivative at time zero, not merely by containment of a convenient operator restriction.
The final clause says that polynomials restricted to are a core: closing the graph obtained from polynomial first coordinates gives the same full generator graph. This is a graph-closure statement and is stronger than uniform density of polynomials as functions.
Single-valuedness shows that the closed graph behaves as an operator rather than a multivalued relation. Generation supplies a Feller semigroup whose positivity and preservation of constants give the Markov interpretation. The exact generator biconditional fixes the full infinitesimal domain, while the polynomial-core conclusion permits generator questions to be reduced to algebraically structured test functions without changing the closed operator.
The source theorem is already proved in the book. The formalization task is to recover its generator statement and core conclusion in Lean with all boundary, closure, and semigroup conventions explicit. The current mission contributes a source-reviewed statement and its expression-level definitions; it does not claim a completed Lean proof.
The obvious route through standard elliptic diffusion generation does not apply because degenerates as coordinates approach the boundary. It is also insufficient to prove only that the displayed differential operator is contained in some generator: the theorem identifies the closure of the entire graph and separately asserts the polynomial core.
Boundary semantics create another source of possible weakening. Dropping either inward condition would permit outward drift at a face. Replacing the arbitrary Lipschitz drift by a special population-genetics formula would narrow the theorem. Replacing graph equality by inclusion, or polynomial graph density by ordinary function density, would lose a stated conclusion. These distinctions are all preserved in the target.
The Lean development uses the book-wide namespace EthierKurtz. The compact space is represented by real-valued bounded continuous functions on WFState d; compactness makes this the intended continuous-function space with the uniform norm. A function is represented through a globally twice continuously differentiable extension on the ambient finite-coordinate space, following the book’s Appendix 6 extension convention for closed convex sets.
The operator uses Fréchet derivatives evaluated on coordinate vectors, which represent the first and second partial derivatives in the finite-dimensional ambient space. The graph is closed in the product uniform norm. IsStronglyContinuousContractionSemigroup records identity at zero, the nonnegative-time semigroup law, contraction, and strong right continuity at zero. The target additionally records positivity, preservation of one, and equality between its derivative graph and the closed diffusion graph.
The scope excludes the zero-dimensional case, as required by 0 < d. It does not introduce a continuous-path hypothesis, a special drift parameterization, or uniform ellipticity. The only packaged declarations beyond the goal are the state space, operator, graph, and the already published semigroup predicate needed to state it. Proof-only lemmas and unrelated Chapter 8 results are outside this mission.
A one-dimensional diffusion is governed in the interior by a second-order differential operator, but the interior coefficients alone do not determine what happens when the process approaches the edge of its state space. An endpoint may be reachable from the interior or inaccessible; after arrival it may absorb, reflect, or retain the process according to a boundary parameter. The same issue persists when an endpoint is infinite. Chapter 8 of Stewart N. Ethier and Thomas G. Kurtz, Markov Processes: Characterization and Convergence (Wiley, 1986), organizes these alternatives through scale and speed integrals and identifies the exact operator domain that generates the corresponding Feller evolution. This mission formalizes Chapter 8, Section 1, Theorem 1.1, printed page 367.
Let . The real state interval is , its interior is , and is the closed interval in the extended real line. A function in is represented by a continuous function on that compact extended interval, so finite endpoint limits are part of the object even when an endpoint is infinite.
The interior diffusion operator is
where and are continuous on and there. Choose an interior reference point . Define
The corresponding endpoint tests and are nonnegative extended-real integrals. Their values may be ; preserving that possibility is essential because the four boundary classes are distinguished precisely by which of the two tests are finite.
At either endpoint, the pair gives the Feller boundary class:
Entrance and natural endpoints are inaccessible, so the generator domain imposes no boundary equation there. At an exit endpoint the limiting generator value must be zero. At a regular endpoint , a parameter determines the boundary condition
The target states that the graph consisting of that are twice continuously differentiable in the interior, whose extends continuously to , and that satisfy the applicable condition at both endpoints is exactly the infinitesimal generator of a Feller semigroup on . The conclusion includes the semigroup law, contraction, strong right continuity at zero, positivity, preservation of the constant function , and a biconditional identifying the complete generator graph rather than merely an included core or its closure.
The theorem translates local coefficients into a global Markov evolution while retaining every possible finite or infinite endpoint type. The endpoint tests determine which boundary behavior is available, and the regular-boundary parameter records absorbing, reflecting, and intermediate behavior in one equation. Without the classification, writing down the differential expression does not specify a unique Feller generator because distinct domains can encode different stochastic behavior at the same endpoint.
The formal contribution is a machine-checkable statement layer for the source theorem. It makes the compactified state space, improper endpoint integrals, one-sided endpoint filters, and exact generator graph explicit. The theorem itself remains an open proof obligation in this statement-only mission. The definitions can also support later formal work on hitting distributions, killed or reflected diffusions, and comparison of boundary regimes.
The main difficulty is that the classification cannot be reduced to ordinary finite integrals or to boundary values at finite real points. Infinite endpoints and divergent scale or speed tests carry mathematical information; replacing extended-real integrals by totalized real integrals would collapse boundary classes. A second difficulty is identifying the full closed generator domain. Showing that the differential expression is meaningful on smooth interior functions is insufficient: the proof must connect its endpoint asymptotics to positivity, conservativity, strong continuity, and exact generation on the uniform-norm space.
Endpoints use EReal, and the state space is Set.Icc r₀ r₁ in the extended line. Coefficients are constrained only on the open real interior; no boundedness or uniform ellipticity is added. The drift primitive and scale/speed tests use oriented interval integrals internally and ENNReal endpoint integrals externally, retaining . Absolute values correct the orientation on the left of the reference point.
The graph stores continuous endpoint extensions of both and . Interior regularity is expressed by ContDiffOn ℝ 2, and endpoint limits use the one-sided neighborhood filter induced from the extended interval. The regular parameter is required to lie in only when both boundary tests are finite. The mission does not replace the four cases by an opaque classifier, assume finite endpoints, add a pathwise stochastic differential equation, or weaken exact generation to graph inclusion. The shared book definition of a strongly continuous contraction semigroup is reused from the earlier semigroup-generation mission rather than redeclared.
Diffusion processes connect stochastic differential equations, partial differential equations, and Markov semigroups. On Euclidean space, their local behavior is encoded by a second-order operator built from a covariance field and a drift field. A central question is whether those local coefficients determine an actual Markov evolution, and whether the resulting evolution is unique. Ethier and Kurtz organize these questions through generator graphs and martingale problems, which allow the same language to cover smooth elliptic diffusions, degenerate models, and coefficients that vary measurably with time. This mission formalizes three complementary whole-space regimes from Chapter 8 of Stewart N. Ethier and Thomas G. Kurtz, Markov Processes: Characterization and Convergence (Wiley, 1986), principally Theorems 1.6, 1.7, and 2.5.
The state space is the finite-dimensional Euclidean space , represented in Lean as EuclideanSpace ℝ (Fin d), with . A covariance operator is a continuous linear endomorphism of this space, while a drift is a vector. For a smooth scalar test function , the diffusion operator is
The factor multiplies only the covariance-weighted second-order term. The formalization uses Fréchet derivatives evaluated in the standard coordinate directions. In the time-homogeneous cases, the smooth compactly supported graph consists of pairs viewed in , and its uniform closure is the candidate generator.
For time-dependent coefficients, a measurable process solves the time-inhomogeneous martingale problem when its initial pushforward law is prescribed and the integrated generator identity holds against every smooth compactly supported spatial test and every bounded continuous finite-history test. This formulation records the natural-past moment identities without imposing continuity of sample paths as an extra hypothesis.
The main target is Chapter 8, Section 1, Theorem 1.7. The covariance and drift are jointly Borel measurable and locally bounded. The covariance is symmetric and nonnegative. At each fixed spatial point it is uniformly elliptic over every bounded positive time interval, and its spatial continuity is uniform over that interval. A common quadratic bound controls the covariance norm and the one-sided radial drift quantity .
For every initial probability measure, the conclusion asserts existence of a measurable-process solution on some probability space and uniqueness of all finite-dimensional distributions among every such solution on any probability space. The drift is not assumed continuous, and no stronger norm-growth condition on the drift or moment condition on the initial law is inserted.
Chapter 8, Section 1, Theorem 1.6 treats bounded Hölder continuous time-homogeneous coefficients with symmetric, globally uniformly elliptic covariance. It concludes that the closure of the smooth compactly supported graph is single-valued and is exactly the generator of a positive, strongly continuous contraction semigroup on . Conservativity is retained through membership of the constant graph pair in the bounded-pointwise closure.
Chapter 8, Section 2, Theorem 2.5 permits degenerate and unbounded covariance fields. Its assumptions are symmetry, nonnegativity, twice continuous differentiability of the matrix entries, bounded second partial derivatives, and a globally Lipschitz drift. Its conclusion is the same full Feller generation and conservativity statement. This regime is related to, but not implied by, the bounded uniformly elliptic regime.
Together the three statements separate distinct mechanisms for obtaining Markov dynamics from local diffusion data. The two autonomous theorems identify when a concrete smooth core closes to a Feller generator, including positivity, contraction, strong continuity, and conservativity. The nonautonomous theorem establishes existence and uniqueness in distribution under substantially rougher temporal behavior and merely measurable drift. Keeping the regimes together exposes the common operator while preserving their incompatible regularity hypotheses.
The formal contribution is a machine-checkable statement layer for these source results and their expression-essential definitions. It does not claim proofs of the theorems. The definitions make explicit the coordinate form of the generator, the graph, the bounded-pointwise closure convention, and the complete finite-history martingale identities. These components can support later formal proofs and other diffusion or martingale-problem developments.
The source conclusions are not consequences of a single elementary continuity argument. In the Feller cases, identifying the closure of a graph with the generator requires simultaneous control of the operator domain, the semigroup properties, positivity, and conservativity. In the time-dependent case, measurability of the drift is deliberately weaker than continuity, while uniqueness must cover all measurable-process realizations and all finite collections of observation times. Replacing that conclusion by uniqueness only among continuous processes, or strengthening the drift hypotheses until a standard smooth theory applies, would change the theorem.
The development uses nonnegative real time and finite-dimensional real Euclidean space. Covariance matrices act as continuous linear maps; their entries are recovered in the standard orthonormal basis. Smoothness is expressed with ContDiff, compact support with HasCompactSupport, and autonomous generator graphs in C₀. The bounded-pointwise closure is the smallest set closed under uniformly bounded pointwise sequential limits, not merely the set of one-step limits.
The martingale-problem predicate requires joint measurability of the process, equality of the initial pushforward measure, and all bounded continuous finite-history identities. Empty histories and repeated observation times are included. The goal compares the complete finite-dimensional laws of any two solutions. No vacuous solution predicate, arbitrary extension of the generator, chosen matrix square root, hidden path-continuity assumption, or proof-only theorem dependency is used.
Classical central limit theorems begin with independent observations. Many stochastic models instead produce observations whose dependence persists across time: measurements from an equilibrium process, functions of a stationary Markov chain, and noise sequences in time-series models are standard examples. For such data, the variance of a long sum contains covariance terms from every lag, and independence cannot be used to discard them. Chapter 7, Section 3 of Stewart N. Ethier and Thomas G. Kurtz, Markov Processes: Characterization and Convergence (Wiley, 1986), gives a functional central limit theorem under a quantitative mixing condition. The conclusion is stronger than convergence of one normalized sum: the whole partial-sum path converges to Brownian motion.
Fix a probability space and a two-sided real sequence . Strict stationarity means that shifting every integer index by the same amount leaves the joint law of the entire sequence unchanged. Each is measurable and centered, so .
For a nonnegative lag , let the past be the sigma-algebra generated by all with , and let the future be generated by all with . For , the book's mixing coefficient is the supremum, over future events , of
Thus measures how far events at least time units in the future remain from being independent of the complete past. The Lean definition constructs both coordinate-generated sigma-algebras explicitly and represents conditional probability as the conditional expectation of an indicator.
For , define the scaled partial-sum process
The Lean sequence uses the index because Lean's natural numbers begin at zero; this is only a reindexing of the same positive scaling sequence. Suppose there is such that every coordinate has a finite moment. Set
The target is Theorem 3.1: the ordered covariance series converges and
is nonnegative, while converges to centered Brownian motion with variance parameter . The variance is allowed to be zero. The covariance sum is encoded as convergence of its ordered partial sums, not as the stronger and unrequested assertion of absolute summability.
The result identifies the macroscopic fluctuation process of a stationary dependent sequence. It supplies both the long-run variance, including every lag covariance, and a Brownian path limit. Consequently, continuous functionals of the accumulated process can be studied through the limiting Brownian motion rather than only through one-time normal approximations.
The formal statement preserves the book's functional interpretation. ConvergesToContinuousGaussian records the complete prelimit path laws, centered Gaussian finite-dimensional laws with covariance , and convergence to a continuous limit through a common realization. This avoids weakening the theorem to convergence of a single terminal sum or to separate finite-dimensional marginals. The declaration is a statement-only formalization: the theorem remains an open Lean goal, while the mixing coefficient and partial-sum process are concrete definitions.
The usual independent-sum argument does not apply because blocks of observations are not independent and their covariance terms need not vanish. Merely showing that dependence becomes small at large lags is insufficient: the decay must interact with the available moment so that the total contribution of distant dependence is summable. A scalar central limit theorem would also leave tightness of the path sequence unresolved. The theorem packages both issues into the summability condition on the precise coefficient and concludes a path-level Brownian limit.
The formalization uses a two-sided sequence indexed by , matching the source's convenient stationary extension. Stationarity is equality of the laws of the whole shifted and unshifted sequence, which entails every finite-dimensional shift identity without adding Markov or independence assumptions. The probability measure is explicit, and every coordinate has an explicit measurability hypothesis.
stationaryLpMixing uses the past through zero and the future beginning at lag . Its codomain is the extended nonnegative reals, so an infinite norm or supremum is not silently totalized to an ordinary real. The summability hypothesis is an extended-real infinite sum strictly below infinity. stationaryPartialSums embeds the real sum in one-dimensional Euclidean space so it can reuse the book-wide continuous-Gaussian path-convergence definition. The exact floor, positive indexing, square-root normalization, covariance order, and degenerate zero-variance case are retained. No interpolation, absolute covariance summability, positive-variance assumption, Markov property, or independence condition is introduced.
The expression-essential infrastructure consists of the two definitions introduced here and the compatible book-wide ConvergesToContinuousGaussian definition already staged for the preceding diffusion-limit mission. The latter is imported rather than duplicated under a conflicting name. Useful future work includes proving the theorem from martingale approximation and developing reusable results relating concrete mixing bounds to the required summability hypothesis.
Many stochastic models are built from small random changes occurring at high frequency. Queue lengths, population counts, particle systems, and numerical schemes may be discrete or have jumps at every finite scale, yet their large-scale behavior is often described by a continuous diffusion. A diffusion approximation replaces the detailed microscopic model by a process whose drift and covariance depend on its current state. This can make asymptotic probabilities and qualitative behavior accessible without claiming that the original model itself has continuous paths.
Chapter 7 of Stewart N. Ethier and Thomas G. Kurtz, Markov Processes: Characterization and Convergence, develops general limit theorems for this passage. The retained results in this mission are Theorem 1.4, a martingale functional central limit theorem with deterministic covariance, and Theorem 4.1, a state-dependent diffusion approximation from localized characteristics. They are related limit regimes, but the former is not presented here as a literal specialization of the latter: its covariance may vary deterministically with time, whereas the state-dependent theorem uses time-homogeneous coefficient fields evaluated along the evolving state.
A càdlàg process is right-continuous and has a finite left limit at every positive time. For each index , the state process and its finite-variation characteristic have càdlàg paths in . A symmetric matrix process has càdlàg entries and positive-semidefinite increments. The natural filtration records the histories of , , and jointly.
The centered process is required to be a local martingale coordinatewise. Its quadratic characteristic is represented by requiring every product
to be a local martingale as well. These conditions identify as the approximate drift and as the approximate covariance accumulation. They do not impose independence of the coordinates or of the prelimit processes.
Localization uses the first time at which either the current value or its left limit reaches radius . The jump and characteristic conditions are checked only up to , for each radius and time horizon . This is essential when coefficients are controlled locally but not globally.
Let be a continuous symmetric positive-semidefinite matrix field and let be a continuous vector field. For smooth compactly supported , define
Assume the continuous-path martingale problem for this operator is well posed for every initial probability law. The goal states that if the stopped squared jumps of and vanish in expected supremum, the stopped first-power jumps of each vanish, and the stopped characteristics converge in probability to
then weak convergence of the initial laws implies convergence of the complete path laws to the unique continuous diffusion law.
The retained milestone treats vector local martingales with deterministic limiting covariance . It preserves both alternatives in the source: either first-power martingale jumps vanish and is the actual cross variation, or the jumps of and the squared jumps of the martingale vanish while is locally martingale. Pointwise convergence in probability of to then yields the centered continuous Gaussian limit with covariance .
The state-dependent theorem packages a common diffusion-limit argument into conditions on observable local characteristics. It separates model-specific work—identifying the drift, covariance, localization, and jump bounds—from the general conclusion that the entire trajectory converges. The martingale theorem records the important deterministic-covariance regime without erasing either of its two source alternatives.
For formalization, the mission provides concrete predicates for càdlàg paths, stopped maximum jumps, localized characteristic discrepancies, the diffusion generator, continuous martingale-problem laws, and Gaussian process convergence. The result is statement-only: the theorem bodies remain open with sorry, while every expression dependency is a concrete definition. No theorem proof, adapter-equivalence proof, or claim of completed formal verification is included.
Finite-dimensional convergence alone does not control whole trajectories. The central obstacle is simultaneous control of oscillations, jumps, and characteristics after localization. A naive argument that replaces and by their limiting integrals pointwise misses the uniform stopped discrepancies and does not justify tightness of path laws. Likewise, ignoring the left limit in the exit rule can miss a jump that crosses the localization boundary.
Well-posedness is also substantive. Identifying every subsequential limit with a solution of the martingale problem gives uniqueness only when that problem is well posed for the relevant initial law. The formal statement therefore retains existence and uniqueness for every initial probability law rather than silently assuming a distinguished solution.
Time is nonnegative and the sequence is indexed from zero rather than one. Expectations of jump suprema take values in , so no unmentioned integrability assumption is introduced. Matrix positivity is Matrix.PosSemidef, which includes the real symmetric positive-semidefinite condition used by the source. The exit time includes both the current value and the positive-time left limit, and an empty exit set gives infinity.
The diffusion law uses continuous canonical paths, smooth compactly supported tests, and bounded measurable functions of finitely many past states to express the natural-filtration martingale identities. Full process convergence is encoded by a joint realization that preserves every complete prelimit path law and converges almost surely uniformly on each compact interval to a continuous limit. This is the source-reviewed continuous-limit Skorohod representation convention, not merely convergence of finitely many observations.
The two shared definitions EthierKurtz.IsSourceLocalMartingale and EthierKurtz.HasCrossVariation are imported from the earlier book-wide stochastic-calculus package. All other definitions needed to state these two results are included here. Contributions should preserve the localization quantifiers, both central-limit jump alternatives, the full martingale-problem well-posedness hypothesis, and the complete path-law conclusions.
A Brownian stochastic equation describes a state that changes through a deterministic drift and random fluctuations. Such equations are basic models for diffusions and connect probabilistic sample paths with analytic operators. Chapter 5, Section 3 of Stewart Ethier and Thomas Kurtz's Markov Processes: Characterization and Convergence develops this connection in both directions and then separates three questions: whether a solution exists, whether it is unique when driven by fixed noise, and whether all solutions have the same distribution. The mission records four central results from that section as one coherent formalization target. The principal goal is the fixed-driver existence theorem, Theorem 3.11. Theorems 3.3, 3.6, and 3.10 retain the representation, uniqueness, and weak-existence variants without treating one as a consequence of another.
Fix a dimension . The state space is the Euclidean space , represented in Lean as EuclideanSpace ℝ (Fin d). A diffusion coefficient
controls the random fluctuations, and a drift coefficient
controls the finite-variation part. Given a -dimensional Brownian motion and initial state , a solution satisfies, componentwise,
The formal statement does not postulate an opaque stochastic-integral operator. The predicate HasBrownianItoIntegral uses bounded predictable dyadic step approximations, integrated squared-error convergence in probability, and convergence in probability of the corresponding stochastic sums. SolvesBrownianSDE requires continuous paths, adaptation to the completed natural past of and , integrability of the drift, and one almost-sure equation holding for every time and coordinate.
A weak solution may choose its probability space, filtration, and Brownian driver. Its Brownian future increments are independent of the entire filtration past, its state process is adapted after completion, and its initial distribution is prescribed. Pathwise uniqueness compares two solutions on the same space with the same filtration and driver. Distribution uniqueness compares solutions that may live on different spaces and asks for equality of their whole coordinate-path laws.
For locally bounded Borel coefficients, a given continuous solution of the diffusion martingale problem can be lifted to the completed product with an auxiliary Brownian space. On that specific extension there exists a Brownian motion making the lifted original process a weak solution of the stochastic equation. The generator is
This target retains the factor , the complete drift term, possibly singular diffusion matrices, the given process, and the exact completed product filtration.
For locally bounded Borel and and any initial probability law , pathwise uniqueness implies uniqueness in distribution. No existence, Lipschitz, ellipticity, or moment assumption is added.
When both coefficients are continuous and a constant satisfies
there is a weak solution for every initial probability law. The drift hypothesis is one-sided and does not bound .
The main goal assumes locally bounded Borel coefficients, the preceding one-sided growth condition locally in time, and local Lipschitz control on each bounded state ball. For every Brownian motion and every independent square-integrable initial variable already given on a probability space, there exists solving the equation with respect to the completed natural past of and . The quantifier order preserves the fixed driver and original probability space.
The representation theorem connects the analytic martingale problem with the pathwise stochastic-integral formulation while preserving a given process on a prescribed extension. The uniqueness theorem explains when the apparently stronger same-noise comparison controls the law of arbitrary weak solutions. The weak-existence theorem supplies solutions under continuity and one-sided growth without local Lipschitz assumptions. The strong-existence theorem supplies a solution driven by noise and initial data that are fixed in advance, under local Lipschitz regularity.
Formalizing the group creates reusable definitions for completed filtrations, Brownian drivers, local Itô integration, weak solutions, pathwise uniqueness, and time-dependent diffusion generators. The source results are classical theorems, and this proposal records their reviewed Lean statements as open proof obligations. It does not claim machine-checked proofs.
The central difficulty is keeping the probabilistic quantifiers and filtrations exact. Replacing the local stochastic integral by an unconstrained witness would make the equation too weak. Replacing weak existence by existence on a fixed space would make Theorem 3.10 too strong. Conversely, existentially choosing a new driver in Theorem 3.11 would lose its fixed-noise content. The representation theorem also cannot be reduced to equality in law: it must retain the original process through first projection and use the completed product past specified in the source.
Time is ℝ≥0, states are finite-dimensional real Euclidean spaces, and diffusion matrices use the Frobenius norm. Brownian motion is represented by independent scalar Brownian coordinates with measurable evaluations and continuous paths. Completion adds every subset of an ambient measurable null set. The local Itô relation uses left-endpoint dyadic step functions, interval integrability, and convergence in probability. Equality of path laws is expressed on the coordinate function space; for continuous Euclidean paths this matches the usual continuous-path law.
The main theorem keeps Borel measurability, compact-set local boundedness, one-sided drift growth, squared diffusion growth, local Lipschitz bounds, independence of and , and the second moment of . The weak theorem keeps continuity and an arbitrary initial law. The representation target keeps compactly supported smooth tests and the exact covariance contraction. These conditions rule out vacuous solution predicates and default-valued integrals. Contributions may prove the four theorem statements or establish reusable lemmas for the concrete integral, completion, martingale, and path-law infrastructure.
A continuous stochastic process may combine a finite-variation drift with a local martingale fluctuation. To understand a function of that process, one needs a change-of-variables rule that accounts for both parts and for their quadratic covariation. The ordinary chain rule has no term for covariation. The result here is the time-dependent, multidimensional Itô formula in Stewart N. Ethier and Thomas G. Kurtz, Markov Processes: Characterization and Convergence (Wiley, 1986), Chapter 5, Section 2, Theorem 2.9, printed page 287 (PDF page 296). It applies to arbitrary continuous semimartingales satisfying the stated decomposition; its input is not restricted to a particular stochastic differential equation.
Time is the nonnegative real half-line and the state has d real coordinates, indexed by Fin d. The sample space Ω has a complete probability measure P and a filtration ℱ. The initial sigma algebra contains every ambient measurable null set. For each coordinate i, V_i is a continuous adapted finite-variation process, zero at time zero; M_i is a continuous adapted local martingale, zero at time zero almost surely. The process X_i has an ℱ₀-measurable initial value and satisfies X_i(t)=X_i(0)+V_i(t)+M_i(t) for all times and samples.
The test function f(t,x) has a continuous first time derivative, continuous first spatial derivatives, and continuous second spatial derivatives. At time zero, the time derivative is taken within the nonnegative-time domain. The notation f_t, f_{x_i}, and f_{x_i x_j} denotes these derivative witnesses. The conclusion supplies processes representing the continuous cross variations and integrals; their existence is part of the theorem. The Stieltjes relations use pathwise left dyadic sums for continuous finite-variation integrators. Martingale integrals and cross variations use convergence in probability of their corresponding dyadic sums. The integral versions are continuous and adapted where the theorem requires those properties.
For every t ≥ 0, outside one null set independent of t, the target is
The goal is EthierKurtz.ito_formula. It retains every term and both coordinate indices in the cross-variation sum. The bracket and integral witnesses are existential conclusions, so the statement does not require their existence as an extra hypothesis on X.
The formula identifies the effect of a smooth, time-dependent transformation on any process with the stated continuous semimartingale decomposition. In particular, it exposes the second-order correction that distinguishes stochastic change of variables from deterministic calculus. This makes it a general calculus result that can later be applied to diffusion equations, martingale problems, and transformed processes, independently of how the input process was constructed.
The cited theorem is established in the source book. This mission provides a compiled Lean statement and concrete expression dependencies; it does not provide a Lean proof. Formalizing the proof would require the stochastic-integral and covariation infrastructure to support the source's continuous local-martingale setting and version conventions. A solver's result should prove this full statement or develop reusable infrastructure that supports it without changing its hypotheses or conclusion.
The ordinary deterministic chain rule cannot account for the double sum of cross variations. A statement limited to Brownian motion, an absolutely continuous bracket, or a fixed stochastic differential equation would omit cases covered by the source. The local-martingale integral also needs a continuous adapted version with a common almost-sure interpretation over all times; merely obtaining a separate fixed-time limit does not by itself supply that final identity. These requirements make the exact scope of the integral and bracket relations central to the formalization.
The Lean declaration uses ℝ≥0 for time, Fin d → ℝ for state vectors, Measure Ω for the probability law, and Filtration ℝ≥0 for the filtration. It includes completeness of P, the initial-null-set condition on ℱ 0, continuity and adaptation of V and M, local bounded variation of V, stopping-time localization for M, the full decomposition of X, and continuous derivative witnesses for f. The final almost-everywhere quantifier precedes the universal time quantifier. There is no Brownian driver, global square-integrability requirement, right-continuity assumption on the filtration, or diagonal-only bracket simplification.
Five definitions are expression dependencies: IsSourceLocalMartingale, HasCrossVariation, itoStepSum, HasContinuousStieltjesIntegral, and HasContinuousMartingaleIntegral. Their staged declarations retain the reviewed source definitions under a consistent EthierKurtz namespace. The dyadic-sum definitions do not embed the change-of-variables identity, so the theorem cannot be discharged by unfolding a definition of the desired answer. The mission asks for a proof of the stated result, not a weakened special case. The empty-coordinate case is admitted consistently; no positive-dimensional source case is excluded.
Continuous-time Markov processes are often studied through operators that describe how observables evolve. The generation question asks when an operator specified on a domain actually determines a strongly continuous family of contractions. Ethier and Kurtz place this question at the start of Markov Processes: Characterization and Convergence because the resulting semigroup language supports their later treatment of processes and convergence. This mission records the full generation characterization in Chapter 1, Theorem 2.6, and retains the related perturbation result in Theorem 7.1.
Let (E) be a real Banach space. A linear operator (A) has a linear domain (D(A)\subseteq E), which need not equal (E). A family (T(t)), for nonnegative real (t), consists of bounded linear maps (E\to E). It is a strongly continuous contraction semigroup when (T(0)) is the identity, (T(s+t)=T(s)T(t)), every (T(t)) has norm at most one, and (T(t)x\to x) as (t\downarrow0) for every (x\in E). Its infinitesimal generator has exactly those (x) for which the right-hand difference quotient (t^{-1}(T(t)x-x)) converges, and sends each such (x) to the limit.
An operator is dissipative here when
The range condition for a positive (r) says every vector in (E) is (rx-Ax) for some (x\in D(A)). Density means that vectors in (D(A)) approximate every vector in (E). These are independent requirements in the formal statement; neither the domain nor the operator is assumed closed or bounded.
For the related perturbation theorem, (A) and (B) may have different domains. Their sum uses the intersection of those domains. Closure is closure of the graph in (E\times E). A graph closure is required to be the graph of a single-valued operator before it can be called a generator.
The goal is the equivalence
The left side uses the full infinitesimal-generator domain, rather than agreement with a generator only on a smaller subdomain. The right side includes dissipativity for every positive parameter and full surjectivity for at least one positive parameter.
The retained related result assumes that the closure of (A) is single-valued and generates a strongly continuous contraction semigroup, (D(A)\subseteq D(B)), and (B) is dissipative. It further assumes
It concludes that the closure of (A+B) is single-valued and generates such a semigroup, and that its entire graph equals the sum of the graph closures of (A) and (B). This theorem is a related generation variant within the same mission, not a separate main goal.
The equivalence turns an existence question about a family of operators into conditions on a single potentially unbounded operator. In particular, it preserves the exact-domain requirement: proving only that a semigroup generator extends (A) would answer a weaker question. The perturbation theorem then identifies circumstances under which an already generating operator remains useful after adding a dissipative term that need not itself be bounded.
The textbook proves both statements. The Lean files supplied here are statements with intentional proof holes; they do not claim machine-checked proofs. A completed formalization would supply proofs of these source results while keeping the domain, range, closure, and relative-bound conditions shown in the statements.
The hypotheses describe a linear map on only part of the Banach space, while the conclusion requires bounded operators on all of (E) at every nonnegative time. Checking a semigroup law on a convenient subspace is insufficient unless the resulting operators and generator have the stated full domains. For perturbations, graph closure can enlarge a domain. An equality of formulas on (D(A)) alone would therefore omit the theorem's graph and domain conclusion.
Lean uses NormedAddCommGroup E, NormedSpace ℝ E, and CompleteSpace E for the real Banach space; Submodule ℝ E for each domain; D →ₗ[ℝ] E for an operator that need not be bounded; and E →L[ℝ] E for each semigroup operator. Semigroup values at negative real times are unconstrained. The derivative is the right limit through positive times. Graph closure is topological closure in the ambient product, and graph sum requires a common input. The strict relative bound (\alpha<1) and positive resolvent parameter remain explicit.
The reusable definitions are the semigroup predicate, full generator predicate, operator graph, and graph sum. The mission welcomes proofs of the two stated theorems and genuinely source-based supporting lemmas. A model with an empty operator domain, an operator restricted from a larger generator, or a conclusion that drops the graph equality would not satisfy the target.
A neighborly family of convex polytopes is a collection in which every two distinct members meet in the largest dimension possible without having a full-dimensional overlap: their intersection has codimension one. The question is extremal. For a fixed ambient dimension, how large can such a family be when its members must also satisfy a geometric restriction? Chapter 7 of Branko Grünbaum's Convex Polytopes records Joseph Zaks's answer for central symmetry: in every dimension at least three, no finite upper bound exists. The result belongs to discrete geometry because it combines pairwise intersection constraints, dimension, and symmetry across an entire finite family rather than studying the face structure of one polytope.
The theorem is cited by Grünbaum in §7.5 as the resolution of a problem posed in §7.4. The original result is Zaks's 1986 paper, “Arbitrarily large neighborly families of symmetric convex polytopes”. This mission formalizes the centrally symmetric conclusion quoted in the textbook, without adding the stronger congruence variants discussed elsewhere.
Fix an integer and work in the real coordinate space . In Lean this space is represented by Fin d → ℝ. A -polytope is a nonempty finite convex hull whose affine span is the entire ambient space. Full affine span is essential: it rules out treating a lower-dimensional polytope embedded in as a -polytope.
A polytope is centrally symmetric when there is a center such that reflection through leaves invariant. The center is chosen separately for each member of the family; the theorem does not require one common center. In coordinates the reflection is , represented in Lean by AffineEquiv.pointReflection ℝ c.
A finite family of -polytopes is neighborly in the sense of Grünbaum §7.4 when, for every distinct , the intersection has affine dimension . This use of “neighborly” concerns pairwise intersections among several convex sets. It is different from the familiar notion of a neighborly polytope, where small subsets of the vertices of a single polytope span faces.
For every and every natural-number threshold , the target asserts the existence of a finite set such that
every is a centrally symmetric -polytope, and every distinct pair satisfies
Quantifying over every threshold is the precise finite formulation of “arbitrarily large.” It does not claim that one infinite family has all these properties. The witness family may depend on both and .
The result shows that central symmetry does not impose a finite ceiling on neighborly-family size once . The conclusion is therefore a structural existence statement, not merely a construction of a single large example. It also separates two issues that can otherwise be conflated: each member has an internal symmetry, while neighborliness is a relation between distinct members.
The mathematics is known, but the Lean item in this mission is statement-only and remains to be proved. A complete formalization would connect finite convex-hull geometry, affine dimension, affine reflections, and pairwise intersections in one reusable development. The full-dimensional polytope predicate is shared across the textbook series and is packaged as an expression-essential definition rather than hidden inside the theorem.
The quantified size threshold prevents a finite catalogue or a fixed example from resolving the target. The pairwise condition also couples every new member to all earlier members: verifying central symmetry for each polytope alone gives no control over the dimensions of its intersections with the rest of the family. The explicit nonemptiness condition matters because affine dimension is represented with a natural-valued finrank; without it, conventions for the empty affine span could obscure the intended codimension-one requirement.
The family is a Finset, so its members are distinct and its cardinality is the ordinary finite cardinality. Every member satisfies Grunbaum2003.IsDPolytope, which requires a nonempty finite generating set, equality with its convex hull, and full affine span. Central symmetry is expressed by invariance under a point reflection with an individually quantified center. For distinct members, the intersection must be nonempty and the rank of the direction of its affine span, plus one, must equal .
No common center, congruence, translate-only model, face-to-face condition, or infinite-family claim is included. The case is included, while dimensions below three are excluded exactly as in the source. The case is harmless because the same theorem is quantified over every positive threshold as well. The scope contains the one reviewed Zaks theorem and its single expression-essential polytope definition; it does not introduce unrelated chapter theorems or a proof strategy.
A convex polytope can be studied metrically, through coordinates and lengths, or combinatorially, through the inclusion order of its faces. Grünbaum's Convex Polytopes develops the second viewpoint systematically: two polytopes have the same combinatorial type when their complete face posets are order-isomorphic. Chapter 7 studies neighborly polytopes, which have as many low-dimensional faces as their vertex sets permit. These objects are central test cases because very strong local face incidence coexists with a large variety of realizations and combinatorial types.
The capstone of this mission is the rigidity statement attributed in §7.5 to Shemer: in even dimension, the combinatorial type of a neighborly polytope determines the combinatorial type of every subpolytope spanned by a subset of its vertices. Here “rigid” is exclusively combinatorial. It does not assert preservation of lengths, angles, coordinates, or projective realization. The source statement appears in Branko Grünbaum, Convex Polytopes, second edition, §7.5, printed p. 129b / PDF p. 161 (Springer edition).
The Lean development represents the ambient real space of dimension as Fin d → ℝ. A predicate IsDPolytope P says that is the convex hull of a finite nonempty vertex set and has full affine span. Faces are modeled by Mathlib's exposed-face predicate. The type PolytopeFace P contains all exposed faces ordered by inclusion, including the empty face and itself; an order isomorphism of these types is the formal representation of combinatorial equivalence.
For a positive integer , a polytope is -neighborly when every -element set of vertices spans a proper face and is exactly the vertex set of that face. The definition IsKNeighborly k P states this directly for finite sets of exposed singleton vertices. Grünbaum defines an even-dimensional polytope of dimension to be neighborly when it is -neighborly. The theorem therefore assumes and uses IsKNeighborly r for both parent polytopes.
Let and be full-dimensional neighborly polytopes in . Their vertices are enumerated injectively by maps . A permutation records the prescribed correspondence between the two vertex sets, and an order isomorphism between the full face posets witnesses that this correspondence comes from a combinatorial equivalence of the parent polytopes.
For every index set , the target produces an order isomorphism
and requires it to carry each selected singleton vertex to . The quantifier over is unrestricted. Empty, singleton, lower-dimensional, and full vertex subsets are all included. No selected subpolytope is required to be full-dimensional or neighborly.
Knowing only how many neighborly combinatorial types exist would not reconstruct any particular vertex-induced subpolytope. The rigidity theorem is stronger: once the complete face-poset type of the parent and its vertex correspondence are fixed, the complete face-poset type of every labelled vertex subpolytope is fixed as well. This is why the formal conclusion keeps the label-preservation clause rather than stating only the existence of an abstract order isomorphism.
The result is known mathematics, while the Lean declaration supplied here is statement-only and retains sorry as its proof placeholder. The formalization contribution is therefore a precise target and its expression-essential vocabulary, not a claim that Shemer's proof has already been machine checked. A completed proof must establish exactly this uniform reconstruction theorem without adding metric hypotheses or restricting the allowed subsets.
The parent face-poset isomorphism directly identifies the faces already present in and , but a subpolytope can have faces that are not faces of its parent. Consequently, restricting to selected vertices does not automatically yield the required subpolytope face-poset isomorphism. The theorem must control how all new faces created by taking a vertex subset depend on the original neighborly combinatorics. That gap is the substantive content of rigidity and prevents the conclusion from being a routine restriction of the given parent isomorphism.
The scope is deliberately narrow. IsDPolytope, IsKNeighborly, and PolytopeFace are the only local definitions required to express the theorem. Vertices are exposed singletons, combinatorial types are full face-poset order types, and convex hulls remain in the original ambient space even when a selected subset is lower-dimensional. The theorem assumes positive even dimension through with . It imposes no metric congruence, no choice of realization normal form, and no cardinality lower bound on the selected subset.
Useful contributions include a proof of the stated target and reusable lemmas connecting neighborliness, vertex subsets, and exposed-face posets. A reformulation that covers only nonempty or full-dimensional subsets, forgets the prescribed vertex labels, or replaces face-poset equivalence by equality of face counts would not satisfy this mission.
A basic classification question in polytope theory asks what combinatorial types can occur when the dimension and number of vertices are fixed. The question is not merely whether there are finitely many types. Effective enumeration asks for a uniform algorithm which produces the complete list, with no omissions and no repeated combinatorial type. This converts a structural finiteness assertion into a finite procedure that can in principle support tabulation, comparison, and exhaustive study of small polytopes.
Grünbaum formulates this enumeration problem in §5.5 of Convex Polytopes and states its solvability as Theorem 5.5.2, printed p. 91 (PDF p. 117 of the supplied source). The surrounding discussion represents a combinatorial type by a finite scheme recording which subsets of labelled vertices form proper faces. The source then selects one representative for every realizable type. This mission follows that statement and encoding, as recorded in the supplied edition of the book (Springer DOI).
Fix natural numbers and . A -polytope is a nonempty finite convex hull in real coordinate space whose affine span is the whole space. Its faces are exposed faces. Following Grünbaum's convention, this includes the empty face and the polytope itself as improper faces. The natural-valued function counts nonempty exposed faces whose affine direction has dimension ; in particular, is the number of vertices.
A finite scheme is encoded as a list of lists of natural numbers. Each inner list represents a finite subset of vertex labels; its order and repeated entries have no mathematical meaning. The predicate SchemeRealizes k S P supplies an injective labelling whose range is exactly the set of exposed singleton vertices of . For every finite subset of natural numbers, membership of in the scheme is equivalent to the existence of a nonempty proper exposed face whose labelled vertices are exactly . Quantifying over every finite natural-number subset prevents an out-of-range label from silently denoting a face.
Two polytopes have the same combinatorial type when their complete face posets are order-isomorphic. The Lean subtype PolytopeFace P contains every exposed face of , including the two improper faces, and inherits the inclusion order. Thus Nonempty (PolytopeFace P ≃o PolytopeFace Q) is the formal equivalence relation used in the target.
The target is Grünbaum's Theorem 5.5.2 (book record and DOI). In Lean it states that there is a single function
which is computable and has the required behavior for every and . Its finite output satisfies three clauses. First, every output scheme is realized by some -polytope. Second, every -polytope with vertices realizes an output scheme. Third, if realizations of two output positions have order-isomorphic complete face posets, then those positions are equal. The three clauses jointly express soundness, completeness, and selection of a single representative per combinatorial type.
The theorem is Grunbaum2003.combinatorial_types_effectively_enumerable. Its body is an intentional sorry: this package supplies the reviewed, compiling statement and does not claim a machine-checked proof.
The conclusion gives more than abstract finiteness. It asserts one terminating procedure, uniform in both parameters, whose finite result represents all and only the desired types. Soundness prevents junk schemes; completeness prevents a legitimate polytope type from being missed; uniqueness prevents the output from counting the same type twice under different label lists. The theorem thereby isolates the precise data that an implementation or a formal proof must justify.
A formal proof would connect geometric realizability, finite incidence data, and computability in one development. The reusable infrastructure includes a full-dimensional finite-hull predicate, exposed-face counting, the complete exposed-face poset, and a labelled finite-scheme realization predicate. These definitions can also support formal statements about realization tests and enumerations under additional restrictions, without changing this mission's source obligation.
Finite syntactic generation alone is insufficient: most arbitrary families of vertex subsets need not be face systems of convex polytopes. Conversely, merely knowing that only finitely many combinatorial types exist does not provide an effective method for recognizing realizable schemes. The target must establish a total algorithm while simultaneously proving that every accepted scheme is geometrically realizable, every eligible polytope is represented, and no two selected entries encode order-isomorphic face posets.
Vertex relabelling is another source of redundancy. Two different nested lists can describe the same incidence structure, and two different geometric realizations can have the same face lattice. The uniqueness clause therefore compares realized complete face posets rather than list equality. A procedure that only enumerates labelled presentations, or one that decides equivalence without selecting representatives, would not prove the stated theorem.
The Lean function returns nested finite lists, so finiteness of each output and of each scheme is built into the type. Mathlib's Computable₂ supplies total computability on the paired natural inputs. The quantifier order chooses one before , , and any polytope, preserving uniformity. No rational-coordinate, simplicial, or fixed-combinatorics hypothesis is introduced.
IsDPolytope requires a nonempty finite convex hull with full affine span. faceCount P 0 = k imposes the prescribed vertex count. SchemeRealizes requires exactly the exposed singleton vertices and exactly the nonempty proper exposed faces under an injective finite labelling. PolytopeFace retains the empty and full improper faces for the final order-isomorphism comparison. These choices prevent the statement from becoming vacuous through an unconstrained incidence code or a predicate that assumes realizability.
Natural-number boundary cases remain explicit. If no -polytope with vertices exists, an empty output is permitted. In dimension zero, the unique point has one vertex and no nonempty proper face, so the empty scheme represents it. This coding extension does not remove any positive-dimensional case. The expression dependencies are exactly the four definitions listed above; proof-only lemmas and unrelated theorems from the book are not included as mission items.
A convex set can be studied through its images in lower-dimensional spaces. Each image retains part of the geometry while discarding information along the directions that are collapsed. Finite convex hulls behave well under affine maps: the image of a convex hull of finitely many points is again the convex hull of finitely many points. The converse is subtler. It asks whether sufficiently comprehensive lower-dimensional image data forces the original bounded convex set itself to have a finite description by points.
This mission formalizes the projection-recognition criterion attributed to Klee in Branko Grünbaum's Convex Polytopes, second edition, §5.1, Theorem 5.1.8, printed page 74 (PDF page 100 of the supplied source). The criterion concerns every projection into one suitable intermediate dimension, not a chosen coordinate view. It therefore characterizes a global property of the original set by an entire family of dimension-reducing images.
Fix a natural number . Real coordinate space is represented in Lean by functions from Fin d to the real numbers. A subset is convex when it contains every line segment joining two of its points, and it is bounded when all of its points lie within some finite metric ball. Neither condition requires to be nonempty, closed, or full-dimensional.
For a set , its convex hull is the smallest convex set containing . In the convention used by Grünbaum in §3.1, printed page 31 (PDF page 51), a polytope is equivalently the convex hull of a finite set. The generating set need not be a minimal vertex set, and the formal statement permits the finite set to be empty or contained in a proper affine subspace.
An affine map preserves affine combinations. A surjective affine map
has image dimension exactly . When , it is singular. Grünbaum defines a projection at the opening of §5.1, printed page 71 (PDF page 97), as an image under a singular affine map. Using a surjective affine map to coordinate -space represents a projection to a -dimensional affine space followed by an affine choice of coordinates. Whether a set is a finite convex hull is unchanged by that coordinate identification.
For every bounded convex set , the target is the equivalence
The dimension may depend on , but it is selected before the universal quantifier over affine maps. Every surjective affine map with that target dimension is tested. For each map, the finite set whose convex hull is may be different; no common projected generator set and no uniform bound on its size is asserted. This is one theorem with both directions, so there are no separate milestone statements in the package.
The forward implication records the stability of finite convex hulls under affine images. The recognition implication is the substantive part: under boundedness and convexity, polytopality of every projection in one eligible intermediate dimension forces itself to be a polytope. The conclusion concerns rather than merely its closure and does not add a hidden closedness assumption.
The theorem is established mathematics in the cited textbook. The present artifact is a compiled formal statement, not a completed machine-checked proof: its theorem body is by sorry. Completing it would connect Mathlib's finite convex-hull and affine-map infrastructure to the classical projection-recognition argument while preserving the source's quantifier order and lower-dimensional boundary cases.
Each projected set may have its own unrelated finite generating set. Those separate witnesses do not directly assemble into a finite generating set in the original ambient space, because every projection has discarded a kernel direction. Checking one convenient projection is inadequate: that image can conceal structure occurring precisely in the collapsed directions. The challenge is therefore to use the universal family of projections at the selected dimension without replacing it by a fixed axis projection or adding compactness, full dimensionality, or nonempty interior.
The Lean declaration is Grunbaum2003.polytope_iff_polytope_projections, in the book-wide namespace Grunbaum2003. It takes Bornology.IsBounded K and Convex ℝ K as the exact domain hypotheses. Polytopality is written directly as existence of a finite set with convex hull equal to the set; no stronger book-local full-dimensional polytope predicate is used. Projections are all surjective real affine maps from Fin d → ℝ to Fin j → ℝ.
The explicit premise records the admissible ambient range required by . In dimension three, the only possible target dimension is two. No displayed existential claim is made for dimensions zero, one, or two, where no such exists. Within every admissible dimension, empty sets, singletons, and other lower-dimensional bounded convex sets remain in scope. Surjectivity prevents a map from having rank below , and the strict inequality ensures dimension loss. There are no expression-essential book-local definitions or supporting theorems; the only dependencies are Mathlib modules for convex hulls, boundedness, finite-dimensional coordinate spaces, and affine maps.
The face structure of a cube is unusually regular: its vertices, edges, and higher dimensional faces are indexed by choices of fixed and free coordinates. A natural realization question asks how much of this structure can survive in a polytope of lower dimension. In §4.9 of Convex Polytopes, Grünbaum reports the Joswig–Ziegler construction of neighborly cubical polytopes. The source result says that a cubical -polytope can retain a prescribed low dimensional skeleton of an -cube even when . It concerns the entire pattern of faces and containments within that skeleton, rather than a count of vertices or edges alone. The theorem appears on printed page 69b (PDF page 95) of the supplied 2003 edition.
Fix natural numbers . A -polytope here is a nonempty finite convex hull with full affine span. A face is an exposed subset of ; the empty face and itself are included in the face poset. Its order is set inclusion. For a nonempty face, dimension is the dimension of its affine span. The standard -cube is in , described coordinatewise by .
A cubical -polytope is such a full dimensional polytope whose every facet, meaning every nonempty exposed face of dimension , has a full face poset order isomorphic to the face poset of a standard -cube. This is combinatorial cubicality: a facet need not be congruent or affinely equal to a metric cube. It also does not say that the vertices of have binary coordinates.
The -skeleton face poset consists of the empty face together with all exposed faces of affine dimension at most , with their inherited inclusion order. The source speaks of a skeleton “of” an -cube: the intended correspondence preserves and reflects face containment across the two ambient dimensions. An order isomorphism of the two skeleton face posets is the Lean expression of that combinatorial equivalence.
The single target is the unnumbered Joswig–Ziegler existence theorem as reported by Grünbaum. For every , with , it asks for a cubical -polytope such that
The witness may depend on both and . The strict inequality and lower bound are source conditions. They have not been expanded or narrowed for this package. For and , the cutoff is zero, so the skeleton includes the empty face and vertices. At larger dimensions the claim includes all faces through the stated cutoff and their order relations.
In Lean the theorem is Grunbaum2003.neighborly_cubical_realization. Its conclusion supplies a set in Fin d → ℝ, proves the cubical-polytope predicate of that set, and supplies a nonempty type of order isomorphisms between the two skeleton face posets. The declaration is a compiled statement with a sorry body. No machine-checked proof of the existence theorem is claimed here.
This theorem separates dimension of realization from the low dimensional combinatorics being realized. In particular, an -cube skeleton can occur inside a lower dimensional cubical polytope, subject to the precise cutoff above. The conclusion is a structural face-poset match, not a numerical face-vector equality. A complete formal proof would establish an existence statement about genuine full dimensional convex polytopes and an order equivalence of their truncated face systems.
The reusable formal objects in this package are the full dimensional polytope predicate, the face subtype, the skeleton subtype, the standard cube, and the cubical-polytope predicate. They express the geometry and combinatorics independently of the particular neighborly realization theorem. The goal is kept as one mission because the source states one dimension-parametric existence result; the definitions are only its expression dependencies.
A lower dimensional realization cannot retain every face of a higher dimensional cube. The theorem therefore specifies exactly which dimensions of faces can be preserved. Merely matching the number of vertices would leave edges, higher faces, and incidence unconstrained. Likewise, requiring all facets to look like cubes says nothing by itself about whether a large cube's skeleton appears. A proof must produce a genuine cubical witness and the ordered skeleton correspondence simultaneously, for every allowed pair of dimensions.
The Lean coordinate spaces are real functions on Fin d and Fin n. Natural division d / 2 is floor division, and the assumption makes natural subtraction by one agree with the source's integer cutoff. The full dimensional condition rules out an empty or lower dimensional witness. IsExposed supplies faces, including the improper empty and whole faces; the skeleton predicate treats the empty face explicitly because its conventional dimension is , outside natural-number dimensions. The nonempty face dimension is the finrank of the affine direction.
The face-poset order is inherited from set inclusion. Cubicality is checked on each qualifying facet by an order isomorphism with the full face poset of the reference cube. The target's order isomorphism similarly covers the whole selected skeleton rather than only vertices. Contributions toward a proof may introduce construction and comparison lemmas, but none is asserted as an additional theorem item in this reviewed package.
source.pdf.A polytope may be described by its vertices or by its facets. These descriptions can differ sharply in size even when every vertex has only binary coordinates. Grünbaum's account of 0/1-polytopes in §4.9 records a result of Bárány and Pór: the maximal number of facets grows superexponentially with dimension. The result is an existence statement about the geometry of binary coordinate sets. The source describes random polytopes as witnesses, without specifying a probability distribution as part of the theorem.
Fix a dimension . A -polytope here is a nonempty convex hull of finitely many points in with full affine span. A 0/1-polytope is the convex hull of a subset of . Both properties are required of the witness. A facet is a nonempty exposed face of affine dimension . The count uses the book's convention that the empty face has dimension and is excluded from natural-indexed face counts. This representation follows Grünbaum §§2.4 and 3.1 for faces and full-dimensional polytopes, and §4.9 for the binary coordinate family.
The single source obligation is the unnumbered Bárány–Pór assertion quoted by Grünbaum in §4.9, printed p. 69a (PDF p. 94). In mathematical notation, the statement is
The constant and threshold are chosen before ; the witness may depend on . The logarithm in Lean is natural logarithm. Changing a fixed logarithm base rescales the existential constant. The result is asymptotic: it does not assert the inequality in every small dimension. The threshold also keeps the natural-number expression in the facet dimension away from underflow.
The goal item Grunbaum2003.barany_por_binary_facet_growth carries this entire obligation. Its body is sorry, so the package presents a compiled statement, not a machine-checked proof. There are no separate source lemmas in this mission and no milestones to assert beyond the goal.
The theorem shows that binary vertex coordinates do not impose a merely exponential ceiling on the number of facets. It gives a family of full-dimensional binary polytopes whose facet counts eventually exceed an expression of the form for one fixed . A formal proof would establish that family in the chosen polytope and face-count representation. The present statement makes the quantifier order, full-dimensionality, binary-coordinate restriction, and strict facet inequality explicit for such a proof.
The existence of many binary vertices alone does not certify many facets: one must establish distinct supporting faces of codimension one. The source attributes the strong lower bound to a random construction. A proof must connect that construction to the geometric facet count while keeping one constant valid for every sufficiently large dimension. The mission statement leaves the construction method to the proof, as the quoted book assertion supplies no probability-space parameters or probability bound.
Lean represents a point of by Fin d → ℝ and a polytope by a set of such points. IsDPolytope requires a finite nonempty convex-hull presentation and full affine span. IsZeroOnePolytope requires a convex-hull presentation whose generators have every coordinate equal to zero or one. faceCount P k uses the finite cardinality of nonempty exposed faces of affine dimension ; for the full-dimensional witness, faceCount P (d - 1) is the facet count. No face-finiteness, simplicity, or probabilistic assumption is added to the theorem.
The package uses these three expression-essential definitions and the Mathlib real-power and logarithm notation. IsDPolytope and faceCount match the definitions already staged for other missions in this textbook series. A proof may reuse geometric lemmas or supply a new formal version of the Bárány–Pór construction, provided it proves the stated inequality for the original full-dimensional binary family.
source.pdf, PDF pp. 35, 51, 94).A polytope can be given by a list of vertices, a list of inequalities, or much less explicit access. The last case arises when geometric information is available through queries to a physical or computational object but a full description is unavailable. Grünbaum's account of a result by Gritzmann, Klee, and Westwater asks how much of a polytope can be recovered when each query shoots a ray from a known interior point and reports where it meets the boundary. The target is the complete face lattice, including incidence among faces of every dimension, and the cost is the number of oracle calls. The result appears in Convex Polytopes, §3.6, printed pp. 52b–52c (PDF pp. 74–75 of the supplied source).
Fix a positive integer . A -polytope is a nonempty finite convex hull in real coordinate space whose affine span is the whole space. The origin is known to lie in the interior of . A ray query supplies a nonzero direction ; the oracle returns the intersection of the positive ray with the boundary of . The theorem requires this boundary-point property for every nonzero direction. It does not give the reconstruction program the vertices, inequalities, face counts, or coordinates of .
A face is represented by an exposed subset of , ordered by inclusion. The resulting face lattice includes the empty and whole faces. For , counts nonempty faces of affine dimension ; hence is the vertex count and is the facet count. The empty face has dimension in the book's convention and is excluded from these natural-indexed counts. These conventions follow Grünbaum §§2.4 and 3.1 (printed pp. 17 and 31; PDF pp. 35 and 51).
The single source obligation is the unnumbered Gritzmann–Klee–Westwater theorem of Grünbaum §3.6. For each , one finite exact-real ray-query program works for every eligible and every correct ray oracle for . It halts with an encoding of the entire face lattice after at most
queries. The square on the facet count, both coefficients, and the continuation of “queries” across the page break are part of the printed statement. The program is selected before the unknown polytope and its oracle. The finite running time and output may depend on the instance. No common output, fixed runtime bound, or bit-complexity bound is asserted.
The Lean declaration is Grunbaum2003.ray_oracle_face_lattice_reconstruction. It asserts existence of the program, universal correctness, finite termination in a halt instruction, the displayed query inequality, and a concrete encoding of the whole face lattice. Its body is sorry: this package is a compiled statement and does not claim a machine-checked proof.
The conclusion recovers all face incidences from boundary samples on rays from one interior point. It is stronger than recovering only a vertex or facet list because the output explicitly determines the ordering of all faces. The bound measures the information requested from the oracle; the source does not constrain the number of internal arithmetic steps. A formal proof would connect the geometric reconstruction argument to a precise query machine and establish that its output matrix has exactly the claimed faces and inclusions.
Ray answers are geometric points, while the desired output is a global combinatorial structure. Sampling one direction per visible feature gives no direct certificate that all faces and incidences have been found. In particular, a proposed reconstruction must use only the permitted oracle answers and still know when its finite description is complete. The theorem also needs a uniform program for every polytope in a fixed dimension, with the instance dependent query count above. The present statement makes these quantifier and resource requirements explicit.
The machine has a finite instruction list for rational constants, exact real arithmetic, sign branches, tape movement, oracle queries, and halt. Its tape begins at zero. A query reads a nonzero direction from the tape and writes back the oracle's boundary answer; only this instruction increments the query counter. A zero direction, invalid label, or division by zero fails instead of creating a successful execution. Thus an unrestricted oracle value at zero cannot certify the theorem. Arithmetic and sign tests are exact real operations, matching the source's query model rather than imposing a bit model.
The output is a self-delimiting Boolean inclusion matrix indexed by a finite type. A bijection connects its indices to all exposed faces of , and each matrix entry is one precisely when the associated faces are ordered by inclusion. This rules out an output consisting merely of face counts, vertices, or facets. IsDPolytope, faceCount, PolytopeFace, the ray-oracle predicate, machine syntax and execution, and the output predicate are the expression dependencies of the goal. The exposed-face subtype and full-dimensional polytope predicate are shared unchanged with this book's other staged missions. Contributions needed for a proof may include geometric face finiteness and reconstruction lemmas, but those are not added as unreviewed mission items here.
source.pdf, PDF pp. 74–75).How few distinct distances can a planar point set determine? The near enemies of this mission are the closest competitors to the extremal configuration: points in no-three-collinear position (no line through three of them) and points lying on a common sphere — the lattice-sphere slice of Erdős–Füredi–Pach–Ruzsa is the motivating example. The bisector energy of a set counts ordered quadruples of points for which the pair and the pair have the same perpendicular bisector; it measures how far the set is from generic. Lund–Sheffer–de Zeeuw fixed the floor of this statistic: is a universal lower bound, and bisector injectivity is sufficient for equality. The Near Enemy theorem is the projection statement on top of it — every admissible set admits one generic projection whose image attains that floor, sits in general position, has zero rotation energy, and carries the whole distance-transport package.
Work with finite sets of points in the Euclidean plane
(EuclideanSpace ℝ (Fin 2)), and in the transport direction with points in
EuclideanSpace ℝ ι for a general finite index type. Following
Lund–Sheffer–de Zeeuw, the bisector energy is
The rotation energy counts the ordered congruent quadruples whose difference
vectors are neither equal nor opposite, so it discards the translation and
half-turn channels and isolates the proper-rotation one. A linear map is
projection-generic for a set when exactly two conditions hold: sends
the difference of any two distinct points of to a nonzero vector, and for
two distinct unordered pairs of the images never combine a parallel pair of
differences with an orthogonal midpoint difference. Perpendicular bisectors,
difference classes and distance images are all Finset operations.
The mission goal is the spherical complete profile: for every finite set lying on a common sphere, in any dimension, there is a linear map to the plane whose image satisfies six conclusions at once —
together with injectivity of on , general position of the image (no three collinear, no four cospherical), and exact distance transport. The projection is chosen per set — its very type depends on the ambient dimension — but a single projection delivers all six conclusions together, and that bundled form is what downstream incidence arguments consume.
Milestones ascend in five steps: the universal energy floor, the bisector-injectivity equality case, the attainment of the floor by projection-generic maps, the existence of such a map for every no-three-collinear set, and the no-three-collinear transport bundle that the goal then specialises to the spherical case.
Lund–Sheffer–de Zeeuw introduced the extremal picture for bisector energy at the level of the exact constant. In footnote 1 on p. 538 of the SoCG 2015 version (LIPIcs vol. 34, 537–552) they state that when every distinct pair determines a distinct bisector, with the enumeration of the trivial quadruples that proves the floor. The universal asymptotic form is a remark in their §3.4.
This mission builds a complete machine-checked development of the
floor, its attainment and the sufficiency direction, from first principles in
Lean 4 over mathlib; the rotationEnergy statistic together with the
rotationEnergy = 0 certificate for the projected image, where
rotationEnergy(P) = 0 follows from the published "distance Sidon set"
property; and a single generic projection of a given set that carries the
bisector floor at the same time as the Erdős–Füredi–Pach–Ruzsa general-position
package. Four of that bundle's six conjuncts are already in
Erdős–Füredi–Pach–Ruzsa 1993, whose Theorem 3.1 supplies them.
Formalizing it matters because the argument composes analysis (generic
projections obtained from nonvanishing of circle determinants), algebra
(inner-product and determinant polynomial witnesses carrying
linear_combination certificates) and counting (fiberwise difference-class
tallies) — and the interfaces between the three must agree exactly. The
projection-genericity and polynomial-witness lemmas are reusable for any
Euclidean extremal formalization.
The hard step is keeping the projection generic through every predicate at once: a projection that preserves no-three-collinearity can still kill a circle determinant, or create a coincidence that the counting needs to keep distinct. The naive first idea — project along a random direction and hope — fails because each predicate forbids a different algebraic hypersurface of directions; the fix is a single simultaneous-avoidance argument over the union, with each forbidden set shown proper by an explicit polynomial witness. That step is the largest proof in the mission and carries its own milestone.
Points are EuclideanSpace; finite sets are Finset; energies are ℕ-valued
statistics. Generic projections are linear maps carrying the explicit
two-clause ProjectionGeneric predicate, so there is no hidden regularity
assumption. Dimension is a general ι with [Fintype ι] wherever the transport
needs it. The goal's only hypothesis is membership of a common sphere;
no-three-collinearity is derived from it rather than assumed, because a line
meets a sphere at most twice. No statement is vacuous: explicit witnesses were
checked in the kernel for the goal and for every milestone.
Welcome contributions: the converse of the equality case — bisector injectivity is proved here to be sufficient for the floor, and necessity is open in this development; sharpness examples beyond the Erdős–Füredi–Pach–Ruzsa configuration; and the incidence assembly that consumes this mission's output.
Geometry.Euclidean.NearEnemyTheorem.