Solution: In a regular tetrahedron, all edges are equal. Compute distances:

["Understanding Distances in a Regular Tetrahedron: A Simple Yet Powerful Geometric Solution", "In the world of geometry, few three-dimensional shapes inspire as much beauty and symmetry as the regular tetrahedron. With four equilateral triangular faces, six equal edges, and four vertices equidistant from one another, this elegant solid serves as a cornerstone in mathematical modeling, crystallography, and structural design. One compelling aspect of studying the regular tetrahedron lies in computing precise distances among its vertices—especially since its uniformity simplifies what might otherwise seem complex.", "This article explores the solution to computing distances in a regular tetrahedron, emphasizing how its symmetry enables elegant, standardized calculations. Whether you're a student, educator, or enthusiast, understanding these distances unlocks deeper insights into three-dimensional geometry.", "---", "### What is a Regular Tetrahedron?", "A regular tetrahedron is a polyhedron with:", "- Four vertices\n- Six identical edges\n- Four equilateral triangular faces\n- All internal angles congruent and all faces congruent", "The key property—equal edge lengths—provides a powerful constraint that simplifies all distance computations.", "---", "### Why Compute Distances in a Regular Tetrahedron?", "Understanding distances between vertices supports applications in:", "- Geometric modeling: Simulating physical models\n- Crystallography: Studying atomic arrangements\n- Computer graphics: Rendering 3D objects\n- Engineering: Designing stable structures\n- Education: Teaching spatial reasoning and symmetry", "Moreover, the symmetry of the regular tetrahedron allows us to derive distances using coordinate geometry, reducing complicated trigonometric problems to algebraic computations.", "---", "### Setting Up the Problem: Equilateral Tetrahedron Coordinates", "To compute distances methodically, we fix a convenient coordinate system. A regular tetrahedron with edge length ( a ) can be embedded in 3D space with vertices chosen for symmetry and simplicity.", "One standard placement is:", "- ( A = (1, 1, 1) )\n- ( B = (1, -1, -1) )\n- ( C = (-1, 1, -1) )\n- ( D = (-1, -1, 1) )", "All edges in this setup have equal length:", "[\n\ ext{Edge length } a = \sqrt{(1 - 1)^2 + (1 - (-1))^2 + (1 - (-1))^2} = \sqrt{0 + 4 + 4} = \sqrt{8} = 2\sqrt{2}\n]", "Scaling to edge length ( L ), we divide each coordinate by ( \frac{2\sqrt{2}}{L} ), but for distance ratios, the unscaled symmetry remains vital.", "---", "### Computing Distances Between Vertices", "Since all edges are equal, the distance between any two distinct vertices is always:", "[\n\boxed{L = \sqrt{8} = 2\sqrt{2} \quad \ ext{(for unscaled tetrahedron)}}\n]", "But let’s generalize for any edge length ( L ).", "---", "### Step-by-Step Distance Computation", "#### Step 1: Fix coordinates preserving regularity", "Use vectors based on regular tetrahedron geometry. A clean vector representation uses basis vectors in ( \mathbb{R}^3 ) that preserve equal distances.", "Let vertices be:", "- ( V_1 = (0, 0, 0) )\n- ( V_2 = (L, 0, 0) )\n- ( V_3 = \left(\frac{L}{2}, \frac{L\sqrt{3}}{2}, 0\right) ) — equilateral triangle in ( xy )-plane\n- ( V_4 = \left(\frac{L}{2}, \frac{L\sqrt{3}}{6}, \frac{L\sqrt{6}}{3}\right) ) — apex above centroid", "These coordinates ensure all six edge lengths are ( L ).", "#### Step 2: Compute one key distance", "We compute distance ( d = |V_1 - V_4| ):", "[\nd = \sqrt{ \left(\frac{L}{2} - 0\right)^2 + \left(\frac{L\sqrt{3}}{6} - 0\right)^2 + \left(\frac{L\sqrt{6}}{3} - 0\right)^2 }\n]", "Calculate each term:", "- ( \left(\frac{L}{2}\right)^2 = \frac{L^2}{4} )\n- ( \left(\frac{L\sqrt{3}}{6}\right)^2 = \frac{3L^2}{36} = \frac{L^2}{12} )\n- ( \left(\frac{L\sqrt{6}}{3}\right)^2 = \frac{6L^2}{9} = \frac{2L^2}{3} )", "Add:", "[\nd^2 = \frac{L^2}{4} + \frac{L^2}{12} + \frac{2L^2}{3} = L^2\left(\frac{3}{12} + \frac{1}{12} + \frac{8}{12}\right) = L^2 \cdot \frac{12}{12} = L^2\n]", "So,\n[\nd = L\n]", "This confirms that from apex to base vertex is exactly edge length.", "---", "### All Pairwise Distances Are Equal", "Because of symmetry:", "- Distance between base vertices (e.g., ( V_1 ) to ( V_2 ), ( V_2 ) to ( V_3 ), etc.) = ( L )\n- Distance from apex ( V_4 ) to each base vertex = ( L )", "Hence, every pairwise distance among the four vertices in a regular tetrahedron is equal to the edge length ( L ).", "This elegant uniformity is the solution: the symmetry enforces all connections to be identical, allowing elegant computation with consistent results.", "---", "### General Formula for Any Regular Tetrahedron", "Let ( a ) be the edge length. Then the distance between any two distinct vertices is:", "[\n\boxed{ \ ext{Distance} = a }\n]", "This result holds regardless of orientation—geometric symmetry guarantees uniformity.", "---", "### Advanced Insight: Centroid and Height", "The height ( h ) from a base face to the opposite vertex is:", "[\nh = \frac{L\sqrt{6}}{3}\n]", "This supports volume computation ( V = \frac{\sqrt{2}}{12} a^3 ), and confirms inter-vertex distances remain unaffected.", "---", "### Conclusion", "Computing distances in a regular tetrahedron benefits from its perfect symmetry, reducing what could be complex trigonometric calculations to straightforward algebraic evaluations. By fixing a coordinate system rooted in geometric elegance, and leveraging uniform edge lengths, we deduce that:", "- All six edges are equal\n- Every pairwise distance equals the edge length ( L )\n- This invariant, arising from the tetrahedron’s symmetry, is the key solution", "Understanding this solution not only deepens geometric intuition but also equips learners, researchers, and practitioners with tools applicable across science and engineering.", "---", "### Further Reading", "- Geometric properties of regular polyhedra\n- Vector algebra in 3D space\n- Symmetry and invariants in geometry", "---", "Keywords: regular tetrahedron, distances in tetrahedron, geometric computation, edge length, symmetry, 3D geometry, coordinate geometry, polyhedron distances, computational geometry, mathematical solution"]