ScalingStacks

Proof (0GVF)

Source history

Lurie, Jacob

Detailed backend records are private. Public author/source status appears above.

The permanent identity and original source provenance are retained below.

{
  "key": "work:W000049:pdf:112b145a95a62daefb8275851cac9ab6430004cfc8f751a33a8d981fd7ad68c3:page:965:bbox:90.0,458.978,558.009,471.576",
  "first_source_version": "2017-09-18",
  "chapter": "work-w000049",
  "work": "W000049",
  "kind": "Proof",
  "number": "",
  "title": "Proof. We first prove that Ran(M)S is path connected. Let T be a subset of M containing S. For",
  "source_version": "2017-09-18",
  "source": {
    "pdf_sha256": "112b145a95a62daefb8275851cac9ab6430004cfc8f751a33a8d981fd7ad68c3",
    "page": 965,
    "bbox": [
      90.0,
      458.978,
      558.009,
      471.576
    ]
  },
  "target": "/chapters/work-w000049.html",
  "identity_basis": "pinned original PDF hash and exact page/bbox; never display number",
  "status": "active"
}

Original mathematics by the credited authors. Source collection and HTML conversion remain in progress.