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 be a finite set with , and let be Euclidean affine spaces of dimension (Finite-dimensional vector space, and its dimension ; infinite-dimensional means having no finite basis) with direction spaces (Affine subspaces as translates of linear subspaces). Choose origins in so points are written in . Let and be nonempty bounded -simplices (The geometric simplex spanned by affinely independent vertices) presented as where each half-space defines one of the distinct facets, and are unit inward normals, and . Suppose for all . Then there are a linear isometry , a point and a number such that the similarity satisfies and carries the facet of with normal onto the facet of with normal for every . In particular the groups generated by the reflections of in the facets of and of in the facets of are conjugate by the similarity , hence isomorphic as reflection groups acting on Euclidean spaces.
Facts & Assumptions
Given: A finite set with ; Euclidean affine spaces of dimension with direction spaces , each identified with its direction space by a fixed origin, so that the points of and are written as vectors of and ; nonempty bounded -simplices , presented by the half-spaces of the statement, with unit normals , , offsets and facet hyperplanes , ; and the common Gram matrix, for all .
A real inner product space satisfies for every , with only for , and the induced norm is (Real and complex inner-product spaces and their induced length).
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).
A subset of a Euclidean space is convex when it contains the segment between any two of its points (A convex subset of contains every line segment between two of its points).
A face of a convex set is a nonempty convex subset such that with and implies ; so a face is closed under the operation of splitting off vertices of convex combinations (Extreme point and face).
The orthogonal complement of a subspace of an inner product space is , a linear subspace (The orthogonal complement ).
For every subspace of a finite-dimensional real inner product space one has : every is uniquely with and (For a subspace of a finite-dimensional inner product space, ).
A linear map of inner product spaces is a linear isometry when for all ; if preserves inner products then it is a linear isometry by [F1] (Linear isometries, and orthogonal or unitary operators on finite-dimensional inner product spaces).
Let be linear with finite-dimensional. There are a basis of and a basis of with , and for the restriction is a bijection onto a basis of ; hence (Extending a basis of the kernel to a basis of the domain gives a basis of the image).
If is a linear subspace of a finite-dimensional space with , then (If and is a linear subspace of , then is finite-dimensional, , and if and only if ).
A function is linear when for all scalars and vectors (Linear map between vector spaces over the same field).
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).
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
(Complements of one normal span.) Fix and put . If , then for all . For and , the point satisfies those other inequalities for every ; the -th slack is affine in and is nonnegative at , so if its admissible values contain an unbounded half-line, while if they are all of . This contradicts boundedness of , so [F5]. By [F6], every is with and ; hence . Thus every family obtained by omitting one spans , and in particular all the span . The same argument applied to shows that the span .
(Vertices opposite facets.) Write with affinely independent vertices [F2]. Every face of is the convex hull of the vertices it contains: if is a convex combination, a single positive coefficient gives ; otherwise split off any term with as . The face property [F4] puts in , and induction on the number of positive coefficients puts every vertex used in in . Thus ; the reverse inclusion follows from convexity [F3]. For the facet , let . Then and is nonempty; its points are affinely independent, so its affine span has dimension (subtracting one point gives linearly independent vectors spanning the direction space). Since this affine span is , of dimension , . Hence there is a unique vertex outside , and . If and , then and both have size , so and , contradicting that the indexed facets are distinct. Thus , so for every . Applying the same argument to gives opposite vertices with for and .
(A nonzero relation valid for both normal families.) Fix . By step 1.1, for some real ; put and for . Then is nonzero and , so is a relation among the normals. The same vector is a relation among the primed normals: , hence by [F1].
(The linear isometry.) Define on a combination of the by . This is well defined: if then , so by [F1]. By construction is linear in the sense of [F10], satisfies , and preserves inner products: ; so is a linear isometry [F1, F7, F10]. Since the span [step 1.1], the image of is , and is bijective.
(Sign consistency and the two offset sums.) Put and . For each , using for from step 1.2 and from step 2.1, . Since [step 1.2], the number is nonzero and has the sign of , for every : all coefficients 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 for every , so and has the sign of . Thus and have the same sign, and .
(The translation solving the offset equations.) Put . By step 3.1, , i.e. [F5]. Let be the linear map . Its kernel is trivial: if then for all , so by step 1.1 and by [F1]. By [F8] (applied to the coordinate basis of , of elements) ; the kernel of the nonzero functional , , is . It is nonzero because [step 2.1], so its image is the one-dimensional space ; [F8] therefore gives . Moreover , because for one has by step 2.1. As and are subspaces of of the same dimension , [F9] gives ; since , there is with for every .
(The similarity and the facet correspondence.) For and , using and inner-product preservation of step 2.2 and the point of step 4.1, . Hence if and only if for all , that is, if and only if ; so maps onto , and if and only if , so carries the facet of onto the facet of . Since and is a linear isometry, is a similarity.
(Conjugating the facet reflections.) For define by . Its linear part preserves the norm: using and bilinearity, . It fixes and sends to , so it is the reflection across and is a linear isometry [F11]. Since , it preserves distances; direct substitution gives , and fixes pointwise. Thus is the affine reflection in and is an isometry [F12]. Let be the corresponding reflection of defined by the primed data. Then for every , writing and using , . Thus for every , and the map carries the group generated by the onto the group generated by the . It preserves composition since , and its inverse is ; hence it is an isomorphism of the two reflection groups.
Depends on
- The geometric simplex spanned by affinely independent vertices
- Real and complex inner-product spaces and their induced length
- Affine subspaces as translates $x+U$ of linear subspaces
- Linear isometries, and orthogonal or unitary operators on finite-dimensional inner product spaces
- Isometry, isometric embedding, and the subspace metric on a subset
- Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis
- Linear independence: a finite list $v : n \to V$ is independent when $\sum_{i<n} \lambda_i v_i = 0_V$ forces every $\lambda_i = 0_F$, and a subset $S \subseteq V$ is independent when every injective finite list into $S$ is independent
- Invertible linear maps, linear isomorphisms, and inverse linear maps
- Linear subspace of a vector space
- Kernel and image of a linear map
- Linear map between vector spaces over the same field
- Bilinear forms on $V$ correspond linearly and bijectively to linear maps $V\to V^*$
- A convex subset of $\mathbb{R}^m$ contains every line segment between two of its points
- Extreme point and face
- The orthogonal complement $W^\perp=\{v:\langle v,w\rangle=0\text{ for all }w\in W\}$
- For a subspace $W$ of a finite-dimensional inner product space, $V=W\oplus W^\perp$
- Extending a basis of the kernel to a basis of the domain gives a basis of the image
- If $\dim_F V = n$ and $U$ is a linear subspace of $V$, then $U$ is finite-dimensional, $\dim_F U \le n$, and $\dim_F U = n$ if and only if $U = V$
- Finite-dimensional vector space, and its dimension $\dim_F V$; infinite-dimensional means having no finite basis
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
- M. W. Davis, The Geometry and Topology of Coxeter Groups (first-edition author manuscript, Princeton University Press, 2008) (standard reference, not scraped)