ScalingStacks

Proof (0LLN)

Source history

David Gepner, Joachim Kock

Original source: arXiv:1208.1749v5

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

The permanent identity and original source provenance are retained below.

{
  "key": "work:W000031:pdf:029c81cbf8b0874dcc86e04888d2586964eb82acd74ea6038c1ed5bc751fbcb8:page:19:bbox:72.001,188.368,539.984,199.023",
  "first_source_version": "1208.1749v5",
  "chapter": "work-w000031",
  "work": "W000031",
  "kind": "Proof",
  "number": "",
  "title": "Proof. If p is n-connected, then τ≤n(p) is n-connected by Lemma 4.3, and is clearly also n-truncated, hence",
  "source_version": "1208.1749v5",
  "source": {
    "pdf_sha256": "029c81cbf8b0874dcc86e04888d2586964eb82acd74ea6038c1ed5bc751fbcb8",
    "page": 19,
    "bbox": [
      72.001,
      188.368,
      539.984,
      199.023
    ]
  },
  "target": "/chapters/work-w000031.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.