{"assessment":{"class":"Start","importance":"high"},"audit":{"blind":true,"ended":"2026-11-03T02:10:43.537Z","figures":[{"ci95":[0.4891,0.9935],"drawn":36,"id":"primary","label":"Strong links (exact, close or broad match) on supporting passages that have exactly the right relation","n_eff":5.1,"population":1029,"share":0.9234,"weights":"relation and library"},{"ci95":[0.3979,0.9202],"drawn":48,"id":"S2","label":"Links in a counting relation (exact, close, broad, narrow match or part) on supporting passages that have exactly the right relation","n_eff":8.1,"population":1740,"share":0.734,"weights":"relation and library"},{"ci95":[0.7268,0.9357],"drawn":44,"id":"CS","label":"Central and subject passages whose formalization status is right","n_eff":42.0,"population":1905,"share":0.8615,"weights":"recorded status"},{"ci95":[0.2519,0.8658],"drawn":12,"id":"S3","label":"'Not formalized' on supporting passages that is right (no declaration in the 48 libraries states it)","n_eff":6.1,"population":1236,"share":0.5957,"weights":"article"}],"independent":false,"items":224,"models":[{"model":"claude-opus-5-5","model_name":"Claude Opus 5.5"}],"operator":"jack","run_id":"tierA-batch1-audit","started":"2026-11-02T21:10:01.351Z"},"campaign":"run:loc-tierA-b1b+chal-tierA-b1","licence":{"mapping":"CC0-1.0","text":"CC-BY-SA-4.0"},"pageid":1458875,"passages":[{"absence":null,"basis":null,"coverage":null,"id":"enwiki-1458875-1343796790::In-text #d9073911","item":"In-text #d9073911","kind":"definition","locations":[],"outcome":"unresolved","passage_ends_in_suffix":false,"passage_key":"ea04ab7d8f763170af568c42810ec7a38ff9346b29e769711021eff4e4bc4b7e","prominence":"subject","quote":{"exact":"In mathematics, a rigid collection C of mathematical objects c (for instance"},"quote_capped":true,"section":[],"status":null,"subject_uri":"https://en.wikipedia.org/w/index.php?curid=1458875&oldid=1343796790","text":{"layer":"In mathematics, a rigid collection C of mathematical objects c (for instance sets or functions) is one in which every c ∈ C is uniquely determined by less information about c than one would expect.","segments":[{"text":"In mathematics, a rigid collection C of mathematical objects c (for instance sets or functions) is one in which every c ∈ C is uniquely determined by less information about c than one would expect."}]},"unresolved":{"challenge":"survived"}},{"absence":null,"basis":"6fe828bc1ab7690a8d52b8468ad9189e9e0ce3fa3a95f0d84b43225bfca9f3bb","coverage":null,"id":"enwiki-1458875-1343796790::In-text #453d74c9","item":"In-text #453d74c9","kind":"theorem","locations":[{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"high","declaration":"TauCeti.eqOn_of_harmonicOnNhd_of_eqOn_frontier","end_line":124,"library":"tauceti","line":115,"location_key":"6fe828bc1ab7690a8d52b8468ad9189e9e0ce3fa3a95f0d84b43225bfca9f3bb","module":"TauCeti.Analysis.InnerProductSpace.Laplacian.Comparison","note":"The declaration is about real-valued harmonic functions on a compact set of a finite-dimensional real inner product space, with the unit disk one admissible choice of that set.","pair_key":"db55924742355560aa44dd2852b45144da9226fb7c64c5873a433e032b56319d","path":"TauCeti/Analysis/InnerProductSpace/Laplacian/Comparison.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"theorem TauCeti.eqOn_of_harmonicOnNhd_of_eqOn_frontier {E : Type*} [NormedAddCommGroup E] [InnerProductSpace ℝ E] [FiniteDimensional ℝ E] [Nontrivial E] {K : Set E} {f g : E → ℝ} : IsCompact K → ContinuousOn f K → ContinuousOn g K → InnerProductSpace.HarmonicOnNhd f (interior K) → InnerProductSpace.HarmonicOnNhd g (interior K) → (∀ ⦃x : E⦄, x ∈ frontier K → f x = g x) → Set.EqOn f g K"},"statement":false},{"challenge":"sampled_out","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"medium","declaration":"TauCeti.exists_harmonicOnNhd_ball_continuousOn_closedBall_eq","end_line":349,"library":"tauceti","line":318,"location_key":"f0ac877f9f8f79ba808f4524b7952d72ab7ae17353eaf652cc91de07306b3858","module":"TauCeti.Analysis.PDE.PoissonIntegral.Ball","note":"This solves the boundary value problem on the unit ball, producing a harmonic function with prescribed continuous boundary data, which is the existence side and not the determination the passage asserts.","pair_key":"aef8d9a0988b71c40f682c3c22e34b2cf733064ed78a3f456b84a57bc915e2f6","path":"TauCeti/Analysis/PDE/PoissonIntegral/Ball.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"theorem TauCeti.exists_harmonicOnNhd_ball_continuousOn_closedBall_eq {n : ℕ} {g : ↑(Metric.sphere 0 1) → ℝ} : Continuous g → ∃ u, InnerProductSpace.HarmonicOnNhd u (Metric.ball 0 1) ∧ ContinuousOn u (Metric.closedBall 0 1) ∧ ∀ (z : ↑(Metric.sphere 0 1)), u ↑z = g z"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"c3ca1058faf14522c0e3e0e1e7f7d0a799dfdb8551f53285601eb85775aa2ef0","prominence":"supporting","quote":{"exact":"Harmonic functions on the unit disk are rigid in the sense that"},"quote_capped":true,"section":["Examples"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=1458875&oldid=1343796790","text":{"before":{"layer":"Some examples include: ","lead_in":true,"segments":[{"text":"Some examples include: "}]},"layer":"Harmonic functions on the unit disk are rigid in the sense that they are uniquely determined by their boundary values.","segments":[{"text":"Harmonic functions on the unit disk are rigid in the sense that they are uniquely determined by their boundary values."}]},"unresolved":null},{"absence":null,"basis":"139a04c38465ae88f36cd1f8e0c1fa2ce64d8f33bbfd6b2e9c8179470ce1955e","coverage":null,"id":"enwiki-1458875-1343796790::In-text #416e4789","item":"In-text #416e4789","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Complex.taylorSeries_eq_of_entire'","end_line":137,"library":"mathlib","line":134,"location_key":"139a04c38465ae88f36cd1f8e0c1fa2ce64d8f33bbfd6b2e9c8179470ce1955e","module":"Mathlib.Analysis.Complex.TaylorSeries","note":"Mathlib's Taylor formula for functions holomorphic on the whole plane, which is the reading the article's contrast with smooth functions on the real line calls for.","pair_key":"5e927766254c1459b019cf4a777e4e560c607358d979790457ae34fd254fe8ab","path":"Mathlib/Analysis/Complex/TaylorSeries.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Complex.taylorSeries_eq_of_entire' (c z : ℂ) {f : ℂ → ℂ} : Differentiable ℂ f → ∑' (n : ℕ), (↑n.factorial)⁻¹ * iteratedDeriv n f c * (z - c) ^ n = f z"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Complex.taylorSeries_eq_of_entire","end_line":130,"library":"mathlib","line":128,"location_key":"477bac75e7d1a641dfdf9a01dbc3f0e823745387bf45905ed627b382189ee73b","module":"Mathlib.Analysis.Complex.TaylorSeries","note":"The same Taylor formula with values in a complete normed space over ℂ rather than in ℂ, of which the passage's case is the choice E equal to ℂ.","pair_key":"26ef22acc2c6d27fb3a37f5557e58c05934025df780fac37e0d2e4368b638202","path":"Mathlib/Analysis/Complex/TaylorSeries.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Complex.taylorSeries_eq_of_entire {E : Type*} [NormedAddCommGroup E] [NormedSpace ℂ E] [CompleteSpace E] ⦃f : ℂ → E⦄ : Differentiable ℂ f → ∀ (c z : ℂ), ∑' (n : ℕ), (↑n.factorial)⁻¹ • (z - c) ^ n • iteratedDeriv n f c = f z"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Complex.taylorSeries_eq_on_ball'","end_line":75,"library":"mathlib","line":72,"location_key":"c329dda102f3305811b005fb09a68a583adb26dcb7fc3a93fbcebda2f52d0c8c","module":"Mathlib.Analysis.Complex.TaylorSeries","note":"Here the domain is a single disk rather than the whole plane, so it covers the passage only for functions holomorphic on such a disk.","pair_key":"c3ab98515b018d827ecd36061ec8b3f17f22d858fe74f92683551186e6a2b8ed","path":"Mathlib/Analysis/Complex/TaylorSeries.lean","proof_status":"proved","rank":3,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Complex.taylorSeries_eq_on_ball' ⦃c : ℂ⦄ ⦃r : ℝ⦄ ⦃z : ℂ⦄ : z ∈ Metric.ball c r → ∀ {f : ℂ → ℂ}, DifferentiableOn ℂ f (Metric.ball c r) → ∑' (n : ℕ), (↑n.factorial)⁻¹ * iteratedDeriv n f c * (z - c) ^ n = f z"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"f017b487afb7096f0a90730aa54cf47d26273e1380dbb81596b8e655f32a51d4","prominence":"supporting","quote":{"exact":"Holomorphic functions are determined by the set of all derivatives at a"},"quote_capped":true,"section":["Examples"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=1458875&oldid=1343796790","text":{"layer":"Holomorphic functions are determined by the set of all derivatives at a single point.","segments":[{"text":"Holomorphic functions are determined by the set of all derivatives at a single point."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":4,"queries":6,"sha256":"ef44d2f9d68a91eb776b35e4f0842e9003d5417b5c0039634aa0a14f4d5f9f75"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-1458875-1343796790::In-text #b03c4c4d","item":"In-text #b03c4c4d","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"medium","declaration":"MathlibExt.Analysis.Calculus.BorelWanted.borel_jet_real","library":"atlas","line":200,"location_key":"01283f196486557d180f1ecee42670f9960f2fb6aaa13e131441ee4474095a24","module":"MathlibExt.Analysis.Calculus.Borel","note":"It builds a smooth real function with any prescribed sequence of derivatives at the origin, but it produces one function only and so does not exhibit two smooth functions sharing all their derivatives there.","pair_key":"fc9cda6938a31a198b8bb31b7cadf647b3ae5e12cccccc7b2994be5a79d9ba2c","path":"MathlibExt/Analysis/Calculus/Borel.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"theorem MathlibExt.Analysis.Calculus.BorelWanted.borel_jet_real (a : ℕ → ℝ) : ∃ f, ContDiff ℝ (↑⊤) f ∧ ∀ (n : ℕ), iteratedDeriv n f 0 = a n"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"expNegInvGlue.not_analyticAt_zero","end_line":78,"library":"mathlib","line":72,"location_key":"c6fd3cc397b0f428c7da70b3491c9aab005b2c654d229d1900999104ecaa4572","module":"Mathlib.Analysis.SpecialFunctions.SmoothTransition","note":"It says the standard smooth transition function is not analytic at the origin, which is about convergence of a power series and not about two functions with matching derivatives.","pair_key":"98f54d876d6baf921af16c4c3b06b8a9247d5d07db6d942f90ae0e3d168c1dac","path":"Mathlib/Analysis/SpecialFunctions/SmoothTransition.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem expNegInvGlue.not_analyticAt_zero : ¬AnalyticAt ℝ expNegInvGlue 0"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"5bbc556abfa68df555d90c0a51d7ad3d6a89602c58a3257392558a73a20d822a","prominence":"supporting","quote":{"exact":"A smooth function from the real line to the complex plane is"},"quote_capped":true,"section":["Examples"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=1458875&oldid=1343796790","text":{"layer":"A smooth function from the real line to the complex plane is not, in general, determined by all its derivatives at a single point, but it is if we require additionally that it be possible to extend the function to one on a neighbourhood of the real line in the complex plane.","segments":[{"text":"A smooth function from the real line to the complex plane is not, in general, determined by all its derivatives at a single point, but it is if we require additionally that it be possible to extend the function to one on a neighbourhood of the real line in the complex plane."}]},"unresolved":null},{"absence":null,"basis":"7cc308333c7ecdcd1b128ebd526d3f38ba1c6e57628e2a9a3373af29e44967e2","coverage":null,"id":"enwiki-1458875-1343796790::In-text #0bcacde7","item":"In-text #0bcacde7","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Polynomial.eq_of_infinite_eval_eq","end_line":168,"library":"mathlib","line":164,"location_key":"7cc308333c7ecdcd1b128ebd526d3f38ba1c6e57628e2a9a3373af29e44967e2","module":"Mathlib.Algebra.Polynomial.Roots","note":"Mathlib states it for polynomials over an arbitrary commutative integral domain, and the complex numbers form one.","pair_key":"699dc7edd35292b53bed76e798f6e77fae6fc1c3fa1f7915f384ef9197be9a89","path":"Mathlib/Algebra/Polynomial/Roots.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Polynomial.eq_of_infinite_eval_eq {R : Type u} [CommRing R] [IsDomain R] (p q : R[X]) : {x | Polynomial.eval x p = Polynomial.eval x q}.Infinite → p = q"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Polynomial.funext","end_line":473,"library":"mathlib","line":469,"location_key":"6e3a924ba3cbfb085bd03335f362d9b917110ae0aa551b18b69e5a8aa331cc47","module":"Mathlib.Algebra.Polynomial.Roots","note":"Here the infinite set is fixed to be the whole coefficient field instead of an arbitrary infinite subset of it.","pair_key":"dee3fff7aeaf3cb62178ae32a9847d69f9135b650e90f13c583f7029bde622fb","path":"Mathlib/Algebra/Polynomial/Roots.lean","proof_status":"proved","rank":2,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Polynomial.funext {R : Type u} [CommRing R] [IsDomain R] [Infinite R] {p q : R[X]} : (∀ (r : R), Polynomial.eval r p = Polynomial.eval r q) → p = q"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"f8c20ddda3aba4c8f16fa22c938737b0ac1f4225fb2b4c4b30df965f432f887e","prominence":"central","quote":{"exact":"By the fundamental theorem of algebra, polynomials in C are rigid in"},"quote_capped":true,"section":["Examples"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=1458875&oldid=1343796790","text":{"layer":"By the fundamental theorem of algebra, polynomials in C are rigid in the sense that any polynomial is completely determined by its values on any infinite set, say N, or the unit disk.","segments":[{"text":"By the fundamental theorem of algebra, polynomials in C are rigid in the sense that any polynomial is completely determined by its values on any infinite set, say N, or the unit disk."}]},"unresolved":null},{"absence":null,"basis":"8f534156decb80e8e20773fd2bd8c4081d0c08ad03f393d033fba1d182dcbd51","coverage":null,"id":"enwiki-1458875-1343796790::In-text #70018a70","item":"In-text #70018a70","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Polynomial.sum_taylor_eq","end_line":211,"library":"mathlib","line":208,"location_key":"8f534156decb80e8e20773fd2bd8c4081d0c08ad03f393d033fba1d182dcbd51","module":"Mathlib.Algebra.Polynomial.Taylor","note":"It pins the polynomial down within the polynomials rather than within all holomorphic functions, and it indexes the data by Taylor coefficients rather than by the derivatives themselves.","pair_key":"7d33265f117261f3dbaddfbb9ef246fe4873952689eadbda49976d012c75fd20","path":"Mathlib/Algebra/Polynomial/Taylor.lean","proof_status":"proved","rank":1,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Polynomial.sum_taylor_eq {R : Type*} [CommRing R] (f : R[X]) (r : R) : (((Polynomial.taylor r) f).sum fun i a ↦ Polynomial.C a * (Polynomial.X - Polynomial.C r) ^ i) = f"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Polynomial.eq_zero_of_hasseDeriv_eq_zero","end_line":118,"library":"mathlib","line":114,"location_key":"f539b09b4befa187c8ea154919e2fee448034f774f54fcbf0188d3d424cb1b83","module":"Mathlib.Algebra.Polynomial.Taylor","note":"It concludes vanishing from the vanishing of all Hasse derivatives at a point, so the comparison of two polynomials is reached only after applying it to their difference.","pair_key":"f17687acfd5447aa5f0005f92899c7db88eee58c7528d22d868960be784a65d8","path":"Mathlib/Algebra/Polynomial/Taylor.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Polynomial.eq_zero_of_hasseDeriv_eq_zero {R : Type*} [Semiring R] (f : R[X]) (r : R) : (∀ (k : ℕ), Polynomial.eval r ((Polynomial.hasseDeriv k) f) = 0) → f = 0"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Complex.taylorSeries_eq_of_entire'","end_line":137,"library":"mathlib","line":134,"location_key":"e41f2462be45438355fefe1c94bb56d7abae1df27527c8f972b2e5a770eaddfc","module":"Mathlib.Analysis.Complex.TaylorSeries","note":"This is the determination of a function holomorphic on the plane by all of its derivatives at a point, the earlier example the passage leans on, and it does not say that finitely many of them suffice for a polynomial.","pair_key":"39d58ffe5797e7f2ff95329bc8df086de78a0fe1c2a4337264187030c590024d","path":"Mathlib/Analysis/Complex/TaylorSeries.lean","proof_status":"proved","rank":3,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Complex.taylorSeries_eq_of_entire' (c z : ℂ) {f : ℂ → ℂ} : Differentiable ℂ f → ∑' (n : ℕ), (↑n.factorial)⁻¹ * iteratedDeriv n f c * (z - c) ^ n = f z"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"02ddb5208ecfe493233c2dffd3e951c0ef91afcb54697e1e9524a2d670e41e76","prominence":"supporting","quote":{"exact":"By the previous example, a polynomial is also determined within the set"},"quote_capped":true,"section":["Examples"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=1458875&oldid=1343796790","text":{"layer":"By the previous example, a polynomial is also determined within the set of holomorphic functions by the finite set of its non-zero derivatives at any single point.","segments":[{"text":"By the previous example, a polynomial is also determined within the set of holomorphic functions by the finite set of its non-zero derivatives at any single point."}]},"unresolved":null},{"absence":null,"basis":"409d7bc87081b2b7a74c1da1905e2acaab36229ed7d7631084c989ed575d9188","coverage":null,"id":"enwiki-1458875-1343796790::In-text #20cec567","item":"In-text #20cec567","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Module.Basis.ext","end_line":318,"library":"mathlib","line":315,"location_key":"409d7bc87081b2b7a74c1da1905e2acaab36229ed7d7631084c989ed575d9188","module":"Mathlib.LinearAlgebra.Basis.Defs","note":"Mathlib states it for semilinear maps of modules over semirings, and the passage's linear maps of vector spaces are the case of the identity ring map over a field.","pair_key":"b9f1fc9c1f8a59b612c59d7dd2681bb4c21de2f00bf1f318248091df16a1a815","path":"Mathlib/LinearAlgebra/Basis/Defs.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Module.Basis.ext {ι : Type*} {R : Type*} {M : Type*} [Semiring R] [AddCommMonoid M] [_root_.Module R M] (b : Module.Basis ι R M) {R₁ : Type*} [Semiring R₁] {σ : R →+* R₁} {M₁ : Type*} [AddCommMonoid M₁] [_root_.Module R₁ M₁] {f₁ f₂ : M →ₛₗ[σ] M₁} : (∀ (i : ι), f₁ (b i) = f₂ (b i)) → f₁ = f₂"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"LinearMap.ext_on","end_line":859,"library":"mathlib","line":858,"location_key":"4cf818d9b41d8f931a89e17207da910f7439ef7fa3656dfe9ed038f535116f91","module":"Mathlib.LinearAlgebra.Span.Basic","note":"Its hypothesis is that the set spans the whole space, so reaching the passage from it needs the separate fact that a basis spans X.","pair_key":"756eaddf0d66f3d28c8ba627839cf8c6ce8df289c070249b5b2430e30fe99530","path":"Mathlib/LinearAlgebra/Span/Basic.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem LinearMap.ext_on {R : Type*} {R₂ : Type*} {M : Type*} {M₂ : Type*} [Semiring R] [AddCommMonoid M] [_root_.Module R M] [Semiring R₂] [AddCommMonoid M₂] [_root_.Module R₂ M₂] {σ₁₂ : R →+* R₂} {s : Set M} {f g : M →ₛₗ[σ₁₂] M₂} : Submodule.span R s = ⊤ → Set.EqOn (⇑f) (⇑g) s → f = g"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"df1f9e70981ba0ba43d932c3b346880323cb9b958ec12be0d83d85fcba331bf9","prominence":"supporting","quote":{"exact":"Linear maps L(X, Y) between vector spaces X, Y are rigid in"},"quote_capped":true,"section":["Examples"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=1458875&oldid=1343796790","text":{"layer":"Linear maps L(X, Y) between vector spaces X, Y are rigid in the sense that any L ∈ L(X, Y) is completely determined by its values on any set of basis vectors of X.","segments":[{"text":"Linear maps L(X, Y) between vector spaces X, Y are rigid in the sense that any L ∈ L(X, Y) is completely determined by its values on any set of basis vectors of X."}]},"unresolved":null},{"absence":null,"basis":"c077267fd84f45991766c9fd1cd68039dc52cf77e0c570dc06bb3bd719cdca89","coverage":null,"id":"enwiki-1458875-1343796790::In-text #55b518b3","item":"In-text #55b518b3","kind":"theorem","locations":[{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"medium","declaration":"TauCeti.MostowRigidity","end_line":76,"library":"tauceti","line":72,"location_key":"c077267fd84f45991766c9fd1cd68039dc52cf77e0c570dc06bb3bd719cdca89","module":"TauCeti.Geometry.Manifold.Riemannian.Hyperbolic.Mostow","note":"The library confines the claim to hyperbolic metrics on closed connected manifolds of dimension at least three, where the passage speaks loosely of negatively curved manifolds.","pair_key":"e0564286ce74d9eb9cac3f3a9e1ee383bf588ff82a0973cc42998b3eb632da45","path":"TauCeti/Geometry/Manifold/Riemannian/Hyperbolic/Mostow.lean","proof_status":"definition","rank":1,"relation":"narrowMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"def TauCeti.MostowRigidity : Prop"},"statement":true},{"challenge":"downgraded","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"medium","declaration":"MathlibExt.Geometry.MostowRigidityWanted.Geometry.MostowRigidity.mostow_rigidity","library":"atlas","line":164,"location_key":"b3f54892f3f9552f94058d344dfa44b812abf1e9d94f2dc027fbfc7827d60379","module":"WantedExt.Geometry.MostowRigidityWanted","note":"It is phrased for discrete subgroups of the isometry group rather than for manifolds, so reaching the manifold formulation of the passage goes through the usual dictionary between the two.","pair_key":"1b0ebcc8bb51613951e735ddc8e0fec38a1bdb73babeb12af48064de78874f9f","path":"WantedExt/Geometry/MostowRigidityWanted.lean","proof_status":"wanted","rank":2,"relation":"relatedMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":true,"text":"theorem MathlibExt.Geometry.MostowRigidityWanted.Geometry.MostowRigidity.mostow_rigidity (n : ℕ) : … → ∀ (Γ Λ : Subgroup (MathlibExt.Geometry.MostowRigidityWanted.Geometry.MostowRigidity.PO n 1)), IsDiscrete ↑Γ → IsDiscrete ↑Λ → ∀ [MeasureTheory.HasFundamentalDomain (↥Γ) (MathlibExt.Geometry.MostowRigidityWanted.Geometry.MostowRigidity.PO n 1) MeasureTheory.MeasureSpace.volume] [MeasureTheory.HasFundamentalDomain (↥Λ) …","type":"∀ (n : ℕ), 3 ≤ n → ∀ (Γ Λ : Subgroup (MathlibExt.Geometry.MostowRigidityWanted.Geometry.MostowRigidity.PO n 1)), IsDiscrete ↑Γ → IsDiscrete ↑Λ → ∀ [MeasureTheory.HasFundamentalDomain (↥Γ) (MathlibExt.Geometry.MostowRigidityWanted.Geometry.MostowRigidity.PO n 1) MeasureTheory.MeasureSpace.volume] [MeasureTheory.HasFundamentalDomain (↥Λ) (MathlibExt.Geometry.MostowRigidityWanted.Geometry.MostowRigidity.PO n 1) MeasureTheory.MeasureSpace.volume], MeasureTheory.covolume (↥Γ) (MathlibExt.Geometry.MostowRigidityWanted.Geometry.MostowRigidity.PO n 1) MeasureTheory.MeasureSpace.volume ≠ ⊤ → MeasureTheory.covolume (↥Λ) (MathlibExt.Geometry.MostowRigidityWanted.Geometry.MostowRigidity.PO n 1) MeasureTheory.MeasureSpace.volume ≠ ⊤ → ∀ (f : ↥Γ ≃* ↥Λ), ∃ g, ∀ (γ : ↥Γ), ↑(f γ) = g * ↑γ * g⁻¹"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"7ff037d31438cc8d5416aea6a58b323b53dc2332b49a2a873d3ff220e0e13b0c","prominence":"central","quote":{"exact":"Mostow's rigidity theorem, which states that the geometric structure of negatively curved"},"quote_capped":true,"section":["Examples"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=1458875&oldid=1343796790","text":{"layer":"Mostow's rigidity theorem, which states that the geometric structure of negatively curved manifolds is determined by their topological structure.","segments":[{"text":"Mostow's rigidity theorem, which states that the geometric structure of negatively curved manifolds is determined by their topological structure."}]},"unresolved":null},{"absence":null,"basis":"344411e7612742d9c6c483c4784362fdc9c4b6d8ee8ce1deb0e5b1bd71b28bba","coverage":null,"id":"enwiki-1458875-1343796790::In-text #a8af140a","item":"In-text #a8af140a","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"OrderIso.unique_of_wellFoundedLT","end_line":224,"library":"mathlib","line":224,"location_key":"344411e7612742d9c6c483c4784362fdc9c4b6d8ee8ce1deb0e5b1bd71b28bba","module":"Mathlib.Order.Hom.Set","note":"Mathlib records the fact as a Unique instance on the type of order-isomorphisms of the set with itself, in place of an equation between an arbitrary automorphism and the identity map.","pair_key":"c1125e0e18226df8bb0715d001ff13101d6b33b919117bf3440df7ab6b79464b","path":"Mathlib/Order/Hom/Set.lean","proof_status":"definition","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"instance OrderIso.unique_of_wellFoundedLT {α : Type*} [LinearOrder α] [WellFoundedLT α] : Unique (α ≃o α)"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"OrderIso.subsingleton_of_wellFoundedLT","end_line":216,"library":"mathlib","line":211,"location_key":"7d55a08e89e5dd6e28b00adc5ee9522c27750cd684e35687e20f0ce199f2b96f","module":"Mathlib.Order.Hom.Set","note":"Mathlib allows any preordered target here, so the automorphism statement of the passage is the case where the target is the well-ordered set itself.","pair_key":"55fd03ac0c988f133aa341d427a9aecc78e394ed1ca03e173141f01e9e2a72e2","path":"Mathlib/Order/Hom/Set.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"instance OrderIso.subsingleton_of_wellFoundedLT {α : Type*} {β : Type*} [LinearOrder α] [WellFoundedLT α] [Preorder β] : Subsingleton (α ≃o β)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"108580927ab9b9e6475b9b85cec1511e02f501a33c1839ed2b67f9f207f3bea1","prominence":"supporting","quote":{"exact":"A well-ordered set is rigid in the sense that the only (order-preserving)"},"quote_capped":true,"section":["Examples"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=1458875&oldid=1343796790","text":{"layer":"A well-ordered set is rigid in the sense that the only (order-preserving) automorphism on it is the identity function.","segments":[{"text":"A well-ordered set is rigid in the sense that the only (order-preserving) automorphism on it is the identity function."}]},"unresolved":null},{"absence":null,"basis":"0b299c0a135915da864e2eb00714046d174f834c516bd7b322b6727f1636aa19","coverage":null,"id":"enwiki-1458875-1343796790::In-text #82df7c56","item":"In-text #82df7c56","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"OrderIso.subsingleton_of_wellFoundedLT","end_line":216,"library":"mathlib","line":211,"location_key":"0b299c0a135915da864e2eb00714046d174f834c516bd7b322b6727f1636aa19","module":"Mathlib.Order.Hom.Set","note":"Mathlib asks for well-foundedness of the source order alone and leaves the target an arbitrary preorder.","pair_key":"48c92048ad9cc074965b4468120302eeb981fb9621fca725d47d6b7fd41fd39a","path":"Mathlib/Order/Hom/Set.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"instance OrderIso.subsingleton_of_wellFoundedLT {α : Type*} {β : Type*} [LinearOrder α] [WellFoundedLT α] [Preorder β] : Subsingleton (α ≃o β)"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"InitialSeg.instSubsingletonOfIsWellOrder","end_line":165,"library":"mathlib","line":164,"location_key":"47e0ee3d49644645547327fc7c4e5c2df047465f965e4795445ee96d9cf574d1","module":"Mathlib.Order.InitialSeg","note":"It counts initial-segment embeddings rather than isomorphisms, so reaching the passage would need the map carrying an isomorphism to an initial segment together with its injectivity.","pair_key":"2be4ac75173c81539371ca987f26dd7045ba4c5abacaa61c54c10d31e9a709b3","path":"Mathlib/Order/InitialSeg.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"instance InitialSeg.instSubsingletonOfIsWellOrder {α : Type*} {β : Type*} {r : α → α → Prop} {s : β → β → Prop} [IsWellOrder β s] : Subsingleton (InitialSeg r s)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"c3269d73a5465aa3cce840d9a6ee5c3c2e002e3cfd0e4740ecacf0f250186436","prominence":"supporting","quote":{"exact":"Consequently, an isomorphism between two given well-ordered sets will be unique."},"quote_capped":false,"section":["Examples"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=1458875&oldid=1343796790","text":{"layer":"Consequently, an isomorphism between two given well-ordered sets will be unique.","segments":[{"text":"Consequently, an isomorphism between two given well-ordered sets will be unique."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":4,"sha256":"fa9e7e7cbb5279be864d9f5528142315c6b985532b6b7610fa3dff5d38cd57f1"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-1458875-1343796790::In-text #44f83b0f","item":"In-text #44f83b0f","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"9f5e7079a353f027bbb85b032a243229301db9277381fa14b2a09e867c4ec472","prominence":"central","quote":{"exact":"Cauchy's theorem on geometry of convex polytopes states that a convex polytope"},"quote_capped":true,"section":["Examples"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=1458875&oldid=1343796790","text":{"layer":"Cauchy's theorem on geometry of convex polytopes states that a convex polytope is uniquely determined by the geometry of its faces and combinatorial adjacency rules.","segments":[{"text":"Cauchy's theorem on geometry of convex polytopes states that a convex polytope is uniquely determined by the geometry of its faces and combinatorial adjacency rules."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":1,"queries":3,"sha256":"962303c0b9f151a221b2539bd243ac3842cda820f9216d6ef86607ec6929bb89"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-1458875-1343796790::In-text #7d8c02e6","item":"In-text #7d8c02e6","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"9efff4924325daa8942c312d9441ddfeeafa9cb48377b05f5b15937b438397d3","prominence":"central","quote":{"exact":"Alexandrov's uniqueness theorem states that a convex polyhedron in three dimensions is"},"quote_capped":true,"section":["Examples"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=1458875&oldid=1343796790","text":{"layer":"Alexandrov's uniqueness theorem states that a convex polyhedron in three dimensions is uniquely determined by the metric space of geodesics on its surface.","segments":[{"text":"Alexandrov's uniqueness theorem states that a convex polyhedron in three dimensions is uniquely determined by the metric space of geodesics on its surface."}]},"unresolved":null},{"absence":null,"basis":"58111ce5c4f66c70264450cd061376438e358dab328b8e0cbaead2312bb35b2e","coverage":null,"id":"enwiki-1458875-1343796790::In-text #d3d8275a","item":"In-text #d3d8275a","kind":"definition","locations":[{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"medium","declaration":"MetaMathlibExt.IsSurjectiveRestrictedGrowthString","library":"atlas","line":33,"location_key":"58111ce5c4f66c70264450cd061376438e358dab328b8e0cbaead2312bb35b2e","module":"MathlibExt.Combinatorics.Enumerative.Partition.PeakGeneratingFunction","note":"Atlas writes the same class of maps with the restricted-growth wording, asking that every label below the one at a position already occur earlier, where the passage phrases it through the least elements of the preimages.","pair_key":"a307e4dc0597c3b917ca8079107f882e545d560c117258fa1ffa10085b9b3a65","path":"MathlibExt/Combinatorics/Enumerative/Partition/PeakGeneratingFunction.lean","proof_status":"definition","rank":1,"relation":"closeMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"def MetaMathlibExt.IsSurjectiveRestrictedGrowthString {n k : ℕ} : (Fin n → Fin k) → Prop"},"statement":true}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"8c0fdd1abcfc7c38ea6137e66daf7faac4a1c4641973f4796460375909e5b725","prominence":"central","quote":{"exact":"In combinatorics, the term rigid is also used to define the notion"},"quote_capped":true,"section":["Combinatorial use"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=1458875&oldid=1343796790","text":{"layer":"In combinatorics, the term rigid is also used to define the notion of a rigid surjection, which is a surjection f : n → m {\\displaystyle f:n\\to m} for which the following equivalent conditions hold:","segments":[{"text":"In combinatorics, the term rigid is also used to define the notion of a rigid surjection, which is a surjection "},{"tex":"f:n\\to m"},{"text":" for which the following equivalent conditions hold:"}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":0,"queries":4,"sha256":"f9f23cb0066f382f64c74c55fab152b3f43fa24909abe85841d5f21a8e45c354"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-1458875-1343796790::In-text #b0e59db1","item":"In-text #b0e59db1","kind":"theorem","locations":[{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"medium","declaration":"MetaMathlibExt.IsSurjectiveRestrictedGrowthString","library":"atlas","line":33,"location_key":"ed2e3e6a70cbd9dcbe6607d169b78dc5222466cadc7eac7ff3d5c5caad5badbc","module":"MathlibExt.Combinatorics.Enumerative.Partition.PeakGeneratingFunction","note":"It is a definition of the class of maps and proves no equivalence, so it leaves the passage's comparison of the three conditions unstated.","pair_key":"19fc25646a4f19416918c2220cac9e144039290673c891e9132cde175d067659","path":"MathlibExt/Combinatorics/Enumerative/Partition/PeakGeneratingFunction.lean","proof_status":"definition","rank":1,"relation":"relatedMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"def MetaMathlibExt.IsSurjectiveRestrictedGrowthString {n k : ℕ} : (Fin n → Fin k) → Prop"},"statement":true}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"63ae745bfb3652f02da91d1dbb2c44cfb20d89748c7673d93d966170c9b562e3","prominence":"central","quote":{"exact":"For every i , j ∈ m {\\displaystyle i,j\\in m} , i"},"quote_capped":true,"section":["Combinatorial use"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=1458875&oldid=1343796790","text":{"before":{"layer":"In combinatorics, the term rigid is also used to define the notion of a rigid surjection, which is a surjection f : n → m {\\displaystyle f:n\\to m} for which the following equivalent conditions hold:[1] ","lead_in":true,"segments":[{"text":"In combinatorics, the term rigid is also used to define the notion of a rigid surjection, which is a surjection "},{"tex":"f:n\\to m"},{"text":" for which the following equivalent conditions hold:"},{"ref":"[1]"},{"text":" "}]},"layer":"For every i , j ∈ m {\\displaystyle i,j\\in m} , i < j ⟹ min f − 1 ( i ) < min f − 1 ( j ) {\\displaystyle i<j\\implies \\min f^{-1}(i)<\\min f^{-1}(j)} ; Considering f {\\displaystyle f} as an n {\\displaystyle n} -tuple ( f ( 0 ) , f ( 1 ) , … , f ( n − 1 ) ) {\\displaystyle {\\big (}f(0),f(1),\\ldots ,f(n-1){\\big )}} , the first occurrences of the elements in m {\\displaystyle m} are in increasing order; f {\\displaystyle f} maps initial segments of n {\\displaystyle n} to initial segments of m {\\displaystyle m} .","segments":[{"text":"For every "},{"tex":"i,j\\in m"},{"text":" , "},{"tex":"i<j\\implies \\min f^{-1}(i)<\\min f^{-1}(j)"},{"text":" ; Considering "},{"tex":"f"},{"text":" as an "},{"tex":"n"},{"text":" -tuple "},{"tex":"{\\big (}f(0),f(1),\\ldots ,f(n-1){\\big )}"},{"text":" , the first occurrences of the elements in "},{"tex":"m"},{"text":" are in increasing order; "},{"tex":"f"},{"text":" maps initial segments of "},{"tex":"n"},{"text":" to initial segments of "},{"tex":"m"},{"text":" ."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"495168764411cd45474c0f056061325c87ee93e391af6e1dc15f8f841f650025"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-1458875-1343796790::In-text #bb4683bb","item":"In-text #bb4683bb","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"8a81e409a7c7157c8ead97adbc5bf63777ad9d200857daa31f722e30d15de409","prominence":"central","quote":{"exact":"This relates to the above definition of rigid, in that each rigid"},"quote_capped":true,"section":["Combinatorial use"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=1458875&oldid=1343796790","text":{"layer":"This relates to the above definition of rigid, in that each rigid surjection f {\\displaystyle f} uniquely defines, and is uniquely defined by, a partition of n {\\displaystyle n} into m {\\displaystyle m} pieces.","segments":[{"text":"This relates to the above definition of rigid, in that each rigid surjection "},{"tex":"f"},{"text":" uniquely defines, and is uniquely defined by, a partition of "},{"tex":"n"},{"text":" into "},{"tex":"m"},{"text":" pieces."}]},"unresolved":null},{"absence":null,"basis":"fb88409bf41353d77b4eea8843e0153c2aefcd501fc28e7b6c2eea07c1e3cc0b","coverage":null,"id":"enwiki-1458875-1343796790::In-text #e282f29a","item":"In-text #e282f29a","kind":"construction","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Equiv.sigmaFiberEquiv","end_line":237,"library":"mathlib","line":236,"location_key":"fb88409bf41353d77b4eea8843e0153c2aefcd501fc28e7b6c2eea07c1e3cc0b","module":"Mathlib.Logic.Equiv.Sum","note":"Mathlib builds the canonical equivalence for an arbitrary map between arbitrary types, indexing the preimages by the whole codomain, so it also covers maps that are neither onto nor rigid.","pair_key":"611ddb49bef3812c62dadf00dd82a91604baa9eda0715bbe61560519963465db","path":"Mathlib/Logic/Equiv/Sum.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Equiv.sigmaFiberEquiv {α : Type*} {β : Type*} (f : α → β) : (y : β) × { x // f x = y } ≃ α"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"low","declaration":"IndexedPartition.mk'","end_line":342,"library":"mathlib","line":335,"location_key":"b84f3363901d574cdccbc9f4b8285d02119f58c51c61053d494411d836e25ff5","module":"Mathlib.Order.Setoid.Partition","note":"It builds an indexed partition from a family that is pairwise disjoint, has nonempty members and covers the type, so reaching the passage's partition needs those three facts proved for the preimages of a surjection.","pair_key":"6015f756b036a9bdc86256967441814b7bfbe43ef01de3d32679e931d53a3602","path":"Mathlib/Order/Setoid/Partition.lean","proof_status":"definition","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def IndexedPartition.mk' {ι : Type*} {α : Type*} (s : ι → Set α) : Pairwise (Function.onFun Disjoint s) → (∀ (i : ι), (s i).Nonempty) → (∀ (x : α), ∃ i, x ∈ s i) → IndexedPartition s"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"4e564d63804ef421975515d8e100a333b5d281b56604682cdecb50897df593dc","prominence":"supporting","quote":{"exact":"Given a rigid surjection f {\\displaystyle f} , the partition is defined"},"quote_capped":true,"section":["Combinatorial use"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=1458875&oldid=1343796790","text":{"layer":"Given a rigid surjection f {\\displaystyle f} , the partition is defined by n = f − 1 ( 0 ) ⊔ ⋯ ⊔ f − 1 ( m − 1 ) {\\displaystyle n=f^{-1}(0)\\sqcup \\cdots \\sqcup f^{-1}(m-1)} .","segments":[{"text":"Given a rigid surjection "},{"tex":"f"},{"text":" , the partition is defined by "},{"tex":"n=f^{-1}(0)\\sqcup \\cdots \\sqcup f^{-1}(m-1)"},{"text":" ."}]},"unresolved":null},{"absence":null,"basis":"4daeddfc7e912e15344c79c7f1d05855a7ba4fd51197c54fc9ef50f03f1b1f74","coverage":null,"id":"enwiki-1458875-1343796790::In-text #46d188e0","item":"In-text #46d188e0","kind":"construction","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"low","declaration":"Order.Preimage","end_line":97,"library":"mathlib","line":97,"location_key":"4daeddfc7e912e15344c79c7f1d05855a7ba4fd51197c54fc9ef50f03f1b1f74","module":"Mathlib.Order.Basic","note":"Mathlib defines the comparison pulled back along an arbitrary key map; the passage's block precedence is the instance whose key sends a block to its least element and whose relation is < on ℕ.","pair_key":"9163885c7fe4511e28597f5d5566e0e3b91c4813ab627ea31a7d29999f4737ff","path":"Mathlib/Order/Basic.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Order.Preimage {α : Type*} {β : Type*} : (α → β) → (β → β → Prop) → α → α → Prop"},"statement":true},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"OrderedFinpartition","end_line":113,"library":"mathlib","line":97,"location_key":"e4de76484806aab23c6a02b7817c1169ad7cd5aa8d01ea56914e657ed0fc7cc9","module":"Mathlib.Analysis.Calculus.ContDiff.FaaDiBruno","note":"This is the type of partitions of Fin n carrying an ordering of their parts, but by the library's own account the parts are ordered by increasing greatest element, which orders the blocks differently from the passage's least-element rule.","pair_key":"87ec1e71f2bdd50b63cdba542c52263ab4703166b18d2570cd5d63607d4e494f","path":"Mathlib/Analysis/Calculus/ContDiff/FaaDiBruno.lean","proof_status":"definition","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"structure OrderedFinpartition : ℕ → Type"},"statement":false},{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"medium","declaration":"MetaMathlibExt.IsOrderedSetPartition","library":"atlas","line":21,"location_key":"b375f8435f94770437585f66ff139888f79caa83be3c5e017dcb27094ee5fb68","module":"MathlibExt.Combinatorics.Enumerative.OrderedSetPartition","note":"This says a list of nonempty finsets partitions a given finset, leaving the order of the list free; it imposes no condition tying a block's position to its least element.","pair_key":"80dbd8d05272dbd945c1ef8c48dbb70bfdd9386c49d302c4457cb42f2f4bf229","path":"MathlibExt/Combinatorics/Enumerative/OrderedSetPartition.lean","proof_status":"definition","rank":3,"relation":"relatedMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"def MetaMathlibExt.IsOrderedSetPartition {α : Type*} [DecidableEq α] : Finset α → List (Finset α) → Prop"},"statement":true}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"973ed8f0f34faf583d7f747a2f837bb678496dbf685644c87c0a5a7fe51baa29","prominence":"supporting","quote":{"exact":"Conversely, given a partition of n = A 0 ⊔ ⋯ ⊔"},"quote_capped":true,"section":["Combinatorial use"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=1458875&oldid=1343796790","text":{"layer":"Conversely, given a partition of n = A 0 ⊔ ⋯ ⊔ A m − 1 {\\displaystyle n=A_{0}\\sqcup \\cdots \\sqcup A_{m-1}} , order the A i {\\displaystyle A_{i}} by letting A i ≺ A j ⟺ min A i < min A j {\\displaystyle A_{i}\\prec A_{j}\\iff \\min A_{i}<\\min A_{j}} .","segments":[{"text":"Conversely, given a partition of "},{"tex":"n=A_{0}\\sqcup \\cdots \\sqcup A_{m-1}"},{"text":" , order the "},{"tex":"A_{i}"},{"text":" by letting "},{"tex":"A_{i}\\prec A_{j}\\iff \\min A_{i}<\\min A_{j}"},{"text":" ."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":4,"queries":5,"sha256":"51f4362c6d4872b08ea42e95c52d41aaee58596f787db4b86090547ef08473b7"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-1458875-1343796790::In-text #195ddefd","item":"In-text #195ddefd","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"medium","declaration":"MetaMathlibExt.IsSurjectiveRestrictedGrowthString","library":"atlas","line":33,"location_key":"a9d6af5804b9d88fab75c3a548b4ccf39fdd904825f2ec1df60c7d91c5e8940d","module":"MathlibExt.Combinatorics.Enumerative.Partition.PeakGeneratingFunction","note":"This defines, for a map between initial segments, the property that every label below the one at a position has already occurred earlier, which is the universe's rendering of the property the passage's map is claimed to have; it asserts nothing about a map built from a partition.","pair_key":"e72627adf23ee360caadb554cb6029476782b6fcf1b2a4d9ed4a65131aff8924","path":"MathlibExt/Combinatorics/Enumerative/Partition/PeakGeneratingFunction.lean","proof_status":"definition","rank":1,"relation":"relatedMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"def MetaMathlibExt.IsSurjectiveRestrictedGrowthString {n k : ℕ} : (Fin n → Fin k) → Prop"},"statement":true},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Composition.index","end_line":317,"library":"mathlib","line":316,"location_key":"16f57a7e5f36a0d4ef0205bf545f7a24a5391ad2331b4df2cc74904a963e9e99","module":"Mathlib.Combinatorics.Enumerative.Composition","note":"This is the map sending an element to the index of the block of a composition containing it, defined only for decompositions into consecutive intervals, and it is a definition rather than a claim that the map is a surjection with increasing preimage minima.","pair_key":"6e4230962fb50c9e16bb1e43d0511299b00526d623302b4709ad0cecf508c211","path":"Mathlib/Combinatorics/Enumerative/Composition.lean","proof_status":"definition","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Composition.index {n : ℕ} (c : Composition n) : Fin n → Fin c.length"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"b7f481a96ebae75d97f290d75f7a6ce94cd17440f0654860f73f243b406c959f","prominence":"supporting","quote":{"exact":"If n = B 0 ⊔ ⋯ ⊔ B m − 1"},"quote_capped":true,"section":["Combinatorial use"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=1458875&oldid=1343796790","text":{"layer":"If n = B 0 ⊔ ⋯ ⊔ B m − 1 {\\displaystyle n=B_{0}\\sqcup \\cdots \\sqcup B_{m-1}} is now the ≺ {\\displaystyle \\prec } -ordered partition, the function f : n → m {\\displaystyle f:n\\to m} defined by f ( i ) = j ⟺ i ∈ B j {\\displaystyle f(i)=j\\iff i\\in B_{j}} is a rigid surjection.","segments":[{"text":"If "},{"tex":"n=B_{0}\\sqcup \\cdots \\sqcup B_{m-1}"},{"text":" is now the "},{"tex":"\\prec"},{"text":" -ordered partition, the function "},{"tex":"f:n\\to m"},{"text":" defined by "},{"tex":"f(i)=j\\iff i\\in B_{j}"},{"text":" is a rigid surjection."}]},"unresolved":null}],"provenance":{"challenge":{"harvested":"2026-11-01T14:25:17Z","mode":"locate-challenge","model":"claude-opus-5","model_name":"Claude Opus 5","operator":"jack","reviewer_model":"claude-opus-5","reviewer_model_name":"Claude Opus 5","run_id":"chal-tierA-b1","sampling":{"absence_sample_rate":0.25,"sample_rate":0.2,"seed":0,"strong_sample_rate":0.5},"skill_commit":"d85385aa4eb2818373e9b6b8b41b765ffaf53750","started":"2026-11-01T03:19:32Z"},"inventory":{"harvested":"2026-10-30T20:00:47Z","mode":"locate-inventory","model":"claude-opus-5","model_name":"Claude Opus 5","operator":"jack","reviewer_model":"claude-opus-5","reviewer_model_name":"Claude Opus 5","run_id":"inv-tierA-b1r","skill_commit":"d85385aa4eb2818373e9b6b8b41b765ffaf53750","started":"2026-10-30T07:23:03Z"},"locate":{"harvested":"2026-11-01T03:06:57Z","mode":"locate","model":"claude-opus-5","model_name":"Claude Opus 5","operator":"jack","reviewer_model":"claude-opus-5","reviewer_model_name":"Claude Opus 5","run_id":"loc-tierA-b1b","skill_commit":"d85385aa4eb2818373e9b6b8b41b765ffaf53750","started":"2026-10-31T04:59:09Z"}},"reader":{"bytes":39492,"images":[{"author":"Headbomb","file":"Lock-gray-alt-2.svg","licence":"CC0","licence_url":"https://creativecommons.org/publicdomain/zero/1.0/deed.en","project":"commons"},{"author":"User:Trappist the monk","file":"Lock-green.svg","licence":"CC0","licence_url":"https://creativecommons.org/publicdomain/zero/1.0/deed.en","project":"commons"},{"author":"VulpesVulpes42, Headbomb","file":"Lock-red-alt-2.svg","licence":"CC0","licence_url":"https://creativecommons.org/publicdomain/zero/1.0/deed.en","project":"commons"}],"marks":127,"passages":17,"sha256":"9152058e6282b35f7c10a59b7b566d4cc47fb717cb13718d8bab81e9a923c8c8","unplaced":["enwiki-1458875-1343796790::In-text #d9073911"]},"record_set":"23710337d053e8212378a9e580805628bcdfda61a6fc431e65f24a4a16c9e602","records_sha256":"42a898ac9be56431de724ff7ad16c27b5d04798e10e0e9bf0b47f2af1d24cde3","revision":1343796790,"schema":"wikilean.articles.article/1","seal":{"created":"2026-11-01T14:25:17Z","schema":"cf-locate-recordset/2","set_id":"tierA-b1b","skill_commit":"d85385aa4eb2818373e9b6b8b41b765ffaf53750","status_rule":3},"source":{"html_sha256":"f97bb62fd3d911e45735f6c9fb6ee3220290b076118ef16b898f1985fe4c5839","layer_sha256":"1358b681f2a98501cf4dff8d4a073312b32391e06e5c6c7b0f1de4f39756c89d","renderer":"web-html/3"},"source_id":"enwiki-1458875-1343796790","summary":{"by_library":{"atlas":{"complete":1,"incomplete":0,"locations":1,"passages":1,"related":5},"mathlib":{"complete":12,"incomplete":0,"locations":12,"passages":8,"related":8},"tauceti":{"complete":2,"incomplete":0,"locations":2,"passages":2,"related":1}},"by_prominence":{"central":{"by_status":{"formalized":2,"not_formalized":4,"partial":1,"statement_only":0,"unresolved":0},"passages":7},"subject":{"by_status":{"formalized":0,"not_formalized":0,"partial":0,"statement_only":0,"unresolved":1},"passages":1},"supporting":{"by_status":{"formalized":7,"not_formalized":2,"partial":1,"statement_only":0,"unresolved":0},"passages":10}},"by_proof_status":{"definition":11,"proved":17,"wanted":1},"by_relation":{"broadMatch":9,"closeMatch":2,"narrowMatch":4,"relatedMatch":14},"by_status":{"formalized":9,"not_formalized":6,"partial":2,"statement_only":0,"unresolved":1},"locations":15,"passages":18,"related":14},"supplements":{"audit_summary":{"schema":"wikilean.articles.audit-summary/1","sha256":"53b29c5773caa9a3a339ccb36db38548137820e05477c4eff49dfb63a91b74df"},"passage_text":{"schema":"wikilean.articles.passage-text/1","sha256":"c0c740562cd14bdcabe43ac1d7ba81039d8e41ef850fd199d7151de6bb774885"},"provenance":{"schema":"wikilean.articles.provenance/1","sha256":"ea245b590ba9078bc0b79003dc1e311dc1421475fe49483e3e3a905ed7c7ec4e"},"reader_html":{"schema":"wikilean.articles.reader-html/1","sha256":"738196c11695087fc8e74590f5ac362acd61af48a8950c0a049559dd3902d2df"},"signatures":{"corpus_built":"2026-10-18T06:14:30Z","corpus_sha256":"a364fd6aede529da1c9f2fa13fda6230a26381f27dafc8801c4205e2b5cf5221","schema":"wikilean.articles.signatures/1","sha256":"2ebb5eebf8b2ebd1f615518abce6169661140cc54d5fcad5f4443150cc62d874","universe":"u1"}},"title":"Rigidity (mathematics)","universe":{"frozen":"2026-10-17","id":"u1","libraries":48,"sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"wikidata":"Q17127780"}
