Papers
Topics
Authors
Recent
Search
2000 character limit reached

SymTFTs for $U(1)$ symmetries from descent

Published 22 Nov 2024 in hep-th | (2411.15126v1)

Abstract: Recently, the notion of symmetry descent has been introduced in order to obtain the $(d+1)$-dimensional Symmetry TFT (SymTFT) of a $d$-dimensional QFT from the edge mode behaviour of a theory in $(d+2)$-dimensions. This method has so far been used to obtain SymTFTs for discrete higher-form symmetries of geometrically engineered QFTs. In this note, we extend the symmetry descent procedure to obtain SymTFTs for $U(1)$ higher-form symmetries of geometrically engineered QFTs. We find the resulting SymTFTs match those in the works of Antinucci-Benini and Brennan-Sun.

Citations (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Practical Applications

Overview

This paper develops a symmetry-descent procedure to derive Symmetry Topological Field Theories (SymTFTs) for continuous abelian higher-form symmetries (U(1)) in geometrically engineered quantum field theories (QFTs). It unifies the treatment of discrete and continuous sectors using differential cohomology and, where needed, differential K-theory, and provides explicit formulas for BF-type couplings determined by intersection data on the link of the engineering geometry. The results match known SymTFTs from Antinucci–Benini and Brennan–Sun and clarify bulk–boundary duality-frame issues via string-theoretic inflow.

Below are practical applications and potential workflows, grouped into immediate and long-term categories, with sector tags and key assumptions or dependencies.

Immediate Applications

  • Automated derivation of SymTFTs from geometric input (academia, software)
    • Use case: Build a “SymTFT-from-geometry” pipeline that ingests toric data or a triangulation of the engineering space X and its link L, computes cohomology (including torsion), and outputs the SymTFT BF-sector Lagrangian with coefficients K_{i,j} and J_{i,j}.
    • Potential tools/products/workflows:
    • A Python/SageMath library implementing Hopkins–Singer differential cochains, cup products, and the symmetry descent equation; modules to compute intersection numbers on L and assemble the action in the form shown in the paper.
    • A “Defect group calculator” using H_k(L) to enumerate higher-form symmetries via the formula D = ⊕_n H_k(L).
    • Integration with existing packages (SageMath Homology/Cohomology, HAP/Kenzo, SnapPy for 3-manifolds) for computing cohomology and pairings.
    • Assumptions/dependencies:
    • Availability of geometric data (X, L), including a triangulation or cell decomposition.
    • Correct identification of cycles that support brane wrapping (relative homology H_{k+1}(X,L)/H_{k+1}(X)).
    • The compactness of symmetry groups consistent with string embeddings (U(1) rather than R).
  • Unified treatment of discrete and U(1) higher-form symmetries in model building and anomaly checks (academia)
    • Use case: Rapidly verify symmetry content and anomaly inflow of geometrically engineered QFTs (e.g., 6d N=(1,1) su(N)), including boundary-condition choices and duality frames.
    • Potential tools/products/workflows:
    • “Anomaly descent checker” that matches discrete (torsion) and continuous (free) sectors via K_{i,j} and J_{i,j}, and flags terms trivial in the path integral (2πi × integers).
    • Notebooks demonstrating explicit examples (e.g., S3/ZN) with torsional linking pairings and continuous sectors.
    • Assumptions/dependencies:
    • Correct uplift to differential cohomology and, when needed, differential K-theory for RR fields and anomalies.
    • Accurate treatment of bulk BF terms with boundaries and gauge non-invariance.
  • Educational modules and visualization (education, software)
    • Use case: Curriculum modules that walk students through symmetry descent, torsion vs. free generators, and KK reduction to obtain BF couplings in lower dimensions.
    • Potential tools/products/workflows:
    • Interactive visualization of linking pairings and cup products on L.
    • Side-by-side implementations: differential cohomology vs. differential form KK reductions to highlight discrete vs. continuous sectors.
    • Assumptions/dependencies:
    • Availability of example manifolds and computed cohomology.
    • Simplified cases (e.g., lens spaces) for teaching.
  • Prototype lattice discretizations of BF SymTFTs for benchmarking (academia, quantum simulation)
    • Use case: Create discretized BF models (including mixed Z_n and U(1) sectors) for numerical experiments and benchmarking in classical simulations, with a roadmap to quantum simulators (Rydberg arrays, cold atoms).
    • Potential tools/products/workflows:
    • Mapping cochain-level actions to lattice Hamiltonians, enforcing integrality constraints on “n” cochains and 2π periodicity for U(1) fields.
    • Assumptions/dependencies:
    • Restriction to compact U(1) symmetry; careful choice of boundary conditions (Dirichlet/Neumann) reflecting duality frames.
    • Experimental implementation remains preliminary for higher-form U(1) in the lab.

Long-Term Applications

  • Differential K-theory engines for anomaly-aware SymTFT generation (software, academia)
    • Use case: A full-featured computational platform to derive SymTFTs with anomalies and nontrivial duality frames, treating electric/magnetic sectors on equal footing via differential K-theory.
    • Potential tools/products/workflows:
    • “dK-Theory Compute” library integrated with geometry packages to produce RR-class data, anomaly polynomials, and symmetry TFTs automatically.
    • HPC workflows to handle complex links and large N examples.
    • Assumptions/dependencies:
    • Mature implementations of differential K-theory in computational stacks.
    • Verified bulk–boundary inflow models and consistent duality-frame handling.
  • Database of engineered QFTs and their SymTFTs (academia, infrastructure)
    • Use case: A curated repository linking geometries (X, L), cohomology data, defect groups, and SymTFT actions across dimensions and gauge algebras.
    • Potential tools/products/workflows:
    • Web-accessible registry with queryable invariants and symmetry content; interoperability with existing math-physics databases.
    • Assumptions/dependencies:
    • Community standards for data formats and validation.
    • Ongoing curation and cross-verification with literature.
  • Design principles for quantum materials and topological orders with higher-form symmetries (condensed matter, materials)
    • Use case: Use the unified discrete/U(1) SymTFT framework to classify and predict Symmetry-Protected Topological (SPT) and Symmetry-Enriched Topological (SET) phases with higher-form global symmetries, guiding candidate materials or synthetic platforms.
    • Potential tools/products/workflows:
    • Translating BF actions to effective field theories of low-energy excitations; symmetry constraints shaping phase diagrams.
    • Interface with numerical tensor-networks or cold-atom design tools for realizing specific symmetry patterns.
    • Assumptions/dependencies:
    • Feasible mapping from continuum SymTFTs to lattice/continuum Hamiltonians in real materials.
    • Experimental control over higher-form symmetry realizations (still developing).
  • Symmetry-informed quantum error correction and topological qubits (quantum technologies)
    • Use case: Explore error-correcting codes and topological qubits protected by mixed discrete/U(1) higher-form symmetries and cohomological constraints (generalizing toric-code-like constructions).
    • Potential tools/products/workflows:
    • Cochain-based code designs that enforce integrality and compact U(1) periodicity, with tunable boundary conditions mimicking duality frames.
    • Assumptions/dependencies:
    • A robust mapping from higher-form SymTFTs to stabilizer/non-stabilizer code architectures.
    • Hardware capable of realizing multi-form constraints and nontrivial boundary conditions.
  • Holographic boundary-condition engineering via duality frames (theoretical physics, academia)
    • Use case: Systematic design of boundary CFTs by choosing electromagnetic duality frames and boundary conditions in bulk, informed by the symmetry descent and KK analysis.
    • Potential tools/products/workflows:
    • Catalog of dual boundary theories from a single bulk via Dirichlet/Neumann choices; automated gauging operations on boundary symmetries.
    • Assumptions/dependencies:
    • Reliable bulk–boundary dictionaries; control over self-duality constraints (e.g., F5 = *F5 in IIB).
  • Constraints for particle-physics model building (particle physics)
    • Use case: Employ symmetry descent and anomaly-aware SymTFTs to constrain global symmetries, selection rules, and allowed couplings in beyond-the-Standard-Model scenarios with string-theoretic embeddings.
    • Potential tools/products/workflows:
    • Automated checks of compactness, higher-form symmetry content, and anomaly inflow for candidate models.
    • Assumptions/dependencies:
    • Existence of stringy or geometric engineering embeddings for candidate theories.
    • Community adoption of higher-form symmetry constraints in phenomenology.

General Assumptions and Dependencies (cross-cutting)

  • Geometric engineering is available: X is a singular space (often toric) with a boundary link L whose cohomology is computable; non-compact cycles support brane wrappings.
  • Differential cohomology/K-theory formulation: Required to treat torsion (discrete sectors), continuous U(1) sectors, and anomalies consistently.
  • Compact symmetry groups: The framework models U(1) (not R) gauge fields, consistent with string theory spectra.
  • Boundary conditions and duality frames: Physical interpretation depends on choices (Dirichlet/Neumann), and bulk electromagnetic duality generally maps between frames.
  • Computational tractability: Intersection numbers, linking pairings, and cochain-level operations must be efficiently computable for practical deployment.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 1 tweet with 3 likes about this paper.