SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 2209.10566 · 2022

Scanning For Dark Matter Subhalos in Hubble Space Telescope Imaging of 54 Strong Lenses

arXiv · PDF · Open in the Atlas

Code that ran

We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. If it links a repository, it is listed below.

Repositories linked to this paper

Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.

Abstract

The cold dark matter (DM) model predicts that every galaxy contains thousands of DM subhalos; almost all other DM models include a physical process that smooths away the subhalos. The subhalos are invisible, but could be detected via strong gravitational lensing, if they lie on the line of sight to a multiply-imaged background source, and perturb its apparent shape. We present a predominantly automated strong lens analysis framework, and scan for DM subhalos in Hubble Space Telescope imaging of 54 strong lenses. We identify five DM subhalo candidates, including two especially compelling candidates (one previously known in SLACS0946+1006) where a subhalo is favoured after all of our tests for systematics. We find that the detectability of subhalos depends upon the assumed parametric form for the lens galaxy's mass distribution, especially its degree of azimuthal freedom. Using separate components for dark matter and stellar mass reveals two DM subhalo candidates and removes four false-positives compared to the single power-law mass model that is common in the literature. We identify 45 lenses without substructures, the number of which is key to statistical tests able to rule out models of e.g. warm or self-interacting DM. Our full analysis results are available at https://github.com/Jammy2211/autolens_subhalo.

For agents

The same record, over MCP at https://syntology.ai/mcp:

get_harvested_code_for_paper("2209.10566")
get_code_for_paper("2209.10566")
have("2209.10566")

Connect an agent — have() is free.