ScalingStacks

Proof (06R6)

Source history

Eugene Gorsky, Paul Wedrich

Original source: arXiv:1904.04481v2

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

The permanent identity and original source provenance are retained below.

{
  "key": "work:W000033:pdf:2e8be60da8417b71df3d08b9bf9d5074e4aafb8be999cd42bac7c89dc9686a21:page:40:bbox:56.64,287.369,510.205,298.991",
  "first_source_version": "1904.04481v2",
  "chapter": "work-w000033",
  "work": "W000033",
  "kind": "Proof",
  "number": "",
  "title": "Proof. We construct Pn and Qn inductively. For n = 1 let P1 := Cone(1 −p) and Q1 := Cone(p). It is",
  "source_version": "1904.04481v2",
  "source": {
    "pdf_sha256": "2e8be60da8417b71df3d08b9bf9d5074e4aafb8be999cd42bac7c89dc9686a21",
    "page": 40,
    "bbox": [
      56.64,
      287.369,
      510.205,
      298.991
    ]
  },
  "target": "/chapters/work-w000033.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.