{"schema_version":1,"revision":1062,"release":"25f42822da23db12c89134ae0c7631c8d2d6c4f56d67ea3b1a684d763c014730","totals":{"results":1239,"projects":935},"entries":[{"abbreviated":false,"abstract":"For every positive real epsilon, there is a positive constant C such that log c is at most C times rad(abc) to the power 2/9 + epsilon whenever a and b are positive coprime integers and a + b = c. The radical is the product of the distinct prime factors. This is an upper bound for log c. The abc conjecture itself remains open.","authors":[{"name":"Ruiyi Zhang"}],"classification":{"arxiv":["math.NT"],"msc2020":["11D75","11J86"]},"formalization":{"theorem_names":["AbcTwoNinths.twoNinths"]},"id":"PALOMAR-2026-11-20-000025","path":"entries/PALOMAR-2026-11-20-000025-v1.json","preservation":{"repositories":[{"commit":"e10c67b33dda8d5c97d6f275d9644a3be7438ee2","fork_repository":"PalomarArchive/ryzfsu--abc-log-bound-two-ninths--9a7b4635abc7","source_repository":"ryzfsu/abc-log-bound-two-ninths"}]},"preview":{"artifact_tree_sha256":"c61c849935f10c737a84ff31f574cbcd6cbb2011dc666c6b3041f14f6cea9a1f","version":1},"published_at":"2026-11-20T21:24:09Z","source":{"commit":"e10c67b33dda8d5c97d6f275d9644a3be7438ee2","project_path":null,"repository":"ryzfsu/abc-log-bound-two-ninths"},"source_omitted":false,"status":"registered","title":"An upper bound for log c in the abc conjecture with exponent 2/9","trust":{"level":"high"},"version":1,"versions":1},{"abbreviated":false,"abstract":"A Lean 4 / Mathlib proof of the stable manifold theorem for maps, in graph form. Let f be of class C^n, 1 <= n <= infinity, on a neighborhood of a fixed point p of a finite-dimensional real normed space E, with derivative A = Df(p) invertible and hyperbolic (no complex eigenvalue of modulus 1), and let E_s and E_u be the stable and unstable subspaces of A. Then there are a neighborhood N of p and maps h_s : E_s -> E_u and h_u : E_u -> E_s, of class C^n and vanishing with their derivatives at 0, such that for every neighborhood U of p inside N, the local stable set of f in U (the points whose forward orbit stays in U and tends to p) is the graph {p + x + h_s(x)} of h_s over a neighborhood of 0 in E_s, and the local unstable set (the points with a backward orbit in U tending to p) is the graph {p + y + h_u(y)} of h_u over a neighborhood of 0 in E_u. Inside a small neighborhood of p the convergence is automatic: the local stable set in U is the set of points whose forward orbit stays in U, and the local unstable set the set of points with a backward orbit in U. The stable side is also proved without invertibility, with one h_s for every neighborhood inside a small ball around p. Also proved: the hyperbolic splitting E = E_s (+) E_u for a hyperbolic linear map of a finite-dimensional real space, with E_s and E_u the kernels of the factors of the characteristic polynomial with roots inside and outside the unit circle.\n\nThe proof is Perron's method on the Banach space of bounded sequences. The splitting comes from a factorization of the characteristic polynomial and Gelfand's formula, and gives an exponential dichotomy. After a cut-off by a bump function, f is a globally small Lipschitz perturbation F of A near p; the bounded forward orbits of F are the fixed points of a contraction built from the Lyapunov-Perron operator, and form the graph of a Lipschitz map over E_s. Smoothness of every order comes at once, without the fiber contraction theorem: the composition operator x -> phi o x is C^n on bounded sequences when phi is, and the inverse function theorem on the space of bounded sequences makes the graph C^n. The unstable side is the stable side of the local inverse of f. No earlier formal proof of the theorem for maps was found; a concurrent Lean 4 development (TauCeti) proves stable and unstable manifolds for equilibria of vector fields.","authors":[{"name":"The-Anh Vu-Le"}],"classification":{"arxiv":["math.DS","math.FA"],"msc2020":["37D10","37D05","37C05","37C25","46T20","47J07"]},"formalization":{"theorem_names":["StableManifoldChallenge.stable_manifold_forall_nhds","StableManifoldChallenge.stable_manifold","StableManifoldChallenge.hyperbolic_splitting","StableManifoldChallenge.stableSubspace_symm","StableManifoldChallenge.localStableSet_symm"]},"id":"PALOMAR-2026-11-20-000024","path":"entries/PALOMAR-2026-11-20-000024-v1.json","preservation":{"repositories":[{"commit":"4909ed2eb6bdc504f86ccb455e544315f11d3860","fork_repository":"PalomarArchive/vltanh--lean4-stable-manifold--f310633bb994","source_repository":"vltanh/lean4-stable-manifold"}]},"preview":{"artifact_tree_sha256":"d8b394adf88c9e98e6be6c2bc551083c6d7335e9c9bf9aeb3d39a8e8d31308cc","version":1},"published_at":"2026-11-20T21:15:07Z","source":{"commit":"4909ed2eb6bdc504f86ccb455e544315f11d3860","project_path":null,"repository":"vltanh/lean4-stable-manifold"},"source_omitted":false,"status":"registered","title":"The stable manifold theorem for a hyperbolic fixed point of a smooth map, with the hyperbolic splitting","trust":{"level":"high"},"version":1,"versions":1},{"abbreviated":false,"abstract":"Let T be a tempered distribution on the real line with value-only atomic records for T and its Fourier transform on locally finite carriers. If the point count on either ray of the physical carrier is bounded by C times the radius along arbitrarily large radii, a nonzero finite real-frequency exponential polynomial annihilates T. The opposite carrier only needs to be locally finite for this implication. When the counted carrier is the actual support and the centred count of the opposite carrier has zero quadratic lower density, both records are finite sums of translated and modulated lattice Dirac combs. The latter conclusion also holds with the Fourier record as the counted actual support. The radii witnessing lower density may be sparse.","authors":[{"name":"Jamie Martin"}],"classification":{"arxiv":["math.CA","math.FA"],"msc2020":["42A38","46F12"]},"formalization":{"theorem_names":["MeyerGeneralProblem.exists_finiteExponentialAnnihilator_of_finite_lower_ray_count","MeyerGeneralProblem.finiteModulatedDiracCombSum_pair_of_finite_lower_ray_count","MeyerGeneralProblem.finiteModulatedDiracCombSum_pair_of_fourier_finite_lower_ray_count","MeyerGeneralProblem.LocallyFiniteCarrier.isolationSchwartz_apply_subtype","MeyerGeneralProblem.modulatedAffineDiracComb_apply","MeyerGeneralProblem.finiteExponentialMultiplication_on_tests"]},"id":"PALOMAR-2026-11-20-000023","path":"entries/PALOMAR-2026-11-20-000023-v1.json","preservation":{"repositories":[{"commit":"7fd45c10dd33cd6d08e75139c8768321ea5ae393","fork_repository":"PalomarArchive/balancedscorpion--meyer-fourier-pair-classification--091af37f6af2","source_repository":"balancedscorpion/meyer-fourier-pair-classification"}]},"preview":{"artifact_tree_sha256":"d850a6642d74cd4018c95531a39e1c09aed1c708a87e023e67e766cd624f88c5","version":1},"published_at":"2026-11-20T21:08:43Z","source":{"commit":"7fd45c10dd33cd6d08e75139c8768321ea5ae393","project_path":null,"repository":"balancedscorpion/meyer-fourier-pair-classification"},"source_omitted":false,"status":"registered","title":"Annihilation and finite-comb classification from finite lower density on one ray","trust":{"level":"high"},"version":1,"versions":1},{"abbreviated":false,"abstract":"If a product of two monic real polynomials with nonnegative coefficients is binary and one factor has exactly three nonzero coefficients, both factors are binary. Two independent finitely supported integer laws are each uniform on their support when their sum is uniform on its support and one law has exactly three support points. This formalization uses Fourier series.","authors":[{"name":"Alessandro Baravelli"}],"classification":{"arxiv":["math.CO"],"msc2020":["11C08","11B83"]},"formalization":{"theorem_names":["UnfairTrinomial.trinomial_factor","UnfairTrinomial.uniform_of_independent_random_variables"]},"id":"PALOMAR-2026-11-20-000022","path":"entries/PALOMAR-2026-11-20-000022-v1.json","preservation":{"repositories":[{"commit":"7241a53bed334df9cf8ef635d51e32ae29706a9e","fork_repository":"PalomarArchive/esonde--unfair-polynomials-conjecture--c30bdd017e83","source_repository":"esonde/unfair-polynomials-conjecture"}]},"preview":{"artifact_tree_sha256":"7321b70a632388508dac57a3c87b5bbcb634c48e619f4e1245c65fb17ff1c025","version":1},"published_at":"2026-11-20T20:33:16Z","source":{"commit":"7241a53bed334df9cf8ef635d51e32ae29706a9e","project_path":"lean/v2","repository":"esonde/unfair-polynomials-conjecture"},"source_omitted":false,"status":"registered","title":"The Unfair 0–1 Polynomial Conjecture for Trinomial Factors","trust":{"level":"high"},"version":1,"versions":1},{"abbreviated":false,"abstract":"For every finite index type n, the integral symplectic group Sp(2n, ℤ) is generated by the matrix J = (0 −1; 1 0), the translations (1 S; 0 1) with S symmetric, and the matrices (U 0; 0 Vᵀ) with UV = VU = 1 (the image of GL(n, ℤ)). The proof does not induct on n. It inducts on a set s of indices: every symplectic matrix that fixes the basis vectors e_j, j ∈ s, of the first half of ℤⁿ ⊕ ℤⁿ lies in the generated subgroup. In the step, the column M e_i = (a, c) is moved to e_i by elements that fix the e_j: first Euclid's algorithm in each coordinate k ∉ s makes c = 0, using (1 tE_kk; 0 1) and its conjugate by J; then a descent on the sum of |a_k| over k ∉ s, by units of M_n(ℤ) of the form 1 + c·e_lᵀ, reduces a to e_i, the last nonzero entry being ±1 because a row of the inverse matrix gives a Bezout relation.","authors":[{"name":"Richard Morley-Smith"}],"classification":{"arxiv":["math.NT","math.GR"],"msc2020":["11F46","20H05","15B36"]},"formalization":{"theorem_names":["SymplecticGeneration.closure_eq_top"]},"id":"PALOMAR-2026-11-20-000021","path":"entries/PALOMAR-2026-11-20-000021-v1.json","preservation":{"repositories":[{"commit":"9b72660e7c76256c442b52234e99d3c8c3327ae8","fork_repository":"PalomarArchive/rmorleysmith--morley-smith-formal--c62fec5eab58","source_repository":"rmorleysmith/morley-smith-formal"}]},"preview":{"artifact_tree_sha256":"1ba3b144eaa4933b29f8c2799e0f13cf59fb9db8d7e9ddea54101dd08905ec75","version":1},"published_at":"2026-11-20T20:26:04Z","source":{"commit":"9b72660e7c76256c442b52234e99d3c8c3327ae8","project_path":"tau-track","repository":"rmorleysmith/morley-smith-formal"},"source_omitted":false,"status":"registered","title":"Generators of the integral symplectic group Sp(2n, ℤ)","trust":{"level":"high"},"version":1,"versions":1},{"abbreviated":false,"abstract":"Verification of the asymptotic count of Boolean threshold functions and the linear dependence probability of independent uniform sign vectors.","authors":[{"name":"Xinyuan Xie"}],"classification":{"arxiv":["math.PR","math.CO"],"msc2020":[]},"formalization":{"theorem_names":["BooleanThreshold.theorem1","BooleanThreshold.theorem7"]},"id":"PALOMAR-2026-11-20-000020","path":"entries/PALOMAR-2026-11-20-000020-v1.json","preservation":{"repositories":[{"commit":"20954df4139daa40da1659eaf5bbc44ab65350a7","fork_repository":"PalomarArchive/XinyuanXie-hub--BooleanThreshold--bab55e2017a9","source_repository":"XinyuanXie-hub/BooleanThreshold"}]},"preview":{"artifact_tree_sha256":"388f1dc58755ddd82807d367546efe58b837ef9fcf7ccf62664b6aa8e2220bdc","version":1},"published_at":"2026-11-20T19:37:01Z","source":{"commit":"20954df4139daa40da1659eaf5bbc44ab65350a7","project_path":null,"repository":"XinyuanXie-hub/BooleanThreshold"},"source_omitted":false,"status":"registered","title":"BooleanThreshold","trust":{"level":"high"},"version":1,"versions":1},{"abbreviated":false,"abstract":"Let Λ be a locally finite subset of the real line with a uniform bound on the number of points in each integer unit cell. The whole complex Meyer space of tempered distributions T with value-only atomic physical and Fourier records on Λ has finite dimension. Its dimension equals the attained maximum of nullities over finite unions L of translated positive-step full lattices for which L ∖ Λ is finite. For each L, the original physical and Fourier coefficients must both vanish at every missing site. In finite lattice residue coordinates, subtracting the joint rank of these rows from the sum of the cyclotomic block nullities gives the envelope nullity. One such envelope realizes the whole space. With separate relatively separated carriers both members of the Fourier pair are finite sums of translated and modulated lattice Dirac combs. The separately stated one-record H6 theorem only bounds the physical carrier. The active spectral module is finitely generated, and a single nonzero exponential polynomial with frequencies in that module annihilates every member of the fixed-carrier space.","authors":[{"name":"Jamie Martin"}],"classification":{"arxiv":["math.CA","math.FA"],"msc2020":["42A38","46F12"]},"formalization":{"theorem_names":["MeyerGeneralProblem.boundedCount_commonSpace_holeClassification","MeyerGeneralProblem.FiniteHoleEnvelope.exists_latticeResidueMatrixCoordinates","MeyerGeneralProblem.finiteModulatedDiracCombSum_pair_of_two_unitCellBounds","MeyerGeneralProblem.spectralModule_fg_and_exists_common_finiteExponentialAnnihilator_of_unitCellBound","MeyerGeneralProblem.finiteDimensional_distributionalMeyerPairSpace_of_unitCellBound","MeyerGeneralProblem.LocallyFiniteCarrier.isolationSchwartz_apply_subtype","MeyerGeneralProblem.modulatedAffineDiracComb_apply","MeyerGeneralProblem.finiteExponentialMultiplication_on_tests","MeyerGeneralProblem.exists_latticeOrbitResidueRows_cyclotomic_finrank","MeyerGeneralProblem.mem_affineLatticeUnionCarrier","MeyerGeneralProblem.mem_atomicSupportUnion_iff","MeyerGeneralProblem.temperedFourierLinearMap_apply","MeyerGeneralProblem.mem_distributionalMeyerPairSpace_iff","MeyerGeneralProblem.atomicCoefficientLinearMap_on_tests","MeyerGeneralProblem.commonCarrierHoleRows_apply_pair","MeyerGeneralProblem.FiniteHoleEnvelope.nullity_eq_dimension_sub_rank","MeyerGeneralProblem.mem_finiteHoleEnvelopeSpace","MeyerGeneralProblem.mem_latticeDirectionClass","MeyerGeneralProblem.latticeOrbitSynthesis_apply","MeyerGeneralProblem.latticeOrbitResidueRows_apply_entry"]},"id":"PALOMAR-2026-11-20-000019","path":"entries/PALOMAR-2026-11-20-000019-v1.json","preservation":{"repositories":[{"commit":"7fd45c10dd33cd6d08e75139c8768321ea5ae393","fork_repository":"PalomarArchive/balancedscorpion--meyer-fourier-pair-classification--091af37f6af2","source_repository":"balancedscorpion/meyer-fourier-pair-classification"}]},"preview":{"artifact_tree_sha256":"870ca4031b7ff7850c5f7f99606fbce2f7ed4010f0f0910b99c4e1142080bf49","version":1},"published_at":"2026-11-20T19:09:57Z","source":{"commit":"7fd45c10dd33cd6d08e75139c8768321ea5ae393","project_path":null,"repository":"balancedscorpion/meyer-fourier-pair-classification"},"source_omitted":false,"status":"registered","title":"Finite-comb and finite-hole classification for relatively separated carriers","trust":{"level":"high"},"version":1,"versions":1},{"abbreviated":false,"abstract":"An integral unit constructed from the roots of X⁴−X−1 gives a two-qubit diagonal phase gate whose output on the plus product state has concurrence 0.99813134 rounded to eight decimal places. One use entangles a normalized pure product exactly when both qubits have nonzero amplitudes on both basis states. The maximum occurs exactly when both qubits have equal basis probabilities. Among irreducible trace-zero monic integer quartics with two real roots and a complex conjugate pair, require both the generating root and the three squared complementary-pair sums to be algebraic units. For this fixed embedding assignment, phase rule and one use, the joint maximum over all normalized pure product inputs and all eligible polynomial presentations is reached at four polynomials: X⁴±X−1 and X⁴−2X²±X+1. They present the same field by the generators ±Q and ±Q². All other eligible polynomials have squared concurrence at most 307/356, for coefficients of any height.","authors":[{"name":"Stephanie Alexander"}],"classification":{"arxiv":["math.NT","quant-ph"],"msc2020":["11R16","81P40"]},"formalization":{"theorem_names":["QuarticGate.root_phase","QuarticGate.family_separation","QuarticGate.distinguished_attains","QuarticGate.integral_unit_equation","QuarticGate.joint_unit","QuarticGate.joint_unit_values","QuarticGate.square_generator","QuarticGate.square_generator_pair_sum","QuarticGate.general_phase_symbol","QuarticGate.phase_symbol","QuarticGate.concurrence_interval","QuarticGate.unit_criterion","QuarticGate.all_height_classification","QuarticGate.all_four_attain","QuarticGate.maxima_irreducible","QuarticGate.maximum_and_equality","QuarticGate.same_generated_field","QuarticGate.Onset.product_iff_det_zero","QuarticGate.Onset.gated_det","QuarticGate.Onset.entangles_iff","QuarticGate.Onset.quartic_entangles_iff","QuarticGate.Onset.one_application_from_plus_product","QuarticGate.Onset.concurrence_factorization","QuarticGate.Onset.product_input_maximum","QuarticGate.Onset.plus_attains","QuarticGate.Onset.global_product_maximum"]},"id":"PALOMAR-2026-11-20-000018","path":"entries/PALOMAR-2026-11-20-000018-v1.json","preservation":{"repositories":[{"commit":"436232f7be657942d91618d396ea58207e6832b9","fork_repository":"PalomarArchive/stalex444--pdt-quartic-unit-entanglement--e98a99114c0e","source_repository":"stalex444/pdt-quartic-unit-entanglement"}]},"preview":{"artifact_tree_sha256":"5814f528089b12a1db04b5c3147bb00afe3939098d27a54286f89d07fa69c554","version":1},"published_at":"2026-11-20T18:30:35Z","source":{"commit":"436232f7be657942d91618d396ea58207e6832b9","project_path":null,"repository":"stalex444/pdt-quartic-unit-entanglement"},"source_omitted":false,"status":"registered","title":"When a Gate from X⁴−X−1 Entangles Two Qubits","trust":{"level":"high"},"version":1,"versions":1},{"abbreviated":false,"abstract":"Formalization of the paper \"On the cutoff phenomenon for fast diffusion and porous medium equations\" by D. Chafaï, M. Fathi and N. Simonov. For the Fokker–Planck version of the fast diffusion / porous medium equation in ℝᵈ started from a Dirac mass, whose solution is an explicit rescaled Barenblatt profile, the quadratic Wasserstein distance, the Tsallis-type relative entropy and the Fisher information to equilibrium, maximized over initial points in a ball of radius r√d, exhibit a cutoff phenomenon as d → ∞: they jump from +∞ to 0 at the critical time max(1,α)/2 · log d for a fixed self-similarity exponent α ≠ 1/2, and at 1/2 · log d for a fixed exponent m > 1. The formalization also covers the Wasserstein distance between a measure and its image under an affine map with positive semidefinite linear part, the exact Gamma-function formulas for the moments and Lᵐ norms of the full-space and compactly supported Barenblatt profiles and their high-dimensional asymptotics, the normalization of the Barenblatt profile, and the fact that the explicit solution solves the equation.","authors":[{"name":"Djalil Chafaï"}],"classification":{"arxiv":["math.AP","math.PR"],"msc2020":["35K55","35B40","49Q22","60J60"]},"formalization":{"theorem_names":["Cutfast.barenblattConst_spec","Cutfast.solution_isProbabilityDensity","Cutfast.equilibrium_isProbabilityDensity","Cutfast.solution_hasDerivAt","Cutfast.fdeSolution_hasDerivAt","Cutfast.fdeSolution_isProbabilityDensity","Cutfast.solution_eq_fdeSolution","Cutfast.tendsto_fdeSolution_zero","Cutfast.tendsto_solution_zero","Cutfast.tendsto_solution_atTop","Cutfast.integrable_sq_mul_equilibrium_iff","Cutfast.wassersteinSq_eq_top","Cutfast.relEntropy_hasDerivAt","Cutfast.relEntropy_eq_bregman","Cutfast.tsallis_strictConvexOn_tendsto_log","Cutfast.tendsto_barenblatt_one","Cutfast.tendsto_fdeSolution_one","Cutfast.tendsto_solution_one","Cutfast.cutoff_wassersteinSq","Cutfast.cutoff_relEntropy","Cutfast.cutoff_fisherInfo","Cutfast.cutoff_fixedExponent_wassersteinSq","Cutfast.cutoff_fixedExponent_relEntropy","Cutfast.cutoff_fixedExponent_fisherInfo","Cutfast.cutoff_wassersteinSq_radius","Cutfast.cutoff_relEntropy_radius","Cutfast.cutoff_fisherInfo_radius","Cutfast.cutoff_fixedExponent_wassersteinSq_radius","Cutfast.cutoff_fixedExponent_relEntropy_radius","Cutfast.cutoff_fixedExponent_fisherInfo_radius","Cutfast.wassersteinSq_map_affine","Cutfast.wassersteinSq_elliptic","Cutfast.fullBarenblatt_moment","Cutfast.fullBarenblatt_integral_rpow","Cutfast.fullBarenblatt_asymptotics","Cutfast.compactBarenblatt_moment","Cutfast.compactBarenblatt_integral_rpow","Cutfast.compactBarenblatt_asymptotics","Cutfast.compactBarenblatt_fixedExponent_asymptotics","Cutfast.compactBarenblatt_support","Cutfast.student_law","Cutfast.student_moments","Cutfast.tendsto_student_gaussian","Cutfast.student_fisherSnedecor","Cutfast.barenblatt_eq_student","Cutfast.barenblatt_student_dMinusOne","Cutfast.sphereUniform_map_projFirst","Cutfast.stdGaussian_map_sphereUniform","Cutfast.sphereUniform_map_stereoProj"]},"id":"PALOMAR-2026-11-20-000017","path":"entries/PALOMAR-2026-11-20-000017-v1.json","preservation":{"repositories":[{"commit":"6621bf2a7779c7fb7cbda04bb7c860d853c5c516","fork_repository":"PalomarArchive/djalilchafai--cutoff-fastdiff--5f4cb94ba48d","source_repository":"djalilchafai/cutoff-fastdiff"}]},"preview":{"artifact_tree_sha256":"6032ae029a2b6a5d3b22e5e7a2bcf3942b897aa09eba21fb6f99d4fca8298bfd","version":1},"published_at":"2026-11-20T15:28:46Z","source":{"commit":"6621bf2a7779c7fb7cbda04bb7c860d853c5c516","project_path":null,"repository":"djalilchafai/cutoff-fastdiff"},"source_omitted":false,"status":"registered","title":"Cutoff phenomenon for fast diffusion and porous medium equations","trust":{"level":"high"},"version":1,"versions":1},{"abbreviated":false,"abstract":"A complete formalisation, in Lean 4 with Mathlib, of the Erdős–Kac theorem: the number of distinct prime factors ω(n), centred by log log N and scaled by sqrt(log log N), satisfies a central limit theorem on {1, …, N}. The proof goes through Mertens' second theorem and a truncated sieve whose moments are compared with an independent-prime model. Moment comparison is carried over to characteristic functions by a Taylor truncation of exp(iτs), whose remainder is controlled by a uniform even-moment bound; the model characteristic function converges to the Gaussian, and Lévy's continuity theorem finishes.","authors":[{"name":"Runming He"}],"classification":{"arxiv":["math.NT","math.PR"],"msc2020":["11K65","60F05"]},"formalization":{"theorem_names":["ErdosKac.erdos_kac"]},"id":"PALOMAR-2026-11-20-000016","path":"entries/PALOMAR-2026-11-20-000016-v1.json","preservation":{"repositories":[{"commit":"60a2004452b6610ea69302b31bf66bd8365ff60e","fork_repository":"PalomarArchive/HeRunming--erdos-kac-lean--73f4a0cd9a63","source_repository":"HeRunming/erdos-kac-lean"}]},"preview":{"artifact_tree_sha256":"15da68935c45c6446b0a67090815f62fc22dc9bbf4d2b6ed0aa963e0823949b9","version":1},"published_at":"2026-11-20T15:09:12Z","source":{"commit":"60a2004452b6610ea69302b31bf66bd8365ff60e","project_path":null,"repository":"HeRunming/erdos-kac-lean"},"source_omitted":false,"status":"registered","title":"Erdős–Kac theorem","trust":{"level":"high"},"version":1,"versions":1},{"abbreviated":false,"abstract":"A Lean 4 and Mathlib formalization of Kasteleyn's method for counting perfect matchings of plane graphs. Graphs are Mathlib simple graphs on a finite vertex type (no loops, no multiple edges); a rotation system is a permutation of the darts that cycles the darts leaving each vertex, its faces are the cycles of the face permutation, and it is plane if the graph is connected and Euler's formula V + F = E + 2 holds. A Kasteleyn orientation with respect to a face f0 is an orientation of the edges in which every face other than f0 has an odd number of clockwise darts. Since faces are cycles of darts, a graph without edges has no faces in this representation; a connected graph without edges is a single vertex, which is not plane in this sense and is treated by a separate theorem. Five theorems are compared: (1) every rotation system of a connected graph with at least one edge has a Kasteleyn orientation with respect to any face f0; (2) for a plane rotation system, a Kasteleyn orientation and edge weights in any commutative ring, the Pfaffian of the signed weighted adjacency matrix (defined by expansion along the first row for a linear order on the vertices) equals, up to a sign +1 or -1, the sum over the perfect matchings of the products of their edge weights; (3) with unit weights the Pfaffian is plus or minus the number of perfect matchings and the determinant of the signed adjacency matrix is its square; (4) one fixed program for an explicit word RAM (unit cost per instruction, natural registers and memory cells bounded by a word bound W along the run) computes a Kasteleyn orientation of every rotation system of a connected graph with at least one edge, with F faces and S darts, given by a standard encoding of 4 + F + 3S words, within 36F + 39S + 27 steps with every natural word at most 4F + 5S + 8; (5) a connected graph without edges has one vertex, no darts and no perfect matching, and the Pfaffian and determinant identities of (2) and (3) hold for it, both sides being 0. The proofs use only the axioms propext, Classical.choice and Quot.sound.","authors":[{"name":"Robert D. Barish"}],"classification":{"arxiv":["math.CO","cs.DS"],"msc2020":["05C70","05C10","05C85","15A15","68Q25"]},"formalization":{"theorem_names":["Kasteleyn.orientation_exists","Kasteleyn.pfaffian_formula","Kasteleyn.matching_count","Kasteleyn.linear_time_orientation","Kasteleyn.edgeless_case"]},"id":"PALOMAR-2026-11-20-000015","path":"entries/PALOMAR-2026-11-20-000015-v1.json","preservation":{"repositories":[{"commit":"e7e967074349944cf909a772218b5fda5c274485","fork_repository":"PalomarArchive/RBarish-UTokyo--Kasteleyn-Pfaffian-WordRAM-Lean4--a380c7938f5a","source_repository":"RBarish-UTokyo/Kasteleyn-Pfaffian-WordRAM-Lean4"}]},"preview":{"artifact_tree_sha256":"774370d8929da3fd665e5276a5dd28e2c00e89fd0b13ce5c9abea9ce142ed41a","version":1},"published_at":"2026-11-20T14:24:47Z","source":{"commit":"e7e967074349944cf909a772218b5fda5c274485","project_path":null,"repository":"RBarish-UTokyo/Kasteleyn-Pfaffian-WordRAM-Lean4"},"source_omitted":false,"status":"registered","title":"Kasteleyn orientations and the Pfaffian method for plane graphs, with a linear-time orientation, in Lean 4","trust":{"level":"high"},"version":1,"versions":1},{"abbreviated":false,"abstract":"Let L be an even unimodular lattice of rank 2k and n a finite index type. The theta series Θ_L(Z) = ∑_{x ∈ Lⁿ} exp(πi tr(G(x)Z)), G(x) the Gram matrix of the tuple x, converges absolutely when Im Z is positive definite, is holomorphic in the entries of Z, is bounded on each region Im Z ≥ c·1, and satisfies Θ_L((AZ + B)(CZ + D)⁻¹) = det(CZ + D)^k Θ_L(Z) for every (A B; C D) in Sp(2n, ℤ) and every Z in the Siegel upper half-space. So Θ_L is a Siegel modular form of degree n and weight k. The transformation law is proved on three kinds of generator. Translations Z ↦ Z + S and the maps Z ↦ UZUᵀ are reindexings of the sum. The inversion Z ↦ −Z⁻¹ is reduced to the inversion formula for a theta series in one variable: for Z = τ·Y with Y real positive definite, Θ_L(Z) is the one-variable theta series of the lattice Lⁿ twisted by a square root of Y, to which TauCeti's inversion formula (Poisson summation) applies; the identity theorem along the path s ↦ s·Re Z + i·Im Z then gives all of the Siegel upper half-space. Finally Sp(2n, ℤ) is generated by the inversion, the translations and the image of GL(n, ℤ).","authors":[{"name":"Richard Morley-Smith"}],"classification":{"arxiv":["math.NT"],"msc2020":["11F46","11F27","11H06"]},"formalization":{"theorem_names":["SiegelTheta.summable_norm","SiegelTheta.differentiableOn","SiegelTheta.map_symplectic","SiegelTheta.bounded"]},"id":"PALOMAR-2026-11-20-000014","path":"entries/PALOMAR-2026-11-20-000014-v1.json","preservation":{"repositories":[{"commit":"9b72660e7c76256c442b52234e99d3c8c3327ae8","fork_repository":"PalomarArchive/rmorleysmith--morley-smith-formal--c62fec5eab58","source_repository":"rmorleysmith/morley-smith-formal"}]},"preview":{"artifact_tree_sha256":"c4d905238e3b8e01d1b57815b95e4bef98e2cf78b2fcd87cf03f471bc88566f3","version":1},"published_at":"2026-11-20T14:16:10Z","source":{"commit":"9b72660e7c76256c442b52234e99d3c8c3327ae8","project_path":"tau-track","repository":"rmorleysmith/morley-smith-formal"},"source_omitted":false,"status":"registered","title":"The theta series of an even unimodular lattice is a Siegel modular form","trust":{"level":"high"},"version":1,"versions":1},{"abbreviated":false,"abstract":"A rhombic monohedral polyhedron of spherical type (surface homeomorphic to a sphere, adjacent faces not coplanar) with exactly 30 faces, all of them congruent rhombi whose diagonals are in the golden ratio, in which every zone has exactly 10 faces, and whose translates by a lattice tile space face to face. This gives an example for k = 10 for the question of B. Grunbaum (Math. Intelligencer 32(4), 2010): \"Given an even integer k >= 4, is there a rhombic monohedral parallelohedron such that every zone has exactly k faces?\", where he wrote that \"no information is available for any k >= 10\". The witness is DICTO's Grunbaum-Escher Triacontahedron GET B: the rhombic triacontahedron less four oblate golden rhombohedra, a union of 16 golden rhombohedra (its exact model also has 32 vertices and 60 edges; these counts are properties of the witness, checked in the model, not part of the theorem). Two calibration theorems check that the zone definition gives 4 for the cube and 6 for the rhombic dodecahedron. Earlier solids of the same family (the rhombic triacontahedron with four corners indented) were shown on the web as space-fillers, without proof, without zone sizes and without reference to Grunbaum's question: by D. Hall (Sketchfab, 2016; the same solid as G. Inchbald's dimpled rhombic triacontahedron, by 2023) and by J. Kostick (vZome, 2022), whose concavo-convex triacon array shows GET A, a sibling of GET B. So this entry does not claim the first example for k = 10. GET B itself was not found in the sources checked. Since GET B is an indentation of the triacontahedron and is proved here to be a parallelohedron, it is also a counterexample to Grunbaum's tentative remark (same paper) that \"none of the other isozonohedra obtainable by indentation of F or T seem to be parallelohedra\". The proof checks exact data in Z[phi] by kernel evaluation (zones, congruence, separating normals, contacts, face matching, cone separation from an interior point) and derives the tiling from volume = covolume with Mathlib's fundamental domains. The entry is meant for researchers on parallelohedra and space-filling polyhedra (nonconvex parallelohedra, Venkov-McMullen belt theory) and on golden-rhombohedron polyhedra.","authors":[{"name":"DICTO"}],"classification":{"arxiv":["math.MG","math.CO"],"msc2020":["52C22","52B10","52C07","03B35"]},"formalization":{"theorem_names":["GrunbaumK10.cube_everyZoneHas","GrunbaumK10.rhombicDodecahedron_everyZoneHas","GrunbaumK10.grunbaum_k10","GrunbaumK10.grunbaum_k10_parallelohedron"]},"id":"PALOMAR-2026-11-20-000013","path":"entries/PALOMAR-2026-11-20-000013-v1.json","preservation":{"repositories":[{"commit":"a6b16c25d80fa90ea28259bad6a53d7e81d01779","fork_repository":"PalomarArchive/DICTOR-Master--grunbaum-k10-lean--952a56f0689a","source_repository":"DICTOR-Master/grunbaum-k10-lean"}]},"preview":{"artifact_tree_sha256":"f29f8d3aa5980a3c068160526d97bf361151722bf14b0d618492e74d70f22bb1","version":1},"published_at":"2026-11-20T13:37:38Z","source":{"commit":"a6b16c25d80fa90ea28259bad6a53d7e81d01779","project_path":null,"repository":"DICTOR-Master/grunbaum-k10-lean"},"source_omitted":false,"status":"registered","title":"Grünbaum's zone question at k = 10","trust":{"level":"high"},"version":1,"versions":1},{"abbreviated":false,"abstract":"A clearinghouse observes a market with n firms and n+1 workers and can choose any stable assignment. Both sides draw independent rate-one exponential utilities for every firm-worker pair. Changing partners costs log(n)/(6 sqrt(n)). Write δ = 1/400000. As n grows, with probability tending to one, every stable assignment gives the matched workers a mean partner rank greater than n^(1/2+δ) and a mean utility less than (1/2−δ) log(n). Rank one is best. Consequently, even a clearinghouse that chooses separately for each objective cannot deliver mean partner ranks at the square-root benchmark on both sides, or mean utilities at the half-log benchmark on both sides. A working paper on these results is forthcoming.","authors":[{"name":"Bo Cowgill"}],"classification":{"arxiv":["econ.TH","math.PR"],"msc2020":["91B68","60C05"]},"formalization":{"theorem_names":["WorkerCompromise.allStableWorkerBounds_tendsto_one","WorkerCompromise.optimalCompromises_tendsto_one"]},"id":"PALOMAR-2026-11-20-000012","path":"entries/PALOMAR-2026-11-20-000012-v1.json","preservation":{"repositories":[{"commit":"2c377b62b66f79ae9bbf127af1ec5ab0b2ea5468","fork_repository":"PalomarArchive/bocowgill--worker-compromise--eaf91798b9a2","source_repository":"bocowgill/worker-compromise"}]},"preview":{"artifact_tree_sha256":"304f67fbdfcdeb0f960a36e85a241be0a612bd8dfb8606002afe6c92fa151c07","version":1},"published_at":"2026-11-20T13:23:54Z","source":{"commit":"2c377b62b66f79ae9bbf127af1ec5ab0b2ea5468","project_path":null,"repository":"bocowgill/worker-compromise"},"source_omitted":false,"status":"registered","title":"One extra worker rules out the square-root welfare compromise","trust":{"level":"high"},"version":1,"versions":1},{"abbreviated":false,"abstract":"For n = 1, …, 8: the least radius of a closed disk holding n unit squares with disjoint interiors, each placed and rotated freely, and every packing that attains it. The radii are √2/2, √5/2, 5√17/16, √2, √(5/2), √q₆ ≈ 1.68854, √13/2 and R₈ ≈ 1.97877, where q₆ is a quartic irrational and R₈ the least radius of a disk about the origin holding five corners with prescribed gaps between them. Up to rotation about the disk centre and relabelling, the optimal packing is unique for n ≤ 6: the square, the 2 × 1 rectangle, the T, the 2 × 2 block, the plus, and for six squares a central square with four neighbours, two of them pushed along its sides, and a sixth square turned by π/4 between those two. For n = 7 the optimal packings form a three-parameter family: two columns of two squares and, between them, a column of three whose heights vary independently, at least 1 apart and within √3 − 1/2 of the disk centre. For n = 8 they form a five-parameter family, with its reflections: five squares have a corner on the circle, two slide, and the central square moves and turns. The proofs for three to six squares bound the arcs the squares occupy on a small circle about the disk centre. For six squares this finds the square that contains the disk centre; five fixed points label the others, and a weighted sum of separating inequalities, with estimates uniform in the angles of the squares, forces the optimal radius. For seven squares, each square avoiding the disk centre gets a direction from it, and in the optimal disk two disjoint such squares get directions at least π/3 apart. For eight squares a central square is found, checked pair, affine and owner tables capture the frames of the seven exterior squares near the stationary configuration, and a completion of squares with the weights of the stationary packing forces the optimal radius. Lean verifies the table bounds and their coverage. The public radius and optimal family retain their geometric five-corner description, proved equivalent to the stationary description used by the tables. The table-free case analysis is deprecated and is absent from the active library. We found no earlier proof for five, six, seven or eight squares, and no exact one for three, where a computer-assisted enclosure of the radius and the optimal arrangements was known. Four squares, uniqueness included, were settled by hand in 2026, by the same idea as here.","authors":[{"name":"The-Anh Vu-Le"}],"classification":{"arxiv":["math.MG"],"msc2020":["52C15"]},"formalization":{"theorem_names":["SquaresInCircles.optimal_radius","SquaresInCircles.optimal_packings"]},"id":"PALOMAR-2026-10-02-000002","path":"entries/PALOMAR-2026-10-02-000002-v2.json","preservation":{"repositories":[{"commit":"d330fa3256eaf0dd6149917b71b9d5561d7ca9c0","fork_repository":"PalomarArchive/vltanh--lean4-squares-in-circles--0ba28607e811","source_repository":"vltanh/lean4-squares-in-circles"}]},"preview":{"artifact_tree_sha256":"fec2b1a6e61895e82a3bc9788255d31ffb4a0c497d1271b284696e0a065b8941","version":2},"published_at":"2026-11-20T12:27:14Z","source":{"commit":"d330fa3256eaf0dd6149917b71b9d5561d7ca9c0","project_path":null,"repository":"vltanh/lean4-squares-in-circles"},"source_omitted":false,"status":"registered","title":"Optimal packings of one to eight unit squares in a disk","trust":{"level":"high"},"version":2,"versions":2},{"abbreviated":false,"abstract":"We prove the Lennon–Pittel conjecture for balanced stable marriage with independent, uniform strict preferences. Let S_n count the stable complete matchings between two sides of size n. For every positive nonincreasing sequence epsilon_n tending to zero, the probability that S_n is at least epsilon_n times its expectation tends to one. This gives a lower-tail estimate at the scale of Pittel's first-moment asymptotic. An accompanying working paper is in preparation.","authors":[{"name":"Bo Cowgill"}],"classification":{"arxiv":["math.CO","math.PR"],"msc2020":["05C70","60C05"]},"formalization":{"theorem_names":["LennonPittel.lennon_pittel_conjecture"]},"id":"PALOMAR-2026-11-07-000001","path":"entries/PALOMAR-2026-11-07-000001-v3.json","preservation":{"repositories":[{"commit":"cf950d0596591bba912b1568aa394f99986f8191","fork_repository":"PalomarArchive/bocowgill--lennon-pittel--98843913db2b","source_repository":"bocowgill/lennon-pittel"}]},"preview":{"artifact_tree_sha256":"5617331d7a78282e3c6baf3de0e21ebd795b981c847fbc6b04ee428c9917cfda","version":3},"published_at":"2026-11-20T12:19:29Z","source":{"commit":"cf950d0596591bba912b1568aa394f99986f8191","project_path":null,"repository":"bocowgill/lennon-pittel"},"source_omitted":false,"status":"registered","title":"The Lennon–Pittel conjecture on random stable matchings","trust":{"level":"high"},"version":3,"versions":3},{"abbreviated":false,"abstract":"Nine isosceles triangles with a common axis in a circle of diameter 1 that meet Huet's conditions in Chiodo's form (the two great triangles inscribed, seven apexes on bases, the 18 marmas and the 6 corner touches), Kulaichev's four conditions (a)-(d) and the admissibility of DICTO's paper #103 (Theorem 1) form exactly one figure (identified with the yantra of #103 Theorem 10 through the slope interval). Its slope w7/b7 is proved to lie in an interval of width 2^-21, [0.7504382776..., 0.7504387544...]; #103 gives the slope as 0.7504385160222140244..., a value computed outside Lean that lies in this interval. This settles Kulaichev's 1984 uniqueness question for admissible (well-formed) figures. The proof combines a kernel-checked branch-and-bound interval certificate (64,613 boxes in 10 charts, with proved monotone-split and slope enclosures), a Krawczyk box (uniqueness by a contraction, existence by Banach's fixed-point theorem), the forced construction from the geometry, and a verified sparse-polynomial normaliser for the identities between them. Not formalised: DICTO's study (outside Lean) finds one other real solution of the same equations, at w7/b7 = 0.66866..., which is not admissible (bases out of order, two negative half-widths), so it is not a yantra. Audiences: the history of mathematics (Kulaichev's question in the Indian Journal of History of Science, called still open in 2021), sacred geometry (the construction of the Sri Yantra), and computer-assisted proof in geometry (a certified interval computation checked by Lean's kernel).","authors":[{"name":"DICTO"}],"classification":{"arxiv":["math.MG","math.HO"],"msc2020":["51M04","51M15","65G20","01A32","03B35"]},"formalization":{"theorem_names":["KulaichevYantra.kulaichev_unique","KulaichevYantra.kulaichev_slope"]},"id":"PALOMAR-2026-11-17-000006","path":"entries/PALOMAR-2026-11-17-000006-v2.json","preservation":{"repositories":[{"commit":"6bf9e0401c673ccf1030794493650331b7962b25","fork_repository":"PalomarArchive/DICTOR-Master--kulaichev-yantra-lean--77426e05c719","source_repository":"DICTOR-Master/kulaichev-yantra-lean"}]},"preview":{"artifact_tree_sha256":"33aa056731367e58b9609eba046a7e6f8be034ab37171591cf9520ef81d16f14","version":2},"published_at":"2026-11-20T12:09:12Z","source":{"commit":"6bf9e0401c673ccf1030794493650331b7962b25","project_path":null,"repository":"DICTOR-Master/kulaichev-yantra-lean"},"source_omitted":false,"status":"registered","title":"Kulaichev's Sri Yantra is unique","trust":{"level":"high"},"version":2,"versions":2},{"abbreviated":false,"abstract":"A self-contained, zero-Mathlib Lean 4 formalization of the Combinatorial Four Color Theorem: every finite, complete, Euler-planar, bridgeless orientable combinatorial map (involutive hypermap, `e^2 = id`, `e ∘ n ∘ f = id`) admits a proper 4-coloring of its faces (`Solution.four_color_theorem`). Follows the published mathematics of Robertson, Sanders, Seymour, and Thomas (1996/1997) and Gonthier's hypermap framework (2008), verifying all 633 unavoidable configurations (249 D-reducible and 384 C-reducible) and all 5 cartwheel discharging trees directly inside the Lean kernel without `native_decide`.","authors":[{"name":"Harry Wang"}],"classification":{"arxiv":["math.CO","cs.LO"],"msc2020":["05C15","05C10","68V15"]},"formalization":{"theorem_names":["four_color_theorem"]},"id":"PALOMAR-2026-11-20-000011","path":"entries/PALOMAR-2026-11-20-000011-v1.json","preservation":{"repositories":[{"commit":"5827daedcf71c0f9992a29fda7ecb4c588d3a6b2","fork_repository":"PalomarArchive/Harry-Tech-Guide--Lean-4-Four-Color-Theorem-Formalization--4648e6306059","source_repository":"Harry-Tech-Guide/Lean-4-Four-Color-Theorem-Formalization"}]},"preview":{"artifact_tree_sha256":"8de47d45938bba8e2f5f1fec9b5297b7ca5b72fe46c1ae006f7f977c0c4745d3","version":1},"published_at":"2026-11-20T11:37:13Z","source":{"commit":"5827daedcf71c0f9992a29fda7ecb4c588d3a6b2","project_path":null,"repository":"Harry-Tech-Guide/Lean-4-Four-Color-Theorem-Formalization"},"source_omitted":false,"status":"registered","title":"The Combinatorial Four Color Theorem in Lean 4","trust":{"level":"high"},"version":1,"versions":1},{"abbreviated":false,"abstract":"Every integer polynomial with all coefficients odd that differs from both signs of its reverse has multiplicative Mahler measure at least (1 + √5)/2. The polynomial x² − x − 1 meets all these hypotheses and attains the bound.","authors":[{"name":"Stephanie Alexander"}],"classification":{"arxiv":["math.NT"],"msc2020":["11R09","11C08"]},"formalization":{"theorem_names":["GoldenMahlerEntry.odd_mahler_bound","GoldenMahlerEntry.golden_quadratic_attains"]},"id":"PALOMAR-2026-11-20-000010","path":"entries/PALOMAR-2026-11-20-000010-v1.json","preservation":{"repositories":[{"commit":"a433fcc7d66394587f5d66347178dbe172a1e787","fork_repository":"PalomarArchive/stalex444--golden-mahler-bound-odd--7f68a210afb1","source_repository":"stalex444/golden-mahler-bound-odd"}]},"preview":{"artifact_tree_sha256":"4811d339a4e9cfeb4c3f0c6c74b90bc6b722c9530864a13517b8cec94f685836","version":1},"published_at":"2026-11-20T10:18:00Z","source":{"commit":"a433fcc7d66394587f5d66347178dbe172a1e787","project_path":null,"repository":"stalex444/golden-mahler-bound-odd"},"source_omitted":false,"status":"registered","title":"The Golden Ratio as the Sharp Mahler Bound for Nonreciprocal Polynomials with Odd Coefficients","trust":{"level":"high"},"version":1,"versions":1},{"abbreviated":false,"abstract":"Lean 4 / Mathlib formalization of an article on Davison's mosaic spaces and three questions recorded by Lavallee (1964). Formalized: every theorem, lemma, proposition and corollary of Sections 2, 4, 6 and 7 and the classical facts they use (abstract Definition 2.1 and its equivalence with the intrinsic definition; the arc theorem; compact locally connected metrizable spaces are locally path connected; Proposition 2.10 on path-determined spaces), the space G (Tychonoff, locally arcwise connected, not a quasi-curve space), the cone construction, boundary bumping (Lemma 5.2), and the answers to all three questions: Q3 by G, Q2 and Q1a/Q1b by the cone over G. Not formalized (examples, excluded by the author's request): Section 3 and the Appendix (the space E(K)), van Douwen's space in Section 5, Example 7.3 (cZ) and the strictness claims of Theorem 7.4 that use them; also the Hahn-Mazurkiewicz theorem, which no formalized result needs.","authors":[{"name":"Lucas Alves de Almeida"}],"classification":{"arxiv":["math.GN"],"msc2020":["54D55","54D05","54F15","54G20"]},"formalization":{"theorem_names":["MosaicSpaces.Paper.prop_2_3_t1","MosaicSpaces.Paper.lemma_2_4","MosaicSpaces.Paper.cor_2_6_union","MosaicSpaces.Paper.prop_2_7","MosaicSpaces.Paper.prop_2_7_t2","MosaicSpaces.Paper.prop_2_7_open","MosaicSpaces.Paper.lemma_2_8","MosaicSpaces.Paper.cor_2_9_1","MosaicSpaces.Paper.cor_2_9_2","MosaicSpaces.Paper.cor_2_9_2_path","MosaicSpaces.Paper.cor_2_9_qc","MosaicSpaces.Paper.display_2_1","MosaicSpaces.Paper.arc_theorem","MosaicSpaces.Paper.cor_2_6_2_arc","MosaicSpaces.Paper.display_2_1_iff","MosaicSpaces.Paper.prop_2_12","MosaicSpaces.Paper.prop_2_13","MosaicSpaces.Paper.lemma_2_14","MosaicSpaces.Paper.def_2_1_mosaic","MosaicSpaces.Paper.def_2_1_mContinuum","MosaicSpaces.Paper.def_2_1_quasiCurve","MosaicSpaces.Paper.def_2_1_curve","MosaicSpaces.Paper.lemma_2_2","MosaicSpaces.Paper.prop_2_3_1","MosaicSpaces.Paper.cor_2_9_2_full","MosaicSpaces.Paper.prop_2_10","MosaicSpaces.Paper.lemma_2_14_article","MosaicSpaces.Paper.cor_2_15","MosaicSpaces.Paper.compact_locallyConnected_lpc","MosaicSpaces.Paper.peano_classical","MosaicSpaces.Paper.quasiPeano_components","MosaicSpaces.Paper.lemma_2_2_closed","MosaicSpaces.Paper.lemma_2_2_finite","MosaicSpaces.Paper.prop_2_3_3","MosaicSpaces.Paper.prop_2_3_456","MosaicSpaces.Paper.remark_2_5","MosaicSpaces.Paper.cor_2_6_2","MosaicSpaces.Paper.cor_2_6_3","MosaicSpaces.Paper.prop_2_10_quotient","MosaicSpaces.Paper.remark_3_7","MosaicSpaces.Paper.exists_madFamily","MosaicSpaces.Paper.theorem_4_11","MosaicSpaces.Paper.answer_Q3","MosaicSpaces.Paper.fan_metric","MosaicSpaces.Paper.sec_5_1_translation","MosaicSpaces.Paper.lemma_5_2","MosaicSpaces.Paper.lemma_6_1","MosaicSpaces.Paper.theorem_6_3_1","MosaicSpaces.Paper.theorem_6_3_2","MosaicSpaces.Paper.theorem_6_3_3","MosaicSpaces.Paper.theorem_6_3_5","MosaicSpaces.Paper.answer_Q2","MosaicSpaces.Paper.answer_Q1b","MosaicSpaces.Paper.answer_Q1a","MosaicSpaces.Paper.theorem_6_3_4","MosaicSpaces.Paper.prop_6_2_1","MosaicSpaces.Paper.prop_6_2_2","MosaicSpaces.Paper.prop_6_2_3","MosaicSpaces.Paper.theorem_6_3_5_sep","MosaicSpaces.Paper.prop_7_1","MosaicSpaces.Paper.prop_7_2_path","MosaicSpaces.Paper.prop_7_2","MosaicSpaces.Paper.theorem_7_4_impl","MosaicSpaces.Paper.theorem_7_4_strict_H_LmS","MosaicSpaces.Paper.theorem_7_4_firstCountable","MosaicSpaces.Paper.theorem_7_4_lac","MosaicSpaces.Paper.theorem_7_4_firstCountable_lac","MosaicSpaces.Paper.prop_7_1_tail","MosaicSpaces.Paper.prop_7_2_tail","MosaicSpaces.Paper.theorem_7_4_strict_LAC_H"]},"id":"PALOMAR-2026-11-20-000009","path":"entries/PALOMAR-2026-11-20-000009-v1.json","preservation":{"repositories":[{"commit":"50374003b6d9eeb772e93000bba84937845c6a69","fork_repository":"PalomarArchive/LucasAlves8Sp--Mosaic-spaces--33c8bc4c873b","source_repository":"LucasAlves8Sp/Mosaic-spaces"}]},"preview":{"artifact_tree_sha256":"dfdaa14d4fe33aeaabdea9b0b0cca5b1dc5e0a4bf67ae0d81885e93816f140bb","version":1},"published_at":"2026-11-20T06:21:21Z","source":{"commit":"50374003b6d9eeb772e93000bba84937845c6a69","project_path":null,"repository":"LucasAlves8Sp/Mosaic-spaces"},"source_omitted":false,"status":"registered","title":"Mosaic spaces generated by continua and by Peano continua","trust":{"level":"high"},"version":1,"versions":1},{"abbreviated":false,"abstract":"Normalized Latin systems of every order m at least five have three-sunlet image dimension 5m-4 in every characteristic, including the original finite abelian-group coordinates. Two transitive derangement families give the stated dimension 3m+2c-2. Complex generic fibers have unique unordered toric decomposition, normalized degree twice the square of the loop abelianization order, and the character-wreath Galois group. The model is rational over Q. Prime nonassociative loops give precisely two normalized general preimages; cyclic models of every order at least six admit rational reconstruction from the literal 8m-12 retained coordinates. Orbit and inverse-stable partition identifications have the complete dimension classification, which yields the full binary level-one network formula including triangles and two leaves.","authors":[{"name":"Caius Folkerts"}],"classification":{"arxiv":["math.AG","math.ST"],"msc2020":["14M25","62R01"]},"formalization":{"theorem_names":["Sunlet.paper_theorem_1_1","Sunlet.GroupCoordinates.paper_theorem_1_1_original_coordinates","Sunlet.paper_theorem_2_3_literal","Sunlet.ComplexPaper.generic_unique_unordered_decomposition","Sunlet.ComplexPaper.normalized_generic_degree","Sunlet.ComplexPaper.normalized_isGalois","Sunlet.ComplexPaper.paper_theorem_4_2_algebraic_fibers","Sunlet.NormalizedLatinSystem.model_rational","Sunlet.ComplexPaper.paper_corollary_5_1_point_ambiguity","Sunlet.ComplexPaper.paper_corollary_5_1_degree","Sunlet.CyclicSelectedField.paper_theorem_6_1_all_orders","Sunlet.OrbitClasses.paper_theorem_7_1","Sunlet.OrbitHeight.inverse_stable_original_coordinates_order_free","Sunlet.OrbitClasses.paper_corollary_7_4","Sunlet.NetworkTheorem.paper_corollary_8_1_leaf_cut","Sunlet.NetworkTheorem.paper_corollary_8_1_unrestricted_leaf_cut","Sunlet.addTranslationPerm_apply","Sunlet.ToricPairAlgebra.genericVariable_ne_zero","Sunlet.ToricPairAlgebra.embeddedTorus_base","Sunlet.CyclicSparseWitness.shift_ne_zero","Sunlet.NormalizedLatinSystem.generic_normalized_equation_iff","PolynomialImage.rational_form_of_mem","Sunlet.CyclicSelectedField.observedNormalizedField_eq_modelImageField","Sunlet.palomarSixNeZero","Sunlet.palomarNeZeroOfFiveLe","Sunlet.palomarNeZeroOfSixLe","Sunlet.palomarTranslationLeft","Sunlet.palomarTranslationRight","Sunlet.ToricPairAlgebra.palomarPolynomialIsDomain","Sunlet.CyclicSelectedField.palomarNormalizedEquation","Sunlet.GroupCoordinates.palomarTranslationNormalized","Sunlet.GroupCoordinates.palomarTranslationColumnBijective"]},"id":"PALOMAR-2026-11-20-000008","path":"entries/PALOMAR-2026-11-20-000008-v1.json","preservation":{"repositories":[{"commit":"b1fff7af3ee3758645529514c7bfb343bc0cf04c","fork_repository":"PalomarArchive/caiusdfolkerts--research--cbb88952250b","source_repository":"caiusdfolkerts/research"}]},"preview":{"artifact_tree_sha256":"01271b06be9e1b2c66e47132357000d09c525ff760dc40f459caa7085dd1985b","version":1},"published_at":"2026-11-20T06:10:40Z","source":{"commit":"b1fff7af3ee3758645529514c7bfb343bc0cf04c","project_path":"three_sunlet_models","repository":"caiusdfolkerts/research"},"source_omitted":false,"status":"registered","title":"Dimension and identifiability of three-sunlet models","trust":{"level":"high"},"version":1,"versions":1},{"abbreviated":false,"abstract":"Principal path construction and simultaneous sharp bounds; exact 3-tree, clique-book, multipartite and lattice classifications. It also constructs, for every n ≥ 10, K5-free graphs of treewidth four with 3n − 5 edges supporting full-dimensional lattice indecomposable polytopal summands; no proper edge-subgraph supports a full-dimensional indecomposable polytopal weak summand.","authors":[{"name":"Caius Folkerts"}],"classification":{"arxiv":["math.CO","math.MG"],"msc2020":["52B11","52B12","05C10"]},"formalization":{"theorem_names":["PalomarGraphicalMain.direction_bounds_polytopal","PalomarGraphicalMain.threeTree_classification_polytopal","PalomarGraphicalMain.admissible_threeTree_lattice_witness","PalomarGraphicalMain.PathResults.principal_path_theorem","PalomarGraphicalMain.clique_book_classification","PalomarGraphicalMain.SaturatedDirections.paper_theorem_7_12","PalomarGraphicalMain.DiamondBook.paper_theorem_8_1","PalomarGraphicalMain.SparseFamily.paper_theorem_8_2_polytopal","PalomarGraphicalMain.TwoHub.two_singleton_classification","PalomarGraphicalMain.four_partite_spanning_threeTrees","PalomarGraphicalMain.threeTree_lattice_dilation","PalomarGraphicalMain.unit_lattice_classification","PalomarGraphicalMain.optimal_k5_free_dilation","PalomarGraphicalMain.DoubledParts.principal_boolean_phase_theorem","PalomarGraphicalMain.zeta_injective","PalomarGraphicalMain.actualRootEdge_symm","PalomarGraphicalMain.zeta_add","PalomarGraphicalMain.zeta_smul"]},"id":"PALOMAR-2026-11-20-000007","path":"entries/PALOMAR-2026-11-20-000007-v1.json","preservation":{"repositories":[{"commit":"2505d4b11cf6f2c7d34e58ff830b8ff71c3fb3d9","fork_repository":"PalomarArchive/caiusdfolkerts--research--cbb88952250b","source_repository":"caiusdfolkerts/research"}]},"preview":{"artifact_tree_sha256":"4472971e6bf1704ca6acb51ae7bceba0a79019feed8d3e9f1ab39fdbc8c7dd2d","version":1},"published_at":"2026-11-20T05:25:25Z","source":{"commit":"2505d4b11cf6f2c7d34e58ff830b8ff71c3fb3d9","project_path":"graphical_zonotopes_main_clean_status","repository":"caiusdfolkerts/research"},"source_omitted":false,"status":"registered","title":"Sharp bounds for indecomposable graphical-zonotope summands: main","trust":{"level":"high"},"version":1,"versions":1},{"abbreviated":false,"abstract":"The Heilbronn number H_n of the unit square is the largest possible least area of a triangle with vertices at three of n points in the closed unit square. This entry proves H₉ = (9√65 − 55)/320 ≈ 0.0548760, and that it is attained only by the configuration of Comellas and Yebra (2002), with two points on each side of the square and one inside, up to the eight symmetries of the square and relabelling.\n\nThe proof normalizes a maximizing configuration by affine maps into five families, by the corners of the square it occupies, and excludes or classifies each family by geometric case analysis, sharp inequalities in the chamber of eleven tight triangles, strict local optimality, and polynomial certificates checked by Lean's kernel, about 434,000 weighted terms in all. We found no exact proof of H₉ before this one: a branch and bound had bounded it in an interval, and mixed-integer optimization had found it within solver tolerances (a preprint that claimed a proof in March 2026 withdrew the claim). The repository treats each number of points as a separate entry; nine points is the first.","authors":[{"name":"The-Anh Vu-Le"}],"classification":{"arxiv":["math.MG","math.CO"],"msc2020":["52C10","52A40"]},"formalization":{"theorem_names":["Heilbronn.Nine.optimal_value","Heilbronn.Nine.heilbronn_number","Heilbronn.Nine.optimal_configurations"]},"id":"PALOMAR-2026-11-20-000006","path":"entries/PALOMAR-2026-11-20-000006-v1.json","preservation":{"repositories":[{"commit":"a405d9b79c16eb34dc1c199b765d69231c7d17cf","fork_repository":"PalomarArchive/vltanh--lean4-heilbronn--0daea5201695","source_repository":"vltanh/lean4-heilbronn"}]},"preview":{"artifact_tree_sha256":"3ed1aa64e97ea3295bc44b2ec78612d8a0c00a1bcadd4c4c5cf7ec7df714e2d0","version":1},"published_at":"2026-11-20T05:18:47Z","source":{"commit":"a405d9b79c16eb34dc1c199b765d69231c7d17cf","project_path":null,"repository":"vltanh/lean4-heilbronn"},"source_omitted":false,"status":"registered","title":"Heilbronn's triangle problem in the unit square: nine points","trust":{"level":"high"},"version":1,"versions":1},{"abbreviated":false,"abstract":"The principal results of the included paper characterize volume-polynomial realizability. In dimension d at least three the n-body coefficient locus is semialgebraic exactly for n at most two; the entry includes the polytope clause, forced nonsemialgebraic shapes, and the countable rational quadratic characterization with strict separation, finite certificates, rejection termination and rational polytope reconstruction.","authors":[{"name":"Caius Folkerts"}],"classification":{"arxiv":["math.MG"],"msc2020":["52A38","14P10"]},"formalization":{"theorem_names":["PalomarVolumePolynomials.semialgebraicity_iff","PalomarVolumePolynomials.polytope_locus_not_semialgebraic","PalomarVolumePolynomials.shape_forcing","PalomarVolumePolynomials.countable_characterization","PalomarVolumePolynomials.nonrealizable_strict_inequality","PalomarVolumePolynomials.finite_rational_certificate","PalomarVolumePolynomials.rational_rejection_terminates","PalomarVolumePolynomials.rational_polytope_reconstruction","VolumePolynomials.positive_nhds_le_cofinite","VolumePolynomials.polynomial_evaluation_germ_isUnit","VolumePolynomials.RationalHulls.realPoint_zero","VolumePolynomials.RationalHulls.vertices_finite","VolumePolynomials.ShapeConditions.palomarBodyAIndexBound","VolumePolynomials.ShapeConditions.palomarAssignmentIndexBound"]},"id":"PALOMAR-2026-11-20-000005","path":"entries/PALOMAR-2026-11-20-000005-v1.json","preservation":{"repositories":[{"commit":"32e9521931df4ceeb91fcc382f71fc05240998f8","fork_repository":"PalomarArchive/caiusdfolkerts--research--cbb88952250b","source_repository":"caiusdfolkerts/research"}]},"preview":{"artifact_tree_sha256":"06ed95360dda5a4963e0b16894a1668a01f7c992c8ee1360182f056f8c7265d0","version":1},"published_at":"2026-11-20T05:10:09Z","source":{"commit":"32e9521931df4ceeb91fcc382f71fc05240998f8","project_path":"volume_polynomials_status","repository":"caiusdfolkerts/research"},"source_omitted":false,"status":"registered","title":"Volume polynomials and the Heine–Shephard problem","trust":{"level":"high"},"version":1,"versions":1},{"abbreviated":false,"abstract":"The principal results and substantive corollaries of the included paper on coordinate projection areas: rank-three nonapproximation despite realizable four-coordinate restrictions, compatibility of boundary quartets, escape-cone and closure identities, strict realization by centrally symmetric polytopes with the actual vertex bound, weighted obstructions, open nonrealizable families, and the nonnegative rank-at-most-three classification.","authors":[{"name":"Caius Folkerts"}],"classification":{"arxiv":["math.MG"],"msc2020":["52A20","52A38"]},"formalization":{"theorem_names":["PalomarProjectionAreas.positive_rank_three_obstruction","PalomarProjectionAreas.positive_rank_le_three_not_realizable","PalomarProjectionAreas.escapeCone_eq_divergingDiameterLimits","PalomarProjectionAreas.closure_realizationLocus_eq_union_escapeCone","PalomarProjectionAreas.mem_escapeCone_iff_exists_full_dimensional_symmetric_sequence","PalomarProjectionAreas.escapeCone_isClosed","PalomarProjectionAreas.strict_weighted_realization_with_vertex_bound","PalomarProjectionAreas.strict_nonnegative_weighted_realization_with_vertex_bound","PalomarProjectionAreas.boundary_quartets_bound_sharp","PalomarProjectionAreas.boundary_quartets_unique_extension","PalomarProjectionAreas.selected_boundary_quartets_card_le_three","PalomarProjectionAreas.selected_boundary_quartets_unique_extension","PalomarProjectionAreas.exists_open_nonrealizable_strict_quartets","PalomarProjectionAreas.weighted_triangles_obstruction","PalomarProjectionAreas.rank_at_most_three_classification","PalomarProjectionAreas.NumericProofs.twoNeZero","PalomarProjectionAreas.NumericProofs.twoAtLeastTwo","PalomarProjectionAreas.NumericProofs.fourNeZero"]},"id":"PALOMAR-2026-11-20-000004","path":"entries/PALOMAR-2026-11-20-000004-v1.json","preservation":{"repositories":[{"commit":"e325c4e4b1b4e75f269bb3ff000affd374287c8d","fork_repository":"PalomarArchive/caiusdfolkerts--research--cbb88952250b","source_repository":"caiusdfolkerts/research"}]},"preview":{"artifact_tree_sha256":"a12d2b35512bd80d4656fc97152b4b4bbc1aff445cf00c42ac9d334bb9bc4946","version":1},"published_at":"2026-11-20T04:35:26Z","source":{"commit":"e325c4e4b1b4e75f269bb3ff000affd374287c8d","project_path":"projection_areas_status","repository":"caiusdfolkerts/research"},"source_omitted":false,"status":"registered","title":"Compatibility and realization of coordinate projection areas","trust":{"level":"high"},"version":1,"versions":1}],"previous":null,"next":"eyJyZXZpc2lvbiI6MTA2MiwicXVlcnkiOiJkYWM0MmMwNjU1ZDNkY2MwZWVjNzFhNTg5ZjQ3MzAzYjk5NDQyZjdmNGJlMGNkYjc0ZGI5ZWM4MmQ3ZDdlYzc1IiwiZGlyZWN0aW9uIjoibmV4dCIsImRhdGUiOiIyMDI2LTExLTIwVDA0OjM1OjI2WiIsImlkIjoiUEFMT01BUi0yMDI2LTExLTIwLTAwMDAwNCJ9","dropped":[],"message":null}