-
Definition · Subject of the article
✓Formalized
Formalized: ATLAS (atlas-lean) states a more general result (a definition).
In geometry, a tesseract or 4-cube is a four-dimensional hypercube, analogous to a two-dimensional square and a three-dimensional cube.[1]
Show in article · Read it in context on Wikipedia ↗
unitCube more general
def unitCube (d : ℕ) : Set (Fin d → ℝ)
MathlibExt.Topology.MetricSpace.LipschitzParametrizable · line 40
Why more general: The library builds the cube in every dimension, with side length one and a corner at the origin.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: it survived. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
64c2773. - Location key
afe155ea5a5f · pair key 28c522af993c.
ConvexCovering.coordinateCube more general
def ConvexCovering.coordinateCube (n : ℕ) : Set (EuclideanSpace ℝ (Fin n))
MathlibExt.Geometry.Convex.CubeCovering · line 31
Why more general: This one places the cube in Euclidean space, and like the passage's object it exists in each dimension.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: it survived. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
64c2773. - Location key
d7bca76a98c8 · pair key 48bf4a1552a9.
Related, but states something else
SimpleGraph.hypercube related
def SimpleGraph.hypercube (n : ℕ) : SimpleGraph (Fin n → Bool)
FormalConjecturesForMathlib.Combinatorics.SimpleGraph.Hypercube · lines 37–40
How it differs: This is the hypercube graph on the cube's corners, a combinatorial object, not the solid four-dimensional polytope.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 3 for this passage, high confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: it survived. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
e754a78. - Location key
223cf39977df · pair key 26fe5f4c7f7c.
Sign in to tag this passage
-
Theorem · main statement
✕Not formalized
Just as the perimeter of the square consists of four edges and the surface of the cube consists of six square faces, the hypersurface of the tesseract consists of eight cubical cells, meeting at right angles.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 5 queries and 3 candidates examined (receipt 3369dc9fa322). - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
-
Theorem · main statement
✕Not formalized
The tesseract is one of the six convex regular 4-polytopes.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 3 queries and 0 candidates examined (receipt 2fae91a3ca2a). - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: upheld.
Related, but states something else
MathlibExt.Geometry.PlatonicClassificationWanted.Geometry.PlatonicClassification.platonic_classification related
theorem MathlibExt.Geometry.PlatonicClassificationWanted.Geometry.PlatonicClassification.platonic_classification : MathlibExt.Geometry.PlatonicClassificationWanted.Geometry.PlatonicClassification.platonicCount 2 = ⊤ ∧ MathlibExt.Geometry.PlatonicClassificationWanted.Geometry.PlatonicClassification.platonicCount 3 = 5 ∧ MathlibExt.Geometry.PlatonicClassificationWanted.Geometry.PlatonicClassification.platonicCount …
Full type, as Lean prints it
MathlibExt.Geometry.PlatonicClassificationWanted.Geometry.PlatonicClassification.platonicCount 2 = ⊤ ∧ MathlibExt.Geometry.PlatonicClassificationWanted.Geometry.PlatonicClassification.platonicCount 3 = 5 ∧ MathlibExt.Geometry.PlatonicClassificationWanted.Geometry.PlatonicClassification.platonicCount 4 = 6 ∧ ∀ (d : ℕ), 5 ≤ d → MathlibExt.Geometry.PlatonicClassificationWanted.Geometry.PlatonicClassification.platonicCount d = 3
WantedExt.Geometry.PlatonicClassificationWanted · line 148
How it differs: The universe carries no declaration for the tesseract, so that the tesseract belongs to those six is not stated anywhere.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack, which downgraded it. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
64c2773. - Location key
665ccc234af4 · pair key 1c5aaf5b8170.
Sign in to tag this passage
-
Notation · supporting
✕Not formalized
The tesseract is also called an 8-cell, C8, (regular) octachoron, or cubic prism.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 3 queries and 1 candidates examined (receipt 33ddcdbe8b2d). - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
-
Definition · supporting
◔Partial
Partial: Mathlib states a more general result, but as a proved theorem, not a definition; a definition passage is formalized only by a Lean definition.
It is the four-dimensional measure polytope, taken as a unit for hypervolume.[2]
Show in article · Read it in context on Wikipedia ↗
MeasureTheory.addHaarMeasure_eq_volume_pi more general
theorem MeasureTheory.addHaarMeasure_eq_volume_pi (ι : Type*) [Fintype ι] : MeasureTheory.Measure.addHaarMeasure (TopologicalSpace.PositiveCompacts.piIcc01 ι) = MeasureTheory.MeasureSpace.volume
Mathlib.MeasureTheory.Measure.Lebesgue.EqHaar · lines 117–121
Why more general: The declaration states it for every finite index type and bundles the cube as a compact set with nonempty interior.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: it survived. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
a4b28dd59630 · pair key cb99cff75592.
Related, but states something else
Real.volume_Icc_pi related
theorem Real.volume_Icc_pi {ι : Type*} [Fintype ι] {a b : ι → ℝ} : MeasureTheory.MeasureSpace.volume (Set.Icc a b) = ∏ i, ENNReal.ofReal (b i - a i)
Mathlib.MeasureTheory.Measure.Lebesgue.Basic · lines 236–238
How it differs: It gives the volume of a box as a product of its side lengths; reaching the unit of hypervolume still needs that product evaluated.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. - Not re-checked: sampled out of challenge run
chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
eb26c38a7c6f · pair key f62840649ede.
Sign in to tag this passage
-
Notation · supporting
✕Not formalized
Harold Scott MacDonald Coxeter labels it the γ4 polytope.[3]
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 3 queries and 1 candidates examined (receipt fca722828dcd). - Not re-checked: sampled out of challenge run
chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Sign in to tag this passage
-
Construction · supporting · Construction
✓Formalized
Formalized: Mathlib states a more general result (a definition).
The construction of a tesseract can be visualized through the analogy of dimensions in the following steps:
One can take out two points with a certain length that form a line segment.
Show in article · Read it in context on Wikipedia ↗
segment more general
def segment (𝕜 : Type*) {E : Type*} [Semiring 𝕜] [PartialOrder 𝕜] [AddCommMonoid E] [SMul 𝕜 E] : E → E → Set E
Mathlib.Analysis.Convex.Segment · lines 50–51
Why more general: The library defines the segment over arbitrary ordered scalars and any module, and the distance between the endpoints is free.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. - Not re-checked: sampled out of challenge run
chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
af509422f188 · pair key d4b73632f334.
Related, but states something else
convexHull_pair related
theorem convexHull_pair {𝕜 : Type*} {E : Type*} [Semiring 𝕜] [PartialOrder 𝕜] [AddCommMonoid E] [_root_.Module 𝕜 E] [IsOrderedRing 𝕜] (x y : E) : (convexHull 𝕜) {x, y} = segment 𝕜 x y
Mathlib.Analysis.Convex.Hull · lines 122–126
How it differs: It only matches the segment with the convex hull of the two endpoints, a link between two descriptions of one set.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. - Not re-checked: sampled out of challenge run
chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
38f64dcfdb31 · pair key 8d3c4874c93c.
Sign in to tag this passage
-
Construction · supporting · Construction
✓Formalized
Formalized: ATLAS (atlas-lean) states a more general result (a definition).
If another identical line segment is its length in a perpendicular direction from itself, it sweeps out and forms a square (2-cube).
Show in article · Read it in context on Wikipedia ↗
unitCube more general
def unitCube (d : ℕ) : Set (Fin d → ℝ)
MathlibExt.Topology.MetricSpace.LipschitzParametrizable · line 40
Why more general: The library assembles the square as a product of unit intervals rather than as the swept translate of a segment, and fixes the side at one.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 1 for this passage, low confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: it survived. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
64c2773. - Location key
2af89243c806 · pair key c84776cf83d0.
Related, but states something else
segment_translate_image related
theorem segment_translate_image (𝕜 : Type*) {E : Type*} [Ring 𝕜] [PartialOrder 𝕜] [AddRightMono 𝕜] [AddCommGroup E] [_root_.Module 𝕜 E] (a b c : E) : (fun x ↦ a + x) '' segment 𝕜 b c = segment 𝕜 (a + b) (a + c)
Mathlib.Analysis.Convex.Segment · lines 279–280
How it differs: It says a translate of a segment is again a segment, not that the region swept out is a square.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. - Not re-checked: sampled out of challenge run
chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
04de4ffaf6ce · pair key ac2b5428b20f.
Sign in to tag this passage
-
Theorem · supporting · Construction
◔Partial
Partial: TauCeti states part of this (proved).
The results have four points and four line segments, which are called vertices and edges, respectively.
Show in article · Read it in context on Wikipedia ↗
TauCeti.PlumbingGraph.card_cubeVertices states part
theorem TauCeti.PlumbingGraph.card_cubeVertices {V : Type*} [DecidableEq V] [DecidableEq (V → ℤ)] (x : V → ℤ) (S : Finset V) : (TauCeti.PlumbingGraph.cubeVertices x S).card = 2 ^ S.card
TauCeti.LowDimTopology.Plumbing.Cube.Cardinality · lines 119–122
Why only part: The declaration counts the corners of an axis-parallel lattice cube in any dimension; at two directions that count is four, but it says nothing about the joining segments and introduces no naming.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 1 for this passage, low confidence. - Not re-checked: sampled out of challenge run
chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
83245ab. - Location key
61d50ec4b687 · pair key eb65fd3b48ff.
Sign in to tag this passage
-
Construction · supporting · Construction
✕Not formalized
Moving the square with the same length in the direction perpendicular to the plane it lies on generates a cube (3-cube).
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 4 queries and 0 candidates examined (receipt f3c4554e05b3). - Not re-checked: sampled out of challenge run
chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Related, but states something else
TauCeti.SingularCube.prism related
def TauCeti.SingularCube.prism {X : Type*} {Y : Type*} [TopologicalSpace X] [TopologicalSpace Y] {f g : C(X, Y)} : f.Homotopy g → {n : ℕ} → TauCeti.SingularCube X n → TauCeti.SingularCube Y (n + 1)
TauCeti.AlgebraicTopology.Singular.Cubical.Prism · lines 43–46
How it differs: This builds a singular cube of one higher dimension out of a homotopy between two continuous maps, so it is about sweeping maps into a space, not about the solid figure a moving square traces out.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. - Not re-checked: sampled out of challenge run
chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
83245ab. - Location key
5cd90940386a · pair key d8a49451c15c.
Sign in to tag this passage
-
Theorem · supporting · Construction
◔Partial
Partial: TauCeti states part of this (proved).
The results have eight vertices, twelve edges, and six squares.
Show in article · Read it in context on Wikipedia ↗
TauCeti.PlumbingGraph.card_cubeVertices states part
theorem TauCeti.PlumbingGraph.card_cubeVertices {V : Type*} [DecidableEq V] [DecidableEq (V → ℤ)] (x : V → ℤ) (S : Finset V) : (TauCeti.PlumbingGraph.cubeVertices x S).card = 2 ^ S.card
TauCeti.LowDimTopology.Plumbing.Cube.Cardinality · lines 119–122
Why only part: The declaration counts corners of an axis-parallel lattice cube in any dimension; at three directions that count is eight, while the twelve edges and six bounding squares are nowhere counted in the universe.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 1 for this passage, low confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: it survived. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
83245ab. - Location key
73ed4a11fb64 · pair key d0232592e9d4.
Sign in to tag this passage
-
Definition · supporting · Construction
✕Not formalized
The squares are called the faces.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 4 queries and 0 candidates examined (receipt 554c420f71bf). - Not re-checked: sampled out of challenge run
chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Related, but states something else
TauCeti.PlumbingCube.lowerFace related
def TauCeti.PlumbingCube.lowerFace {V : Type*} [DecidableEq V] (C : TauCeti.PlumbingCube V) (v : V) : v ∈ C.directions → TauCeti.PlumbingCube V
TauCeti.LowDimTopology.Plumbing.Cube.Generator · lines 106–108
How it differs: It names the codimension-one face of a lattice cube at the lower end of one chosen direction, so it supplies a notion of face in every dimension without identifying the collection the article names.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. - Not re-checked: sampled out of challenge run
chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
83245ab. - Location key
e9161a30eff4 · pair key 3a0023e55995.
TauCeti.PlumbingCube.upperFace related
def TauCeti.PlumbingCube.upperFace {V : Type*} [DecidableEq V] (C : TauCeti.PlumbingCube V) (v : V) : v ∈ C.directions → TauCeti.PlumbingCube V
TauCeti.LowDimTopology.Plumbing.Cube.Generator · lines 112–115
How it differs: It is the companion construction at the opposite end of a direction, again a face-forming operation in every dimension rather than a statement about how many squares bound a cube.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. - Not re-checked: sampled out of challenge run
chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
83245ab. - Location key
9bb5400402e4 · pair key 4a8c176c10c8.
Sign in to tag this passage
-
Construction · main statement · Construction
✓Formalized
Formalized: ATLAS (atlas-lean) states a more general result (a definition).
Moving the cube with the same length again into the fourth-dimensional space generates a tesseract (4-cube).
Show in article · Read it in context on Wikipedia ↗
unitCube more general
def unitCube (d : ℕ) : Set (Fin d → ℝ)
MathlibExt.Topology.MetricSpace.LipschitzParametrizable · line 40
Why more general: The library builds the cube in every dimension as a product of unit intervals, with its side fixed at one.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: it survived. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
64c2773. - Location key
362286ddb231 · pair key b3fe08827be2.
ConvexCovering.coordinateCube more general
def ConvexCovering.coordinateCube (n : ℕ) : Set (EuclideanSpace ℝ (Fin n))
MathlibExt.Geometry.Convex.CubeCovering · line 31
Why more general: This one places the same cube in Euclidean space, and like the passage's body it exists in each dimension.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: it survived. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
64c2773. - Location key
911d23778559 · pair key f28ca0787f04.
Sign in to tag this passage
-
Theorem · main statement · Construction
✕Not formalized
A tesseract is bounded by eight cubes (its cells).
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 4 queries and 0 candidates examined (receipt f3c8b82d6aeb). - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: upheld.
Related, but states something else
Cube.boundary related
def Cube.boundary (N : Type*) : Set (N → ↑unitInterval)
Mathlib.Topology.Homotopy.HomotopyGroup · lines 60–61
How it differs: This is the set of points of a cube of coordinates indexed by any type having some coordinate at an end of the interval, which is the boundary as a point set and carries no decomposition into cubical pieces.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: it survived. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
1ce77f71c382 · pair key 694bf8868c0e.
Sign in to tag this passage
-
Theorem · supporting · Construction
✕Not formalized
Each cube shares each of its faces with another cube.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 4 queries and 0 candidates examined (receipt cf684d1bbddc). - Not re-checked: sampled out of challenge run
chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Sign in to tag this passage
-
Theorem · supporting · Construction
✕Not formalized
Three cubes and three squares meet at each edge.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 4 queries and 0 candidates examined (receipt 4aa3a187e464). - Not re-checked: sampled out of challenge run
chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Sign in to tag this passage
-
Theorem · supporting · Construction
✕Not formalized
Four cubes, six squares, and four edges meet at every vertex.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt 0b6522a0740c). - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
-
Theorem · main statement · Construction
◔Partial
Partial: TauCeti states part of this (proved).
Collectively, the tesseract consists of eight cubes, twenty-four squares, thirty-two edges, and sixteen vertices.
Show in article · Read it in context on Wikipedia ↗
TauCeti.PlumbingGraph.card_cubeVertices states part
theorem TauCeti.PlumbingGraph.card_cubeVertices {V : Type*} [DecidableEq V] [DecidableEq (V → ℤ)] (x : V → ℤ) (S : Finset V) : (TauCeti.PlumbingGraph.cubeVertices x S).card = 2 ^ S.card
TauCeti.LowDimTopology.Plumbing.Cube.Cardinality · lines 119–122
Why only part: The declaration counts the vertices of a lattice cube of any dimension, with the dimension of the passage one of its instances.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: it survived. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
83245ab. - Location key
75239c5b054c · pair key ec96efc8e1f0.
Sign in to tag this passage
-
Theorem · supporting · Construction
✕Not formalized
The tesseract, like both the square and the cube, is a member of the hypercube's family.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt 67f63ad64744). - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
-
Definition · main statement · Construction
✕Not formalized
An unfolding of a polytope is called a net.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt 6636dded2686). - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
-
Theorem · main statement · Construction
✕Not formalized
There are 261 distinct nets of the tesseract,[5] each of which can tile 3-space.[6]
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 4 queries and 3 candidates examined (receipt ce9b6a4d77b5). - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
-
Example · supporting · Construction
✕Not formalized
It consists of eight cubes, four cubes stacked vertically and four more attached to the second-from-top of the first four.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt dfa9f2d09f74). - Not re-checked: sampled out of challenge run
chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Sign in to tag this passage
-
Theorem · main statement · Properties
✕Not formalized
The eight cells of a tesseract may be regarded in three different ways as two interlocked rings of four cubes.[11]
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt 260dd8e20fbb). - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
-
Theorem · main statement · Properties
✕Not formalized
As a regular polytope with three cubes folded together around every edge, it has Schläfli symbol {4,3,3} with hyperoctahedral symmetry of order 384.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 4 queries and 3 candidates examined (receipt e8b8a63e9e53). - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
-
Theorem · supporting · Properties
✕Not formalized
Constructed as a 4D hyperprism made of two parallel cubes, it can be named as a composite Schläfli symbol {4,3} × { }, with symmetry order 96.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt 3e2710342735). - Not re-checked: sampled out of challenge run
chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Sign in to tag this passage
-
Theorem · supporting · Properties
✕Not formalized
As a 4-4 duoprism, a Cartesian product of two squares, it can be named by a composite Schläfli symbol {4}×{4}, with symmetry order 64.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 4 queries and 1 candidates examined (receipt 41d9c47a7ce2). - Not re-checked: sampled out of challenge run
chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Sign in to tag this passage
-
Theorem · supporting · Properties
✕Not formalized
As an orthotope it can be represented by composite Schläfli symbol { } × { } × { } × { } or { }4, with symmetry order 16.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt 1eeb273675a1). - Not re-checked: sampled out of challenge run
chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Sign in to tag this passage
-
Theorem · supporting · Properties
✕Not formalized
Since each vertex of a tesseract is adjacent to four edges, the vertex figure of the tesseract is a regular tetrahedron.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 4 queries and 3 candidates examined (receipt 0f299ce0c767). - Not re-checked: sampled out of challenge run
chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Sign in to tag this passage
-
Theorem · main statement · Properties
✕Not formalized
Since each vertex of a tesseract is adjacent to four edges, the vertex figure of the tesseract is a regular tetrahedron.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt a749815856e6). - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
-
Theorem · main statement · Properties
✕Not formalized
The dual polytope of the tesseract is the 16-cell with Schläfli symbol {3,3,4}.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt 5cf74dabaa88). - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
-
Theorem · main statement · Properties
✕Not formalized
The tesseract, with 16 vertices, is the convex hull of a compound of two 16-cells, with 8 vertices each, in an exact dimensional analogy to the cube, with 8 vertices, which is the convex hull of a compound of two regular tetrahedra, with 4 vertices each.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt 7d09503c37ed). - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
-
Theorem · main statement · Properties
✕Not formalized
Each edge of a regular tesseract is of the same length.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt fe3cce9b329c). - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
-
Theorem · supporting · Properties
✕Not formalized
This is of interest when using tesseracts as the basis for a network topology to link multiple processors in parallel computing: the distance between two nodes is at most 4, and there are many different paths to allow weight balancing.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 5 queries and 2 candidates examined (receipt 401d393aef1e). - Not re-checked: sampled out of challenge run
chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Related, but states something else
SimpleGraph.hypercube related
def SimpleGraph.hypercube (n : ℕ) : SimpleGraph (Fin n → Bool)
FormalConjecturesForMathlib.Combinatorics.SimpleGraph.Hypercube · lines 37–40
How it differs: This is the object the passage speaks about, defined for every dimension n.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. - Not re-checked: sampled out of challenge run
chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
e754a78. - Location key
4680d8750068 · pair key 68fb130305ab.
SimpleGraph.hypercubeGraph related
def SimpleGraph.hypercubeGraph (n : ℕ) : SimpleGraph (Fin n → Bool)
MathlibExt.Combinatorics.SimpleGraph.HypercubeExtremal · line 37
How it differs: A second copy of the same object, used for extremal questions about subgraphs.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: it survived. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
64c2773. - Location key
4d8ad8b31a1e · pair key 2af75fce33f8.
SimpleGraph.diam related
def SimpleGraph.diam {α : Type*} : SimpleGraph α → ℕ
Mathlib.Combinatorics.SimpleGraph.Diam · lines 265–266
How it differs: The notion a bound of four would be phrased with, for an arbitrary graph.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 3 for this passage, high confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: it survived. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
a7c0ef1526d8 · pair key 1de2f743a27a.
Sign in to tag this passage
-
Theorem · supporting · Properties
✕Not formalized
The tesseract can be decomposed into smaller 4-polytopes.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt d5c2a0049655). - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
-
Theorem · supporting · Properties
✕Not formalized
It is the convex hull of the compound of two demitesseracts (16-cells).
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt a864439a7313). - Not re-checked: sampled out of challenge run
chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Sign in to tag this passage
-
Theorem · supporting · Properties
✕Not formalized
It can also be triangulated into 4-dimensional simplices (irregular 5-cells) that share their vertices with the tesseract.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt c681d6b246a5). - Not re-checked: sampled out of challenge run
chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Sign in to tag this passage
-
Theorem · main statement · Properties
✕Not formalized
It is known that there are 92487256 such triangulations[12] and that the fewest 4-dimensional simplices in any of them is 16.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt b4337414c6d1). - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
-
Construction · main statement · Properties
✕Not formalized
The dissection of the tesseract into instances of its characteristic simplex (a particular orthoscheme with Coxeter diagram ) is the most basic direct construction of the tesseract possible.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt 0b6ea7fa7303). - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
-
Definition · main statement · Properties
✕Not formalized
The characteristic 5-cell of the 4-cube is a fundamental region of the tesseract's defining symmetry group, the group which generates the B4 polytopes.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt 0888018a6edb). - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: upheld.
Related, but states something else
MeasureTheory.IsFundamentalDomain related
structure MeasureTheory.IsFundamentalDomain (G : Type*) {α : Type*} [One G] [SMul G α] [MeasurableSpace α] : Set α → autoParam (MeasureTheory.Measure α) MeasureTheory.IsFundamentalDomain._auto_1 → Prop
Mathlib.MeasureTheory.Group.FundamentalDomain · lines 69–73
How it differs: This is the general measure-theoretic notion, exact only up to null sets.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: it survived. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
ad99d39581fa · pair key d8f520fdbccc.
TauCeti.existsUnique_mem_orbit_inter_dominantChamber_of_finite_weylGroup related
theorem TauCeti.existsUnique_mem_orbit_inter_dominantChamber_of_finite_weylGroup {ι : Type u} {R : Type v} {M : Type w} {N : Type x} [CommRing R] [AddCommGroup M] [_root_.Module R M] [AddCommGroup N] [_root_.Module R N] (P : RootPairing ι R M N) (b : P.Base) [LinearOrder R] [IsStrictOrderedRing R] [Finite ι] [P.IsCrystallographic] [P.IsReduced] [P.flip.IsReduced] [Finite ↥P.weylGroup] (x : M) : ∃! y, y ∈ MulAction.orbit (↥P.weylGroup) x ∩ P.dominantChamber b
TauCeti.LinearAlgebra.RootSystem.FundamentalDomain · lines 224–228
How it differs: Its region is the dominant chamber, an unbounded cone, not the bounded 5-cell.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: it survived. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
83245ab. - Location key
c92736ac5a9a · pair key 40bc01e174d0.
CoxeterMatrix.B related
def CoxeterMatrix.B (n : ℕ) : CoxeterMatrix (Fin n)
Mathlib.GroupTheory.Coxeter.Matrix · lines 123–130
How it differs: At the index four this is the Coxeter datum of the group the passage names.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 3 for this passage, high confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: it survived. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
ee5736960867 · pair key 0d5c77da92b1.
Sign in to tag this passage
-
Theorem · main statement · Properties
✕Not formalized
The tesseract's characteristic simplex directly generates the tesseract through the actions of the group, by reflecting itself in its own bounding facets (its mirror walls).
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt e368d7debfa7). - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: upheld.
Related, but states something else
RootPairing.exists_mem_dominantChamber_of_finite_weylGroup related
theorem RootPairing.exists_mem_dominantChamber_of_finite_weylGroup {ι : Type u} {R : Type v} {M : Type w} {N : Type x} [CommRing R] [AddCommGroup M] [_root_.Module R M] [AddCommGroup N] [_root_.Module R N] (P : RootPairing ι R M N) (b : P.Base) [Finite ι] [CharZero R] [IsDomain R] [P.IsCrystallographic] [P.IsReduced] [LinearOrder R] [IsOrderedAddMonoid R] [Finite ↥P.weylGroup] (x : M) : ∃ w, w • x ∈ P.dominantChamber b
TauCeti.LinearAlgebra.RootSystem.Chamber · lines 268–277
How it differs: Its sweep fills the whole ambient module, not a bounded polytope.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: it survived. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
83245ab. - Location key
465efcc914a7 · pair key b453a0b164f7.
TauCeti.iUnion_smul_dirichletDomain related
theorem TauCeti.iUnion_smul_dirichletDomain {G : Type*} {X : Type*} [PseudoMetricSpace X] [Group G] [MulAction G X] [IsIsometricSMul G X] [ProperSpace X] [ProperlyDiscontinuousSMul G X] (p : X) : ⋃ g, g • TauCeti.dirichletDomain G p = Set.univ
TauCeti.MeasureTheory.Group.DirichletDomain.Basic · lines 252–255
How it differs: The region swept out is the whole metric space rather than the 4-cube.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: it survived. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
83245ab. - Location key
493fc0f8dac7 · pair key 98f930ddf7b2.
Sign in to tag this passage
-
Definition · main statement · Properties › Unit tesseract
✓Formalized
Formalized: ATLAS (atlas-lean) states a more general result (a definition).
A unit tesseract has side length 1, and is typically taken as the basic unit for hypervolume in 4-dimensional space.
Show in article · Read it in context on Wikipedia ↗
unitCube more general
def unitCube (d : ℕ) : Set (Fin d → ℝ)
MathlibExt.Topology.MetricSpace.LipschitzParametrizable · line 40
Why more general: Lean fixes the closed unit cube in every dimension at once, and dimension four is the article's case.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: it survived. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
64c2773. - Location key
d1e34e159960 · pair key 7c335bf1a9c0.
MeasureTheory.addHaarMeasure_eq_volume_pi states part
theorem MeasureTheory.addHaarMeasure_eq_volume_pi (ι : Type*) [Fintype ι] : MeasureTheory.Measure.addHaarMeasure (TopologicalSpace.PositiveCompacts.piIcc01 ι) = MeasureTheory.MeasureSpace.volume
Mathlib.MeasureTheory.Measure.Lebesgue.EqHaar · lines 117–121
Why only part: Lean normalises the volume of four real coordinates by the cube of unit side.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: it survived. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
8e5d12fc6b78 · pair key 18fe9b007746.
Sign in to tag this passage
-
Theorem · supporting · Properties › Unit tesseract
✕Not formalized
The unit tesseract in a Cartesian coordinate system for 4-dimensional space has two opposite vertices at coordinates [0, 0, 0, 0] and [1, 1, 1, 1], and other vertices with coordinates at all possible combinations of 0s and 1s.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 4 queries and 0 candidates examined (receipt cbf90b883572). - Not re-checked: sampled out of challenge run
chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Sign in to tag this passage
-
Theorem · supporting · Properties › Unit tesseract
✓Formalized
Formalized: ATLAS (atlas-lean) states a more general result (a definition).
It is the Cartesian product of the closed unit interval [0, 1] in each axis.
Show in article · Read it in context on Wikipedia ↗
unitCube more general
def unitCube (d : ℕ) : Set (Fin d → ℝ)
MathlibExt.Topology.MetricSpace.LipschitzParametrizable · line 40
Why more general: Lean builds this set for every dimension as the tuples whose coordinates all lie in the closed unit interval.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. - Not re-checked: sampled out of challenge run
chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
64c2773. - Location key
7dd43e308071 · pair key 3b438a1c687f.
Related, but states something else
Set.pi_univ_Icc related
theorem Set.pi_univ_Icc {ι : Type*} {α : ι → Type*} [(i : ι) → Preorder (α i)] (x y : (i : ι) → α i) : (Set.univ.pi fun i ↦ Set.Icc (x i) (y i)) = Set.Icc x y
Mathlib.Order.Interval.Set.Pi · lines 40–41
How it differs: It rewrites a product of coordinate intervals as an order interval of the product type.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. - Not re-checked: sampled out of challenge run
chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
ae01bbb835a3 · pair key f7fbc5557611.
Sign in to tag this passage
-
Definition · supporting · Properties › Unit tesseract
✕Not formalized
Sometimes a unit tesseract is centered at the origin, so that its coordinates are the more symmetrical (±12, ±12, ±12, ±12). This is the Cartesian product of the closed interval [−12, 12] in each axis.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 3 queries and 0 candidates examined (receipt 3bc62276f568). - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: upheld.
Related, but states something else
MathlibExt.Probability.IsotropicConstant.coordinateCube_benchmark related
theorem MathlibExt.Probability.IsotropicConstant.coordinateCube_benchmark (n : ℕ) : 0 < n → ∃ K, ↑K.body = {x | ∀ (i : Fin n), -(1 / 2) ≤ x.ofLp i ∧ x.ofLp i ≤ 1 / 2} ∧ MeasureTheory.MeasureSpace.volume ↑K.body = 1 ∧ MathlibExt.Probability.IsotropicConstant.bodyIsotropicConstant K = 1 / √12
WantedExt.Probability.IsotropicConstantBoundsWanted · line 129
How it differs: It asserts a convex body of volume one whose points have every coordinate between minus and plus one half.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. - Not re-checked: sampled out of challenge run
chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
64c2773. - Location key
2b21d7969db4 · pair key 2eb4b7bae159.
Sign in to tag this passage
-
Theorem · supporting · Properties › Unit tesseract
✕Not formalized
With community edits: Not formalized. As published it is Formalized.
Sometimes a unit tesseract is centered at the origin, so that its coordinates are the more symmetrical (±12, ±12, ±12, ±12). This is the Cartesian product of the closed interval [−12, 12] in each axis.
Show in article · Read it in context on Wikipedia ↗
Related, but states something else
closedBall_pi related
theorem closedBall_pi {β : Type*} {X : β → Type*} [Fintype β] [(b : β) → PseudoMetricSpace (X b)] (x : (b : β) → X b) {r : ℝ} : 0 ≤ r → Metric.closedBall x r = Set.univ.pi fun b ↦ Metric.closedBall (x b) r
Mathlib.Topology.MetricSpace.Pseudo.Pi · lines 125–128
Community Agent The pipeline said more general; changed by Meta FAIR 2 (agent) — owned by Jack McCarthy on 9 Nov 2026.
How it differs: closedBall_pi says a closed ball in a finite product of metric spaces, under the sup distance, is the product of closed balls in the factors. The passage says the origin-centred unit tesseract, with vertices at plus or minus one half, is the product of [-1/2, 1/2] in each axis. The lemma only gives this once the tesseract is identified with a sup-metric ball, and it says nothing about the cube's vertices.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: it survived. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
66a8fca8cbcb · pair key b720453baf67.
MathlibExt.Probability.IsotropicConstant.coordinateCube_benchmark related
theorem MathlibExt.Probability.IsotropicConstant.coordinateCube_benchmark (n : ℕ) : 0 < n → ∃ K, ↑K.body = {x | ∀ (i : Fin n), -(1 / 2) ≤ x.ofLp i ∧ x.ofLp i ≤ 1 / 2} ∧ MeasureTheory.MeasureSpace.volume ↑K.body = 1 ∧ MathlibExt.Probability.IsotropicConstant.bodyIsotropicConstant K = 1 / √12
WantedExt.Probability.IsotropicConstantBoundsWanted · line 129
How it differs: It records the volume and the isotropic constant of the centred coordinate cube in each positive dimension.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. - Not re-checked: sampled out of challenge run
chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
64c2773. - Location key
82d067f012b3 · pair key 703c4ebb41b8.
Sign in to tag this passage
-
Definition · supporting · Properties › Unit tesseract
✕Not formalized
Another commonly convenient tesseract is the Cartesian product of the closed interval [−1, 1] in each axis, with vertices at coordinates (±1, ±1, ±1, ±1).
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 3 queries and 0 candidates examined (receipt b75ca4f3d1f0). - Not re-checked: sampled out of challenge run
chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Related, but states something else
TauCeti.isConvexPolyhedron_pi_Icc related
theorem TauCeti.isConvexPolyhedron_pi_Icc {ι : Type*} [Finite ι] (a b : ι → ℝ) : TauCeti.IsConvexPolyhedron (Set.univ.pi fun i ↦ Set.Icc (a i) (b i))
TauCeti.Analysis.Convex.Polyhedron.Pi.Basic · lines 31–40
How it differs: It shows that a box cut out by finitely many coordinate bounds is a convex polyhedron.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. - Not re-checked: sampled out of challenge run
chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
83245ab. - Location key
d8aad8e104fc · pair key f4954e63ec2a.
Sign in to tag this passage
-
Theorem · supporting · Properties › Unit tesseract
◔Partial
Partial: Mathlib states part of this (proved).
This tesseract has side length 2 and hypervolume 24 = 16.
Show in article · Read it in context on Wikipedia ↗
Real.volume_Icc_pi states part
theorem Real.volume_Icc_pi {ι : Type*} [Fintype ι] {a b : ι → ℝ} : MeasureTheory.MeasureSpace.volume (Set.Icc a b) = ∏ i, ENNReal.ofReal (b i - a i)
Mathlib.MeasureTheory.Measure.Lebesgue.Basic · lines 236–238
Why only part: Lean gives the measure of any coordinate box as the product of its edge lengths, over any finite index type.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. - Not re-checked: sampled out of challenge run
chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
7c6e80acfe20 · pair key 9720d05a87d5.
Related, but states something else
Real.diam_Icc related
theorem Real.diam_Icc {a b : ℝ} : a ≤ b → Metric.diam (Set.Icc a b) = b - a
Mathlib.Topology.Instances.ENNReal.Lemmas · lines 729–730
How it differs: It gives the diameter of a real interval, which is two for the factor from minus one to one.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. - Not re-checked: sampled out of challenge run
chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
687347aabf15 · pair key 3c714c9e0c7b.
Sign in to tag this passage
-
Definition · supporting · Properties › Radial equilateral symmetry
◔Partial
Partial: Mathlib states a special case (proved).
The radius of a hypersphere circumscribed about a regular polytope is the distance from the polytope's center to one of the vertices, and for the tesseract this radius is equal to its edge length; the diameter of the sphere, the length of the diagonal between opposite vertices of the tesseract, is twice the edge length.
Show in article · Read it in context on Wikipedia ↗
Affine.Simplex.dist_circumcenter_eq_circumradius special case
theorem Affine.Simplex.dist_circumcenter_eq_circumradius {V : Type*} {P : Type*} [NormedAddCommGroup V] [InnerProductSpace ℝ V] [MetricSpace P] [NormedAddTorsor V P] {n : ℕ} (s : Affine.Simplex ℝ P n) (i : Fin (n + 1)) : Dist.dist (s.points i) s.circumcenter = s.circumradius
Mathlib.Geometry.Euclidean.Circumcenter · lines 230–232
Why a special case: Lean states this for every simplex in a real inner-product space, and the regular simplices among them are regular polytopes of the kind the passage speaks of.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. - Not re-checked: sampled out of challenge run
chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
3b902e562fc5 · pair key 6d819b9fb6e5.
Affine.Simplex.circumradius special case
def Affine.Simplex.circumradius {V : Type*} {P : Type*} [NormedAddCommGroup V] [InnerProductSpace ℝ V] [MetricSpace P] [NormedAddTorsor V P] {n : ℕ} : Affine.Simplex ℝ P n → ℝ
Mathlib.Geometry.Euclidean.Circumcenter · lines 209–210
Why a special case: Lean defines the quantity as the radius of the circumsphere of a simplex.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. - Not re-checked: sampled out of challenge run
chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
fd26d0133e8e · pair key 94b7c2bf4ae4.
Sign in to tag this passage
-
Theorem · main statement · Properties › Radial equilateral symmetry
✕Not formalized
The radius of a hypersphere circumscribed about a regular polytope is the distance from the polytope's center to one of the vertices, and for the tesseract this radius is equal to its edge length; the diameter of the sphere, the length of the diagonal between opposite vertices of the tesseract, is twice the edge length.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt 054827e92b50). - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
-
Theorem · supporting · Properties › Radial equilateral symmetry
✕Not formalized
The radius of a hypersphere circumscribed about a regular polytope is the distance from the polytope's center to one of the vertices, and for the tesseract this radius is equal to its edge length; the diameter of the sphere, the length of the diagonal between opposite vertices of the tesseract, is twice the edge length.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 3 queries and 1 candidates examined (receipt a69ee3c2aee4). - Not re-checked: sampled out of challenge run
chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Related, but states something else
EuclideanGeometry.Sphere.IsDiameter.dist_left_right related
theorem EuclideanGeometry.Sphere.IsDiameter.dist_left_right {V : Type*} {P : Type*} [NormedAddCommGroup V] [NormedSpace ℝ V] [MetricSpace P] [NormedAddTorsor V P] {s : EuclideanGeometry.Sphere P} {p₁ p₂ : P} : s.IsDiameter p₁ p₂ → Dist.dist p₁ p₂ = 2 * s.radius
Mathlib.Geometry.Euclidean.Sphere.Basic · lines 308–310
How it differs: It gives twice the sphere's radius for an antipodal pair; turning that into twice the edge length still needs the separate fact that a tesseract's circumradius is its edge.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. - Not re-checked: sampled out of challenge run
chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
363293d15153 · pair key 45beaea7028f.
Sign in to tag this passage
-
Theorem · supporting · Properties › Radial equilateral symmetry
✕Not formalized
Only a few uniform polytopes have this property, including the four-dimensional tesseract and 24-cell, the three-dimensional cuboctahedron, and the two-dimensional hexagon.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt 90a3894e83d3). - Not re-checked: sampled out of challenge run
chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Sign in to tag this passage
-
Theorem · supporting · Properties › Radial equilateral symmetry
✕Not formalized
Only a few uniform polytopes have this property, including the four-dimensional tesseract and 24-cell, the three-dimensional cuboctahedron, and the two-dimensional hexagon.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt fc9b23939357). - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
-
Theorem · supporting · Properties › Radial equilateral symmetry
✕Not formalized
Only a few uniform polytopes have this property, including the four-dimensional tesseract and 24-cell, the three-dimensional cuboctahedron, and the two-dimensional hexagon.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 3 queries and 1 candidates examined (receipt b1dca8a5650d). - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
-
Theorem · supporting · Properties › Radial equilateral symmetry
✕Not formalized
Only a few uniform polytopes have this property, including the four-dimensional tesseract and 24-cell, the three-dimensional cuboctahedron, and the two-dimensional hexagon.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 3 queries and 1 candidates examined (receipt 2b801f7e6dad). - Not re-checked: sampled out of challenge run
chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Sign in to tag this passage
-
Theorem · supporting · Properties › Radial equilateral symmetry
✕Not formalized
Only a few uniform polytopes have this property, including the four-dimensional tesseract and 24-cell, the three-dimensional cuboctahedron, and the two-dimensional hexagon.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt 33093e80bc0c). - Not re-checked: sampled out of challenge run
chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Sign in to tag this passage
-
Theorem · main statement · Properties › Radial equilateral symmetry
✕Not formalized
In particular, the tesseract is the only hypercube (other than a zero-dimensional point) that is radially equilateral.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt e56a016c3897). - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
-
Theorem · main statement · Properties › Radial equilateral symmetry
✕Not formalized
The longest vertex-to-vertex diagonal of an n -dimensional hypercube of unit edge length is √n, which for the square is √2, for the cube is √3, and only for the tesseract is √4 = 2 edge lengths.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 5 queries and 4 candidates examined (receipt e9b95c7b4627). - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
-
Theorem · supporting · Properties › Radial equilateral symmetry
✕Not formalized
The longest vertex-to-vertex diagonal of an n -dimensional hypercube of unit edge length is √n, which for the square is √2, for the cube is √3, and only for the tesseract is √4 = 2 edge lengths.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 4 queries and 3 candidates examined (receipt 48830dac6837). - Not re-checked: sampled out of challenge run
chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Sign in to tag this passage
-
Theorem · supporting · Properties › Radial equilateral symmetry
✕Not formalized
The longest vertex-to-vertex diagonal of an n -dimensional hypercube of unit edge length is √n, which for the square is √2, for the cube is √3, and only for the tesseract is √4 = 2 edge lengths.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 4 queries and 3 candidates examined (receipt 0d010a600dee). - Not re-checked: sampled out of challenge run
chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Sign in to tag this passage
-
Theorem · supporting · Properties › Radial equilateral symmetry
✕Not formalized
The longest vertex-to-vertex diagonal of an n -dimensional hypercube of unit edge length is √n, which for the square is √2, for the cube is √3, and only for the tesseract is √4 = 2 edge lengths.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 4 queries and 3 candidates examined (receipt 899de0b826f3). - Not re-checked: sampled out of challenge run
chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Sign in to tag this passage
-
Theorem · supporting · Properties › Radial equilateral symmetry
✕Not formalized
An axis-aligned tesseract inscribed in a unit-radius 3-sphere has vertices with coordinates (±12, ±12, ±12, ±12).
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 4 queries and 3 candidates examined (receipt d581a63aff72). - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
-
Theorem · main statement · Properties › Formulas
✓Formalized
Formalized: Mathlib states a more general result (proved).
For a tesseract with side length s:
Hypervolume (4D): H = s4
Show in article · Read it in context on Wikipedia ↗
Real.volume_Icc_pi more general
theorem Real.volume_Icc_pi {ι : Type*} [Fintype ι] {a b : ι → ℝ} : MeasureTheory.MeasureSpace.volume (Set.Icc a b) = ∏ i, ENNReal.ofReal (b i - a i)
Mathlib.MeasureTheory.Measure.Lebesgue.Basic · lines 236–238
Why more general: The declaration computes the Lebesgue measure of an arbitrary coordinate box as the product of its edge lengths over any finite index type; the passage is the case of four coordinates with all four edges equal.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: it survived. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
de6ac7ea64ba · pair key e6cf988ae28a.
TauCeti.volume_dyadicCube special case
theorem TauCeti.volume_dyadicCube {ι : Type*} [Fintype ι] (k : ℤ) (m : ι → ℤ) : MeasureTheory.MeasureSpace.volume (TauCeti.dyadicCube k m) = ENNReal.ofReal ((2 ^ k) ^ Fintype.card ι)
TauCeti.MeasureTheory.Measure.Lebesgue.DyadicCube · lines 174–179
Why a special case: Its cubes are the dyadic ones, so the side length is restricted to the powers of two and the box is half-open, which is the passage at special edge lengths rather than at an arbitrary one.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: it survived. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
83245ab. - Location key
abb792a9df09 · pair key 4f09420bc6dc.
Sign in to tag this passage
-
Theorem · main statement · Properties › Formulas
✕Not formalized
Hypervolume (4D): H = s4
Surface "volume" (3D): SV = 8s3
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 3 queries and 3 candidates examined (receipt 577a7868e80e). - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
-
Theorem · supporting · Properties › Formulas
✕Not formalized
Surface "volume" (3D): SV = 8s3
Face diagonal: d2 = √2s
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 3 queries and 3 candidates examined (receipt a991b0e6d678). - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
-
Theorem · supporting · Properties › Formulas
✕Not formalized
Face diagonal: d2 = √2s
Cell diagonal: d3 = √3s
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt 0d243fe9c460). - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
-
Theorem · supporting · Properties › Formulas
✕Not formalized
Cell diagonal: d3 = √3s
4-space diagonal: d4 = 2s
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt 38508130c68d). - Not re-checked: sampled out of challenge run
chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Sign in to tag this passage
-
Notation · main statement · Properties › As a configuration
✕Not formalized
The tesseract can be represented by configuration matrix [16464232334424281268]. Here, the rows and columns correspond to vertices, edges, faces, and cells.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt bda48d3cd208). - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
-
Notation · supporting · Properties › As a configuration
✕Not formalized
The tesseract can be represented by configuration matrix [16464232334424281268]. Here, the rows and columns correspond to vertices, edges, faces, and cells.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 4 queries and 1 candidates examined (receipt 7790798624cb). - Not re-checked: sampled out of challenge run
chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Sign in to tag this passage
-
Theorem · supporting · Properties › As a configuration
✕Not formalized
The diagonal numbers say how many of each element occur in the whole tesseract, which reduces to the f-vector (16, 32, 24, 8).
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt 486626a07c8e). - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
-
Notation · supporting · Properties › As a configuration
✕Not formalized
The nondiagonal numbers say how many of the column's element occur in or at the row's element.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 4 queries and 1 candidates examined (receipt 938906dac891). - Not re-checked: sampled out of challenge run
chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Sign in to tag this passage
-
Theorem · supporting · Properties › As a configuration
✕Not formalized
For example, the 2 in the first column of the second row indicates that there are two vertices in (i.e., at the extremes of) each edge; the 4 in the second column of the first row indicates that four edges meet at each vertex.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 3 queries and 1 candidates examined (receipt d3835496bef7). - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
-
Theorem · supporting · Properties › As a configuration
✕Not formalized
For example, the 2 in the first column of the second row indicates that there are two vertices in (i.e., at the extremes of) each edge; the 4 in the second column of the first row indicates that four edges meet at each vertex.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt cb78a88e3d2b). - Not re-checked: sampled out of challenge run
chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Sign in to tag this passage
-
Theorem · supporting · Properties › As a configuration
✕Not formalized
The bottom row defines they facets, here cubes, have f-vector (8, 12, 6).
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt 757231ec875e). - Not re-checked: sampled out of challenge run
chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Sign in to tag this passage
-
Theorem · supporting · Properties › As a configuration
✕Not formalized
The next row left of diagonal is ridge elements (facet of cube), here a square, (4, 4).
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 3 queries and 1 candidates examined (receipt 7690f315d082). - Not re-checked: sampled out of challenge run
chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Sign in to tag this passage
-
Theorem · supporting · Properties › As a configuration
✕Not formalized
The upper row is the f-vector of the vertex figure, here tetrahedra, (4, 6, 4).
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt 9fcd94dcdf9a). - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
-
Theorem · supporting · Properties › As a configuration
✕Not formalized
The next row is vertex figure ridge, here a triangle, (3, 3).
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 3 queries and 1 candidates examined (receipt eadcd8be8dca). - Not re-checked: sampled out of challenge run
chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Sign in to tag this passage
-
Theorem · main statement · Projections
✕Not formalized
The rhombic dodecahedron forms the convex hull of the tesseract's vertex-first parallel-projection.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt 83bbb30558a0). - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
-
Theorem · supporting · Projections
✕Not formalized
The number of vertices in the layers of this projection is 1 4 6 4 1—the fourth row in Pascal's triangle.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt 76d855f35bc9). - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
-
Theorem · main statement · Projections
✕Not formalized
The cell-first parallel projection of the tesseract into three-dimensional space has a cubical envelope.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt a190ed62177d). - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
-
Theorem · supporting · Projections
✕Not formalized
The nearest and farthest cells are projected onto the cube, and the remaining six cells are projected onto the six square faces of the cube.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt d709e9713a13). - Not re-checked: sampled out of challenge run
chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Sign in to tag this passage
-
Theorem · supporting · Projections
✕Not formalized
The nearest and farthest cells are projected onto the cube, and the remaining six cells are projected onto the six square faces of the cube.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt b0041bf5a83f). - Not re-checked: sampled out of challenge run
chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Sign in to tag this passage
-
Theorem · main statement · Projections
✕Not formalized
The face-first parallel projection of the tesseract into three-dimensional space has a cuboidal envelope.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt d30303636814). - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
-
Theorem · supporting · Projections
✕Not formalized
Two pairs of cells project to the upper and lower halves of this envelope, and the four remaining cells project to the side faces.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 4 queries and 1 candidates examined (receipt 1b42f0cb0b0a). - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
-
Theorem · supporting · Projections
✕Not formalized
Two pairs of cells project to the upper and lower halves of this envelope, and the four remaining cells project to the side faces.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 4 queries and 1 candidates examined (receipt 3ab0529af21f). - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
-
Theorem · main statement · Projections
✕Not formalized
The edge-first parallel projection of the tesseract into three-dimensional space has an envelope in the shape of a hexagonal prism.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt a2470ffcf7d6). - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
-
Theorem · supporting · Projections
✕Not formalized
Six cells project onto rhombic prisms, which are laid out in the hexagonal prism in a way analogous to how the faces of the 3D cube project onto six rhombs in a hexagonal envelope under vertex-first projection.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 4 queries and 1 candidates examined (receipt bb683ef1ba7f). - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
-
Theorem · supporting · Projections
✕Not formalized
The two remaining cells project onto the prism bases.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 4 queries and 1 candidates examined (receipt a08486754e52). - Not re-checked: sampled out of challenge run
chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Sign in to tag this passage
-
Theorem · main statement · Projections
✕Not formalized
The vertex-first parallel projection of the tesseract into three-dimensional space has a rhombic dodecahedral envelope.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt 7544180a40a8). - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
-
Theorem · supporting · Projections
✕Not formalized
Two vertices of the tesseract are projected to the origin.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt 5498eddd4d37). - Not re-checked: sampled out of challenge run
chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Sign in to tag this passage
-
Theorem · supporting · Projections
✕Not formalized
There are exactly two ways of dissecting a rhombic dodecahedron into four congruent rhombohedra, giving a total of eight possible rhombohedra, each a projected cube of the tesseract.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt 4a37a4c0c7ec). - Not re-checked: sampled out of challenge run
chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Sign in to tag this passage
-
Theorem · supporting · Projections
✕Not formalized
This projection is also the one with maximal volume.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt 3343657f53f4). - Not re-checked: sampled out of challenge run
chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Sign in to tag this passage
-
Example · supporting · Projections
✕Not formalized
One set of projection vectors are u = (1,1,−1,−1), v = (−1,1,−1,1), w = (1,−1,−1,1).
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt 24246fc87c1c). - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
-
Theorem · main statement · Projections
✕Not formalized
The tetrahedron forms the convex hull of the tesseract's vertex-centered central projection.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt 577ebbf9963e). - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
-
Theorem · main statement · Tessellation
✓Formalized
Formalized: Mathlib states a more general result (proved).
The tesseract, like all hypercubes, tessellates Euclidean space.
Show in article · Read it in context on Wikipedia ↗
ZSpan.exist_unique_vadd_mem_fundamentalDomain more general
theorem ZSpan.exist_unique_vadd_mem_fundamentalDomain {E : Type*} {ι : Type*} {K : Type*} [NormedField K] [NormedAddCommGroup E] [NormedSpace K E] (b : Module.Basis ι K E) [LinearOrder K] [IsStrictOrderedRing K] [FloorRing K] [Finite ι] (x : E) : ∃! v, v +ᵥ x ∈ ZSpan.fundamentalDomain b
Mathlib.Algebra.Module.ZLattice.Basic · lines 259–264
Why more general: The declaration works with the half open representative of each tile, so copies meet along their boundaries and every point is covered once, and it is stated for the region of an arbitrary basis.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: it survived. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
ac7e5b1f39f3 · pair key 384b834953ff.
Related, but states something else
ZSpan.isAddFundamentalDomain related
theorem ZSpan.isAddFundamentalDomain {E : Type*} {ι : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] (b : Module.Basis ι ℝ E) [Finite ι] [MeasurableSpace E] [OpensMeasurableSpace E] (μ : MeasureTheory.Measure E) : MeasureTheory.IsAddFundamentalDomain (↥(Submodule.span ℤ (Set.range ⇑b))) (ZSpan.fundamentalDomain b) μ
Mathlib.Algebra.Module.ZLattice.Basic · lines 352–357
How it differs: It asserts an almost-everywhere fundamental domain for a lattice acting on a normed space, where the passage asserts an exact space-filling arrangement of cubes; reaching the cube also needs a separate unfolding of the fundamental domain of the standard basis.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: it survived. - Record set
tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. - Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit
3dfb8e2. - Location key
2ef982e595ac · pair key 449cd6225fff.
Sign in to tag this passage
-
Theorem · main statement · Tessellation
✕Not formalized
The self-dual tesseractic honeycomb consisting of 4 tesseracts around each face has Schläfli symbol {4,3,3,4}.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt d1b4e9c2fbed). - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
-
Theorem · main statement · Tessellation
✕Not formalized
Hence, the tesseract has a dihedral angle of 90°.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt 0f96724d741f). - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
-
Theorem · main statement · Tessellation
✕Not formalized
The tesseract's radial equilateral symmetry makes its tessellation the unique regular body-centered cubic lattice of equal-sized spheres, in any number of dimensions.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt 894b8cee4538). - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
-
Theorem · main statement · Related polytopes and honeycombs
✕Not formalized
The regular tesseract, along with the 16-cell, exists in a set of 15 uniform 4-polytopes with the same symmetry.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt 1da5c1fff037). - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
-
Theorem · supporting · Related polytopes and honeycombs
✕Not formalized
The tesseract {4,3,3} exists in a sequence of regular 4-polytopes and honeycombs, {p,3,3} with tetrahedral vertex figures, {3,3}.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 4 queries and 1 candidates examined (receipt 587cb772d76d). - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
-
Theorem · supporting · Related polytopes and honeycombs
✕Not formalized
The tesseract is also in a sequence of regular 4-polytope and honeycombs, {4,3,p} with cubic cells.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 4 queries and 1 candidates examined (receipt 625527f97625). - Not re-checked: sampled out of challenge run
chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Sign in to tag this passage
-
Theorem · main statement · Related polytopes and honeycombs
✕Not formalized
The regular complex polytope 4{4}2, , in ℂ2 has a real representation as a tesseract or 4-4 duoprism in 4-dimensional space.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 4 queries and 1 candidates examined (receipt 7074aaa652fa). - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
-
Theorem · supporting · Related polytopes and honeycombs
✕Not formalized
4{4}2 has 16 vertices, and 8 4-edges.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 5 queries and 1 candidates examined (receipt 771229cc4802). - Not re-checked: sampled out of challenge run
chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Sign in to tag this passage
-
Theorem · supporting · Related polytopes and honeycombs
✕Not formalized
Its symmetry is 4[4]2, order 32.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 4 queries and 1 candidates examined (receipt b963adecf2e7). - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
-
Theorem · supporting · Related polytopes and honeycombs
✕Not formalized
It also has a lower symmetry construction, , or 4{}×4{}, with symmetry 4[2]4, order 16.
Show in article · Read it in context on Wikipedia ↗
✕Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details
- Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: the search receipt lists 4 queries and 1 candidates examined (receipt c469027ab30a). - Not re-checked: sampled out of challenge run
chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Sign in to tag this passage