Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passaudited 2026-10-08
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Euclidean simplices with the same facet-normal Gram matrix are similar facet to facet

Statement

Let I be a finite set with ∣I∣=n+1, and let E,E′ be Euclidean affine spaces of dimension n (Finite-dimensional vector space, and its dimension dim⁡FV; infinite-dimensional means having no finite basis) with direction spaces V,V′ (Affine subspaces as translates x+U of linear subspaces). Choose origins in E,E′ so points are written in V,V′. Let σ⊆E and σ′⊆E′ be nonempty bounded n-simplices (The geometric simplex spanned by affinely independent vertices) presented as σ={φ∈V:⟨ui,φ⟩≥ci for all i∈I},σ′={φ′∈V′:⟨ui′,φ′⟩≥ci′ for all i∈I}, where each half-space defines one of the distinct facets, ui∈V and ui′∈V′ are unit inward normals, and ci,ci′∈R. Suppose ⟨ui,uj⟩=⟨ui′,uj′⟩ for all i,j∈I. Then there are a linear isometry T:V→V′, a point y0∈E′ and a number t>0 such that the similarity f(φ)=y0+t T(φ) satisfies f(σ)=σ′ and carries the facet of σ with normal ui onto the facet of σ′ with normal ui′ for every i∈I. In particular the groups generated by the reflections of E in the facets of σ and of E′ in the facets of σ′ are conjugate by the similarity f, hence isomorphic as reflection groups acting on Euclidean spaces.

Facts & Assumptions

Given: A finite set I with ∣I∣=n+1; Euclidean affine spaces E,E′ of dimension n with direction spaces V,V′, each identified with its direction space by a fixed origin, so that the points of E and E′ are written as vectors of V and V′; nonempty bounded n-simplices σ⊆E, σ′⊆E′ presented by the half-spaces of the statement, with unit normals ui∈V, ui′∈V′, offsets ci,ci′ and facet hyperplanes Hi={φ:⟨ui,φ⟩=ci}, Hi′={φ′:⟨ui′,φ′⟩=ci′}; and the common Gram matrix, ⟨ui,uj⟩=⟨ui′,uj′⟩ for all i,j∈I.

[F1]

A real inner product space satisfies ⟨v,v⟩≥0 for every v, with ⟨v,v⟩=0 only for v=0, and the induced norm is ∥v∥=⟨v,v⟩ (Real and complex inner-product spaces and their induced length).

[F2]

A geometric simplex is the convex hull of finitely many affinely independent points, its vertices, and its points are exactly the convex combinations of those vertices (The geometric simplex spanned by affinely independent vertices).

[F3]

A subset U of a Euclidean space is convex when it contains the segment between any two of its points (A convex subset of Rm contains every line segment between two of its points).

[F4]

A face of a convex set K is a nonempty convex subset F⊆K such that (1−t)y+tz∈F with y,z∈K and 0<t<1 implies y,z∈F; so a face is closed under the operation of splitting off vertices of convex combinations (Extreme point and face).

[F5]

The orthogonal complement of a subspace W of an inner product space is W⊥={v:⟨v,w⟩=0 for every w∈W}, a linear subspace (The orthogonal complement W⊥={v:⟨v,w⟩=0 for all w∈W}).

[F6]

For every subspace W of a finite-dimensional real inner product space V one has V=W⊕W⊥: every v∈V is uniquely w+z with w∈W and z∈W⊥ (For a subspace W of a finite-dimensional inner product space, V=W⊕W⊥).

[F7]

A linear map T:V→V′ of inner product spaces is a linear isometry when ∥Tv∥=∥v∥ for all v; if T preserves inner products then it is a linear isometry by [F1] (Linear isometries, and orthogonal or unitary operators on finite-dimensional inner product spaces).

[F8]

Let A:V→W be linear with V finite-dimensional. There are a basis K of ker⁡A and a basis B of V with K⊆B, and for C=B∖K the restriction A∣C is a bijection onto a basis A[C] of im⁡A; hence dim⁡V=dim⁡ker⁡A+dim⁡im⁡A (Extending a basis of the kernel to a basis of the domain gives a basis of the image).

[F9]
[F10]

A function T:V→W is linear when T(au+bv)=aT(u)+bT(v) for all scalars a,b and vectors u,v (Linear map between vector spaces over the same field).

[F11]

A linear map between inner-product spaces is a linear isometry when it preserves the induced norm (Linear isometries, and orthogonal or unitary operators on finite-dimensional inner product spaces).

[F12]

A map between metric spaces is an isometry when it preserves distances and is bijective (Isometry, isometric embedding, and the subspace metric on a subset).

Proof

technique · direct; the vertex equations of the two simplices force all coefficients of the unique relation among the normals to have one sign, and the relation then reconstructs the translation
1.1F5F6givenalgebra

(Complements of one normal span.) Fix k∈I and put Wk:=span⁡{uj:j≠k}. If v∈Wk⊥, then ⟨uj,v⟩=0 for all j≠k. For φ∈σ and λ∈R, the point φ+λv satisfies those other inequalities for every λ; the k-th slack ⟨uk,φ+λv⟩−ck is affine in λ and is nonnegative at 0, so if ⟨uk,v⟩≠0 its admissible values contain an unbounded half-line, while if ⟨uk,v⟩=0 they are all of R. This contradicts boundedness of σ, so Wk⊥={0} [F5]. By [F6], every x∈V is w+z with w∈Wk and z∈Wk⊥={0}; hence Wk=V. Thus every family obtained by omitting one uk spans V, and in particular all the ui span V. The same argument applied to σ′ shows that the ui′ span V′.

1.2F2F3F4givenalgebra

(Vertices opposite facets.) Write σ=conv⁡{v0,…,vn} with affinely independent vertices [F2]. Every face F of σ is the convex hull of the vertices it contains: if z=∑kλkvk∈F is a convex combination, a single positive coefficient gives z=vk∈F; otherwise split off any term with 0<λk<1 as z=λkvk+(1−λk)y. The face property [F4] puts vk,y in F, and induction on the number of positive coefficients puts every vertex used in z in F. Thus z∈conv⁡(F∩{v0,…,vn}); the reverse inclusion follows from convexity [F3]. For the facet Fi=σ∩Hi, let Si:=Fi∩{v0,…,vn}. Then Fi=conv⁡(Si) and Si is nonempty; its points are affinely independent, so its affine span has dimension ∣Si∣−1 (subtracting one point gives ∣Si∣−1 linearly independent vectors spanning the direction space). Since this affine span is Hi, of dimension n−1, ∣Si∣=n. Hence there is a unique vertex wi outside Fi, and ⟨ui,wi⟩>ci. If j≠i and wi∉Sj, then Sj⊆Si and both have size n, so Sj=Si and Fj=Fi, contradicting that the indexed facets are distinct. Thus wi∈Sj, so ⟨uj,wi⟩=cj for every j≠i. Applying the same argument to σ′ gives opposite vertices wi′ with ⟨uj′,wi′⟩=cj′ for j≠i and ⟨ui′,wi′⟩>ci′.

2.1F1step 1.1algebra

(A nonzero relation valid for both normal families.) Fix k∈I. By step 1.1, uk=∑j≠kajuj for some real aj; put pk:=1 and pj:=−aj for j≠k. Then p∈RI is nonzero and ∑ipiui=0, so p is a relation among the normals. The same vector is a relation among the primed normals: ∥∑ipiui′∥2=∑i,jpipj⟨ui′,uj′⟩=∑i,jpipj⟨ui,uj⟩=∥∑ipiui∥2=0, hence ∑ipiui′=0 by [F1].

2.2F1F7F10step 1.1algebra

(The linear isometry.) Define T:V→V′ on a combination of the ui by T(∑iaiui):=∑iaiui′. This is well defined: if ∑iaiui=0 then ∥∑iaiui′∥2=∑i,jaiaj⟨ui′,uj′⟩=∑i,jaiaj⟨ui,uj⟩=∥∑iaiui∥2=0, so ∑iaiui′=0 by [F1]. By construction T is linear in the sense of [F10], satisfies T(ui)=ui′, and preserves inner products: ⟨T(∑iaiui),T(∑jbjuj)⟩=∑i,jaibj⟨ui′,uj′⟩=∑i,jaibj⟨ui,uj⟩=⟨∑iaiui,∑jbjuj⟩; so T is a linear isometry [F1, F7, F10]. Since the ui′ span V′ [step 1.1], the image of T is V′, and T is bijective.

3.1step 2.1step 1.2algebra

(Sign consistency and the two offset sums.) Put R:=∑ipici and R′:=∑ipici′. For each i, using ⟨uj,wi⟩=cj for j≠i from step 1.2 and ∑kpkuk=0 from step 2.1, 0=⟨∑kpkuk,wi⟩=pi⟨ui,wi⟩+∑k≠ipkck=pi(⟨ui,wi⟩−ci)+R. Since ⟨ui,wi⟩−ci>0 [step 1.2], the number R is nonzero and pi has the sign of −R, for every i: all coefficients pi are nonzero and of one sign. Applying the same computation to the primed simplex, using the opposite vertices from step 1.2 and the primed relation from step 2.1, gives pi(⟨ui′,wi′⟩−ci′)=−R′ for every i, so R′≠0 and pi has the sign of −R′. Thus R′ and R have the same sign, and t:=R′/R>0.

4.1F5F8F9step 1.1step 2.1step 3.1algebra

(The translation solving the offset equations.) Put Δ:=(ci′−tci)i∈I∈RI. By step 3.1, ∑ipiΔi=R′−tR=0, i.e. Δ⊥p [F5]. Let A:V′→RI be the linear map A(y):=(⟨ui′,y⟩)i∈I. Its kernel is trivial: if A(y)=0 then ⟨ui′,y⟩=0 for all i, so y⊥span⁡{ui′}=V′ by step 1.1 and y=0 by [F1]. By [F8] (applied to the coordinate basis of RI, of ∣I∣=n+1 elements) dim⁡im⁡A=dim⁡V′=n; the kernel of the nonzero functional RI→R, x↦∑ipixi, is p⊥. It is nonzero because p≠0 [step 2.1], so its image is the one-dimensional space R; [F8] therefore gives dim⁡p⊥=(n+1)−1=n. Moreover im⁡A⊆p⊥, because for x=A(y) one has ∑ipixi=⟨∑ipiui′,y⟩=0 by step 2.1. As im⁡A and p⊥ are subspaces of p⊥ of the same dimension n, [F9] gives im⁡A=p⊥; since Δ⊥p, there is y0∈V′ with ⟨ui′,y0⟩=ci′−tci for every i∈I.

5.1step 2.2step 4.1givenalgebra

(The similarity and the facet correspondence.) For φ∈V and i∈I, using T(ui)=ui′ and inner-product preservation of step 2.2 and the point y0 of step 4.1, ⟨ui′,y0+tT(φ)⟩=(ci′−tci)+t⟨ui,φ⟩. Hence y0+tT(φ)∈σ′ if and only if ⟨ui,φ⟩≥ci for all i, that is, if and only if φ∈σ; so f(φ):=y0+tT(φ) maps σ onto σ′, and ⟨ui′,f(φ)⟩=ci′ if and only if ⟨ui,φ⟩=ci, so f carries the facet Fi of σ onto the facet Fi′ of σ′. Since t>0 and T is a linear isometry, f is a similarity.

6.1F11F12step 2.2step 4.1step 5.1algebra∎

(Conjugating the facet reflections.) For i∈I define si:V→V by si(φ):=φ+2(ci−⟨ui,φ⟩)ui. Its linear part ri(φ):=φ−2⟨ui,φ⟩ui preserves the norm: using ∥ui∥=1 and bilinearity, ∥ri(φ)∥2=∥φ∥2−4⟨ui,φ⟩2+4⟨ui,φ⟩2∥ui∥2=∥φ∥2. It fixes ui⊥ and sends ui to −ui, so it is the reflection across ui⊥ and is a linear isometry [F11]. Since si=ri+2ciui, it preserves distances; direct substitution gives si2=id, and si fixes Hi pointwise. Thus si is the affine reflection in Hi and is an isometry [F12]. Let si′ be the corresponding reflection of E′ defined by the primed data. Then for every ψ∈V′, writing f−1(ψ)=T−1((ψ−y0)/t) and using ⟨ui,f−1(ψ)⟩=(⟨ui′,ψ⟩−ci′+tci)/t, f(si(f−1(ψ)))=ψ+2t(ci−⟨ui,f−1(ψ)⟩)ui′=ψ+2(ci′−⟨ui′,ψ⟩)ui′=si′(ψ). Thus f∘si∘f−1=si′ for every i, and the map Cf:g↦f∘g∘f−1 carries the group generated by the si onto the group generated by the si′. It preserves composition since Cf(g∘h)=Cf(g)∘Cf(h), and its inverse is h↦f−1∘h∘f; hence it is an isomorphism of the two reflection groups.

Depends on

Used by

Dependency tree · two levels

66 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources